Lay signals on a railway, run the timetable, then prove no train can ever get stuck.
Starting the panel
Signal panel.
00:00
ClearOn timeProved
Signals 0 / 0
Signal sites (keyboard)
How it's built
- A model checker in a Web Worker explores every order the trains could run in, with symmetry reduction and bit-packed states in a typed hash table, and returns a proof or the shortest jam.
- A track compiler turns the drawn schematic into track circuits, routes and a real interlocking control table.
- One interlocking rule set drives both the timed simulation and the checker, so every counterexample replays exactly on the panel.
- Wait-for-graph cycle detection names the trains in a jam and draws the cycle, explained in plain words.
- An SVG signal panel with route lights, track-circuit occupation and train-describer headcodes.
- Every level's reference solution is proved by the checker at build time.
The rules are a clean model of route-setting interlocking, not a railway standard: trains never reverse, blocks are released as the train leaves them, and "any delay" means any train may be late by any amount. Names and places are fictional.