Puzzling Asked on December 21, 2020
This is not my puzzle, but I really wanted to share it. You can solve it interactively here.
In this maze you jump horizontally or vertically to a new square (not necessarily adjacent) with the constraint that the symbol you land on must be different from either of the two previous symbols. Starting from the diamond at top left, can you find the shortest route to the diamond at bottom right? Good luck!
Transcription (D = diamond, C = club, S = spade, H = heart)
D D C D D
C S C S D
D S C H D
H S H H H
D S D D D
I can solve it in
The path is:
I'm pretty sure this is optimal and unique (no other path with the same move count exists), because
Correct answer by Bubbler on December 21, 2020
1 Asked on September 4, 2021 by jeremy-dover
2 Asked on September 4, 2021 by fivesideddice
4 Asked on September 3, 2021 by jasand-pruski
4 Asked on September 2, 2021 by ed-marty
0 Asked on September 1, 2021
Get help from others!