Talk:Programming Turn Based Movement
From GPWikiWonderful entry, but could/should there be more elaboration or perhaps separate entries on things like absolute distance (diagonals having a cost of 1), obstructions, or the algorithms used to search the grid nodes for open spaces (changing to a depth-first instead of using the breadth-first method described here)? |
