An optimal algorithm for Reve's puzzle

DOI10.1016/0020-0255(88)90007-2zbMath0661.68062OpenAlexW2028798165MaRDI QIDQ1113675

M. C. Er

Publication date: 1988

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(88)90007-2

zbMATH Keywords

Reve's puzzle

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Enumerative combinatorics (05A99) Discrete mathematics in relation to computer science (68R99)

Related Items (3)

Mathematical derivation of the multi-peg Tower of Hanoi algorithm ⋮ Shortest paths between regular states of the Tower of Hanoi ⋮ Unnamed Item

Cites Work

• A problem-decomposition method using differences or equivalence relations between states
• The Generalized Colour Towers of Hanoi: An Iterative Algorithm
• The multiway trees of hanoi^†
• A Representation Approach to the Tower of Hanoi Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An optimal algorithm for Reve's puzzle