Tag Info

New answers tagged


Of course. Dijkstra's (of which A* is just a refinement) adds nodes to an open list. The usual grid implementation is to consider all adjacent nodes. You can simply change this to only consider nodes on the same column or the column to the right. For termination, the usual algorithm is looking for a specific node or position. You can also change the ...

Top 50 recent answers are included