 |
||||||||||||||||||||||||
 |
 |
 |
 |
|
 |
|
 |
|
 |
|
 |
|
 |
|
 |
|
 |
|
 |
|
 |
|
 |
 |
|
||||||||||||||||||||||||
 |
|
|
|
 |
  Runtime pathfinder[ December 17, 2003 ] by André Michelle This demo shows how to reach any target in a tilemap maze. This version doesn't calculate a full path (like the A*, for example), but in each frame it decides the new direction to find the target. In most cases it is the shortest path and its always very quick (under 1ms). Just some rules must be followed in the maze design: no U formed tiles are allowed. |
||||||||||||||||||||||||||
Download the source code of this prototype |
||||||||||||||||||||||||||
|
||||||||||||||||||||||||||
|
