1 / 4

Maze Solving Algorithms

Raman Veerappan EPS 109 Final Project. Maze Solving Algorithms. Introduction. 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

odele
Download Presentation

Maze Solving Algorithms

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Raman Veerappan EPS 109 Final Project Maze Solving Algorithms

  2. Introduction • 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. Random Walks Algorithm Run my code with Random_Walk_Maze_Solver.m

  4. Wall Following Method Run my code with Wall_Following_Maze_Solver.m

More Related