Chapter 3: Problem Solving by Search

HOWTO

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

Cycle-Checking for DFS

• Mazes: Issues with DFS Cycle Checking (Open Maze).

Algorithm Comparisons

• Mazes: Compare the searched state space for different algorithms (L Maze).
• Mazes: Compare the detailed search behavior of BFS, DFS, and A* search with animations (Medium Maze).
• Mazes: Compare BFS with A-Star Search with animations (L Maze).

  Heuristics

• Maze: The effect of different heuristics

Exercises

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

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.