The Towers of Hanoi rainbow problem: Coloring the rings
From MaRDI portal
Publication:3815309
DOI10.1016/0196-6774(89)90020-5zbMath0664.05008MaRDI QIDQ3815309
Publication date: 1989
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(89)90020-5
Related Items
The super towers of Hanoi problem: Large rings on small rings, The diameter of Hanoi graphs, On a question of Leiss regarding the Hanoi Tower problem, An optimal algorithm to implement the Hanoi towers with parallel moves, The towers of Antwerpen problem, The towers of Hanoi problem with parallel moves, The towers of Hanoi problem with cyclic parallel moves, Parallelism for multipeg towers of Hanoi