Welcome to The Minotaur’s Mini-Tour!

Looking at methods to solve mazes … without all the bull.

Prerequisites

• Installation (Optional)
  • Clone Down the Repository

C'mon in!

• Defining Our Terms
  • Maze
  • Room
  • Path
• Lil’ Labyrinth: Methods of Maze Representation
  • Network Diagram
  • Adjacency Matrix
  • Adjacency List
  • Choosing a Method

Get lost for a while...

• From an ASCII Maze to an Adjacency List
  • Step 1: Use an intermediate form: Maze as Nested List
  • Step 2: Convert Maze as Nested List to an Adjacency List
• A Review of Breadth-first Search
• Looking at an Implementation of BFS against an Adjacency List
• Side-by-Side comparison of Pseudocode to bfs()

Find your way out again.

• Anatomy of a Room
• Path-finding
  • Room.prev
  • shortest_path()
• The Maze class
  • Visualization
  • Searching and Pathfinding
  • An Aside: printing a linked list with recursive __repr__
• Resources