"Shorter path" procedure for a game... "Quori

cassiope01 · Post by **cassiope01** » 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.

Post by **stpendl** » Wed Mar 24, 2010 9:49 am

Nice demo, so the next program will be a maze

cassiope01 · Post by **cassiope01** » Sun Apr 04, 2010 5:59 pm

Here is a version for a maze bigger than 9x9 cells.

maxi 99 x 99

A new important update. on 05/23/2010

Random walls generated. Diagonal possible. Showing work.

Subroutines name translated...

Increasing compute time... 06/05/2010

tsh73 · Post by **tsh73** » Tue Apr 06, 2010 10:08 am

It's very nice of yoour program to support save/load.
Here is a save that finds wrong path (where should not be one).

cassiope01 · Post by **cassiope01** » Tue Apr 06, 2010 5:34 pm

You were right tsh73, there was indeed a small bug : corrected.

You can double click on the board and see what append

Here is a new one to compare Joseph E's AStar algorithm code... and a mix with Janet's Maze generator...