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

 Mensa Maze (Posted on 2009-10-07)
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 (3 votes)

 Subject Author Date Useful Post Jacob Steven 2021-12-29 08:13:14 Essay writing course links Jacob Steven 2021-12-29 08:09:04 re: education doraamma 2021-04-11 16:18:58 No Subject Casey Bullock 2020-12-17 02:31:12 Getting ready to defend a thesis John Kavita 2020-12-05 04:56:42 re: education Winston69 2020-09-19 05:02:45 re: education Winston69 2020-09-19 05:02:21 vape Ross York 2020-09-07 23:11:14 No Subject Ross York 2020-09-07 23:10:05 No Subject Ross York 2020-09-07 23:07:03 vape Colton Hendricks 2020-08-15 05:39:22 education September Dillon 2020-05-28 05:54:52 amended ed bottemiller 2009-10-07 20:28:07 GraphTraverser ed bottemiller 2009-10-07 19:56:48 re(2): Best Minimum? Charlie 2009-10-07 16:22:08 re(2): Best Minimum? Jim Keneipp 2009-10-07 16:18:28 re: Best Minimum? Daniel 2009-10-07 15:43:13 re: Best Minimum? Daniel 2009-10-07 14:28:35 Best Minimum? Jim Keneipp 2009-10-07 12:56:10 a start Daniel 2009-10-07 12:02:35

 Search: Search body:
Forums (0)