TL;DR
This paper analyzes the classic inglenook shunting puzzle, determining conditions for guaranteed solvability and addressing the problem of finding minimal move solutions in model railway wagon rearrangements.
Contribution
It provides a comprehensive analysis of when inglenook puzzles are always solvable and explores methods to find solutions with minimal moves.
Findings
Conditions for guaranteed solvability identified
Algorithms for minimal move solutions discussed
Insights into puzzle complexity provided
Abstract
An inglenook puzzle is a classic shunting (switching) puzzle often found on model railway layouts. A collection of wagons sits in a fan of sidings with a limited length headshunt (lead track). The aim of the puzzle is to rearrange the wagons into a desired order (often a randomly chosen order). This article answers the question: When can you be sure this can always be done? The problem of finding a solution in a minimum number of moves is also addressed.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.