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?
There are 17 entries in the shortest list, and then getting to 66 is one more, for 18 moves in the shortest path.
There are 25 entries in the longest list, and then getting to 66 is one more, for 26 moves in the longest path.
Edited on June 7, 2024, 7:46 am
Puzzle Thoughts
