Gothic Lock Solver

Browser-only solver (BFS shortest path) for the Gothic Remake chest / lock puzzle. Each disk value is the pin position from left-to-right: left-most = 1, right-most = 7. Target is all = 4. Convention: L = +1, R = -1. Rule notation like 2+ means “disk 2 moves in the same direction”; 3- means it moves in the opposite direction. Note: More disks means a much bigger search space (BFS can get slow for large N).

Setup

Rules

One line per disk (1..N). Format: i: 2+, 3-, 5-. Empty means no couplings.

Notes / conventions
  • Each move chooses a disk and applies either L (+1) or R (-1).
  • The chosen disk always moves. Coupled disks move by sign * direction where sign is +1 or -1.
  • A move is invalid if any affected disk goes outside 1..7.
  • BFS explores states level-by-level, so the first solution found is minimal number of moves.

Output

No installs. Works on GitHub Pages.
Solution

          


          

            
Simulation

            
Applies the solution and prints each intermediate state.

            

          

        


        

          Advanced: performance knobs
          

            
State space grows exponentially with the number of disks: $$7^N$$. BFS is great for small to medium N, but can get slow for large puzzles.

            
If you ever need bigger N, consider bidirectional BFS (meet in the middle) or an informed search (A*), depending on puzzle constraints.