Inglenook shunting puzzles

MaRDI QIDQ1740366zbMATH OpenFDO

Authors Simon R. Blackburn

Publication date 30 April 2019

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1810.07970, https://www.combinatorics.org/ojs/index.php/eljc/article/view/v26i2p8

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Minimax problems in mathematical programming (90C47)

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.

Recommendations

• A Golay puzzle (Corresp.)
• scientific article; zbMATH DE number 1529463
• The locker puzzle

Cites work

• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• A graph theoretical approach to the shunting problem
• A survey of stack-sorting disciplines
• Multistage methods for freight train classification
• Patterns in permutations and words.
• Permutations generated by token passing in graphs
• Shunting for Dummies: An Introductory Algorithmic Survey
• The train marshalling problem

This page was built for publication: Inglenook shunting puzzles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1740366)