4 ms·
Learning the A* pathfinding algorithm is a good starting point as this is common in simple tile games. These two links should get you started: [1]: http://www.
by johnymontana 12y ago
Learning the A* pathfinding algorithm is a good starting point as this is common in simple tile games. These two links should get you started:
[1]: http://www.raywenderlich.com/4946/introduction-to-a-pathfinding http://www.raywenderlich.com/4946/introduction-to-a-pathfind...
[2]: http://theory.stanford.edu/~amitp/GameProgramming/ http://theory.stanford.edu/~amitp/GameProgramming/
- mirkules 12y agoI'll second this. Also, for board games like chess or othello, you should take a look at the mini-max algorithm: https://en.wikipedia.org/wiki/Minimax https://en.wikipedia.org/wiki/Minimax
- DaFranker 12y agoCaveat/warning: Oftentimes, learning how to translate your game data into an A* -traversable graph is harder than implementing the A* algorithm itself.