Page 1 of 1

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

Posted: Mon Mar 15, 2010 3:58 pm
by cassiope01
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.

Posted: Wed Mar 24, 2010 9:49 am
by stpendl
Nice demo, so the next program will be a maze :lol:

Posted: Sun Apr 04, 2010 5:59 pm
by cassiope01
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

Posted: Tue Apr 06, 2010 10:08 am
by tsh73
It's very nice of yoour program to support save/load.
Here is a save that finds wrong path (where should not be one).

Posted: Tue Apr 06, 2010 5:34 pm
by cassiope01
You were right tsh73, there was indeed a small bug : corrected.

You can double click on the board and see what append :D


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