The Towers of Hanoi and Binary Numerals

DOI10.1080/02522667.1985.10698816zbMath0578.68054OpenAlexW2312798822MaRDI QIDQ3700851

M. C. Er

Publication date: 1985

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1985.10698816

zbMATH Keywords

iterative algorithmbinary representationiterative programming

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Discrete mathematics in relation to computer science (68R99)

Related Items (3)

The Cyclic Towers of Hanoi and Pseudo Ternary Codes ⋮ Tours de Hanoï et automates ⋮ Avoiding squares and overlaps over the natural numbers

Cites Work

• The Towers of Hanoi Problem
• The towers of Hanoi revisited: Moving the rings by counting the moves
• A Representation Approach to the Tower of Hanoi Problem
• Discussion and correspondence: A note on the Towers of Hanoi problem

This page was built for publication: The Towers of Hanoi and Binary Numerals