"Shorter path" procedure for a game... "Quori
Posted: Mon Mar 15, 2010 3:58 pm
Here we go !
I finally managed to write the Astar algorithm of pathfinding in JB.
In this case the goal is to find the shorter path between the GREEN pawn and the horizontal line where is the RED pawn.
To build a wall : select "Mur" and click in the crossing between cells,
every clic change the direction or erase it.
I finally managed to write the Astar algorithm of pathfinding in JB.
In this case the goal is to find the shorter path between the GREEN pawn and the horizontal line where is the RED pawn.
To build a wall : select "Mur" and click in the crossing between cells,
every clic change the direction or erase it.