Chapter 3: Problem Solving by Search

Howto

• HOWTO: Simple Trees used for Search-based AI in Python

Exercise

• Solve a maze using a goal-based planning Agent
• A simplified exercise using only BFS
• Mazes: Show all mazes for the assignment

Comparisons

• Mazes: Compare the search behavior of different algorithms.
• Mazes: Compare the detailed search behavior with animations.
• Mazes: Compare BFS with A-Star Search using the L Maze.
• Mazes: Compare Issues with DSF Cycle Checking for the Open Maze.

Heuristics

• Maze: The effect of different heuristics

License

© 2025-2026 Michael Hahsler. All code and documents in this repository are provided under Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0) License.