This is a variant on The Tiled Labyrinth.
The rules are the same, except that the goal has changed.
You will probably want to use this script which was created for the initial puzzle but applies equally well to this version.
Summarizing the rules for those too lazy to read the original problem:
- You have a board consisting of a set of 5x5 dice, each of which has paths on the different sides.
- The starting position is
- You may rotate all the dice in a given column up or down
- You may rotate all the dice in a given row left or right
- You may not rotate the dice in the row or column corresponding to your current location
- After any rotation you may move to any other location that is connected to your current location.
The new goal: Create a single path that connects all four corners of the board. A sample solution might look like this:
A few notes:
- Any solution that creates a path between all four corners will be accepted, It does not have to be the same as my sample solution above.
- I will be looking for the solution that involves the fewest rotations (I will not count the number of moves)
- Here is a 28-rotation sequence that results in the end position above, but your goal is to do better. It also includes a hint about how I generated the sequence
(B+), (C+), (D+), (D+), (2-), (D+), (2+), (D-), (5-), (C+), (5+), (C-), (5+), (D-), (5-), (D+), (B+), (5+), (B-), (5-), (B-), (5+), (B+), (5-), (5+), (E+), (5-), (E-), [A1 -> E5]
The idea behind the subsequence "(5+), (E+), (5-), (E-)" is to rotate the die at E5 without changing the rest of the board