The Cyclic Towers of Hanoi and Pseudo Ternary Codes

DOI10.1080/02522667.1986.10698860zbMath0605.68064OpenAlexW1993872010MaRDI QIDQ3742739

M. C. Er

Publication date: 1986

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

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

zbMATH Keywords

fastest algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Game theory (91A99) Other types of codes (94B60) Enumerative combinatorics (05A99) Discrete mathematics in relation to computer science (68R99)

Cites Work

• The Towers of Hanoi Problem
• The cyclic towers of Hanoi
• The towers of Hanoi revisited: Moving the rings by counting the moves
• Iteration strikes back - at the cyclic Towers of Hanoi
• An iterative algorithm for the cyclic Towers of Hanoi problem
• The Cyclic Towers of Hanoi: A Representation Approach
• The Towers of Hanoi and Binary Numerals
• 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 Cyclic Towers of Hanoi and Pseudo Ternary Codes