Examples

Note: The examples below are all configured to run A* (with an admissible heuristic). To change the search algorithm used, you need to save the files and edit functions.js.

Grid maps

• Tiny grid map. Note: you need to click to set initial and goal states before you can run the search.
• Larger grid map (maze). This map already has set initial and goal states. You can change them by clicking "Changing Init and Goal" at the top of the page.
• Grid map with non-unit costs.

General graphs

• Model checking example.
• Sokoban problem, weak heuristic.
• Sokoban problem, stronger heuristic.

Download