A probabilistic analysis of an error-correcting algorithm for the Towers of Hanoi puzzle

DOI10.1016/0020-0190(84)90031-0MaRDI QIDQ791323zbMATH OpenOpenAlexFDO

Authors F. Scarioni, H. G. Speranza

Publication date 1984

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(84)90031-0

zbMATH Keywords

algorithm analysiserror correctionTowers of Hanoi

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Cites work

• A family of rules for recursion removal
• Discussion and correspondence: A note on the Towers of Hanoi problem
• Efficient generation of the binary reflected gray code and its applications
• scientific article; zbMATH DE number 3763944 (Why is no real title available?)
• scientific article; zbMATH DE number 3045770 (Why is no real title available?)
• Iteration strikes back - at the cyclic Towers of Hanoi
• The cyclic towers of Hanoi
• The Towers of Hanoi Problem
• The towers of Hanoi revisited: Moving the rings by counting the moves

Cited in

(3)

• The average distance on the Sierpiński gasket
• The generalized Towers of Hanoi for space-deficient computers and forgetful humans
• A statistical analysis of the towers of hanoi problem

This page was built for publication: A probabilistic analysis of an error-correcting algorithm for the Towers of Hanoi puzzle

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