If you want to cheat your way through a lock (and let's be real - lockpicking mods are popular for a reason) then there's a solution.
Since this is a logic problem you can use the power of maths to solve it. If you're as bad at maths as we are though, you might need a little (A)ssisted (I)nvolvement.
Tell your mathematically gifted friend this. Anything in the bullet point below written in ((brackets like this)) is for your reference, delete it when asking your friend:
"Puzzle State
There are 5 plates, P1–P5.
- ((Replace 5 with the number of plates))
Each plate has 7 positions numbered 1–7.
A state is represented as:
(P1,P2,P3,P4,P5) ((Add P6 etc if there are more plates))
Initial state:
(X,X,X,X,X)
- ((Replace X with the starting positions of the pins in each plate. For example, if the first plate has a pin in the third hole, replace the first X with the number 3. Continue for all plates))
Goal state:
(4,4,4,4,4,4)
Legal moves:
A move consists of selecting one plate and moving its pin one position left or right.
A move is legal only if:
- No pin moves below position 1.
- No pin moves above position 7.
- All secondary movements caused by the move must also remain within positions 1–7.
Right-move effects:
- ((these numbers below indicate how the other plates move when an individual plate is moved. If another plate moves the same direction, it's marked at +1. If it doesn't move, it's marked as 0. If it moves in the opposite direction, it's marked as -1. ))
- ((The first X represents the first plate, the second X the second plate, and so on))
- ((For example: if moving the first plate to the right also moves the third plate to the right, the fourth plate to the left, but doesn't move the other plates, you would write 0, 0, +1, -1, 0))
- ((Repeat this for all plates. The only way to learn which plate moves what is trial an error in game. It's recommended to quicksave, learn the positions, and reload to later solve it))
P1+ : (X, X, X, X, X)
P2+ : (X, X, X, X, X)
P3+ : (X, X, X, X, X)
P4+ : (X, X, X, X, X)
P5+ : (X, X, X, X, X)
Left moves are the inverse of the corresponding right moves.
Task:
Find a legal sequence of moves that transforms the initial state into the goal state. Show the sequence of moves and the final verification.