The Little Towers of Antwerpen problem
From MaRDI portal
Publication:1041749
DOI10.1016/J.IPL.2005.02.007zbMath1177.05013OpenAlexW2045962362MaRDI QIDQ1041749
Publication date: 4 December 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2005.02.007
Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorics in computer science (68R05) Recurrences (11B37)
Related Items (2)
The tower of Hanoi problem on Path\(_h\) graphs ⋮ The Cyclic Towers of Antwerpen problem -- a challenging Hanoi variant
Cites Work
This page was built for publication: The Little Towers of Antwerpen problem