1. Raman Veerappan EPS 109 Final Project

2.  Goals  To examine various maze solving algorithms using MATLAB determine which algorithms are most effective for which mazes  Two main algorithms examined  Random Walk (Random Mouse) Algorithm ▪ Pros: easy to code and understand, always works ▪ Cons: not consistent, can take a really long time  Wall Follower (Right-Hand Rule and Left-Hand Rule) ▪ Pros: still fairly easy to code, faster than random walks, always works for a simply connected maze ▪ Cons: only works for a simply connected maze  Also, Trémaux's algorithm  Pros: faster than random walks, guaranteed to work for all mazes that have well-defined passageways  Cons: hard to code (I wasn’t able to)

3. Run my code with Random_Walk_Maze_Solver.m

4. Run my code with Wall_Following_Maze_Solver.m