Comments on: Adachi micromouse maze solving algorithms http://www.micromouseonline.com/blog/2008/05/27/adachi-micromouse-maze-solving-algorithms/ A micromouse builders blog Tue, 06 Jan 2009 07:03:30 +0000 http://wordpress.org/?v=2.3.3 By: peteh http://www.micromouseonline.com/blog/2008/05/27/adachi-micromouse-maze-solving-algorithms/#comment-190 peteh Wed, 16 Jul 2008 20:04:44 +0000 http://www.micromouseonline.com/blog/2008/05/27/adachi-micromouse-maze-solving-algorithms/#comment-190 Have a look at one of today's posts. There is a link to a complete micromouse description. Also the posts about Primus describe most of what you might need. Except solving the maze. Have a look at one of today’s posts. There is a link to a complete micromouse description. Also the posts about Primus describe most of what you might need. Except solving the maze.

]]> By: Gopal http://www.micromouseonline.com/blog/2008/05/27/adachi-micromouse-maze-solving-algorithms/#comment-189 Gopal Wed, 16 Jul 2008 11:19:27 +0000 http://www.micromouseonline.com/blog/2008/05/27/adachi-micromouse-maze-solving-algorithms/#comment-189 i would like to know the code for the micromouse i am programming using a microcontroller AT Mega 16. Tnank You. i would like to know the code for the micromouse i am programming using a microcontroller AT Mega 16.
Tnank You.

]]> By: peteh http://www.micromouseonline.com/blog/2008/05/27/adachi-micromouse-maze-solving-algorithms/#comment-105 peteh Tue, 27 May 2008 16:27:18 +0000 http://www.micromouseonline.com/blog/2008/05/27/adachi-micromouse-maze-solving-algorithms/#comment-105 That sounds like method 2 used for two passes, then method 1. Pete That sounds like method 2 used for two passes, then method 1.

Pete

]]> By: Derek Hall http://www.micromouseonline.com/blog/2008/05/27/adachi-micromouse-maze-solving-algorithms/#comment-104 Derek Hall Tue, 27 May 2008 13:23:41 +0000 http://www.micromouseonline.com/blog/2008/05/27/adachi-micromouse-maze-solving-algorithms/#comment-104 I think Mouse X uses method 3 with a bit of method 2 thrown in for good luck. 1. Search to the target 2. Search back to the start until you can get to the start without passing unmapped squares 3. Search back to the centre until you can get to the centre without passing unmapped squares 4. Check route from start to centre and set target to any un-mapped square in this route 5. Maze is solved when there are no unmapped squares between the mouse and the centre, the mouse and the start and the start and the centre Derek I think Mouse X uses method 3 with a bit of method 2 thrown in for good luck.
1. Search to the target
2. Search back to the start until you can get to the start without passing unmapped squares
3. Search back to the centre until you can get to the centre without passing unmapped squares
4. Check route from start to centre and set target to any un-mapped square in this route
5. Maze is solved when there are no unmapped squares between the mouse and the centre, the mouse and the start and the start and the centre
Derek

]]>