The Tower of Hanoi with Forbidden Moves

DOI10.1093/comjnl/47.1.20zbMath1090.90191OpenAlexW2073232267MaRDI QIDQ4828444

Amir Sapir

Publication date: 19 November 2004

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/2789212735bb17b695db507df50a7630a4fe9d15

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (11)

Loopless Gray code enumeration and the Tower of Bucharest ⋮ The diameter of Hanoi graphs ⋮ On a question of Leiss regarding the Hanoi Tower problem ⋮ The worst parallel Hanoi graphs ⋮ The worst Hanoi graphs ⋮ The tower of Hanoi problem on Path\(_h\) graphs ⋮ Exponential vs. Subexponential Tower of Hanoi Variants ⋮ The Cyclic Towers of Antwerpen problem -- a challenging Hanoi variant ⋮ Marcel Frémiot, determinism versus chaos, and the tower of Hanoi ⋮ On generalized Frame-Stewart numbers ⋮ Hanoi graphs and some classical numbers

This page was built for publication: The Tower of Hanoi with Forbidden Moves