This TS uses the grid path finding mechanism (“Grids\Path
Finding” BBs) to find the shortest path for “Nouille”
to go to “Goal”.
Notes:
· Show the grids of the file to visualize the obstacles and the
linkers that allow "Nouille" to go from one grid to another.
· Each time Nouille walks on a button, it opens a door, and once
again, the system finds the shortest path to go to Goal.
Technical
Samples