All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > General
Mensa Maze (Posted on 2009-10-07) Difficulty: 3 of 5
You can navigate the grid below from the top-left yellow circle to the bottom-right yellow square by making only orthogonal (not diagonal) moves, going from one position to the next only if the shape and/or the color of the shape in the entered cell is the same as that of the cell you are leaving.

  • What path has the minimum number of moves without going through the same cell twice?
  • What path has the maximum number of moves without going through the same cell twice?

See The Solution Submitted by Charlie    
Rating: 3.0000 (1 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
amendeded bottemiller2009-10-07 20:28:07
GraphTraversered bottemiller2009-10-07 19:56:48
re(2): Best Minimum?Charlie2009-10-07 16:22:08
re(2): Best Minimum?Jim Keneipp2009-10-07 16:18:28
re: Best Minimum?Daniel2009-10-07 15:43:13
re: Best Minimum?Daniel2009-10-07 14:28:35
Best Minimum?Jim Keneipp2009-10-07 12:56:10
a startDaniel2009-10-07 12:02:35
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (1)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2019 by Animus Pactum Consulting. All rights reserved. Privacy Information