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?
(In reply to re: Best Minimum?
I think you missed the first D (on the first line) of Jim's path. The first two moves are both D's. The use of hyphens allowed the line break.
Posted by Charlie
on 2009-10-07 16:22:08