An optimal algorithm for Reve's puzzle

DOI10.1016/0020-0255(88)90007-2zbMATH Open0661.68062OpenAlexW2028798165MaRDI QIDQ1113675FDOQ1113675

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1087226
• scientific article; zbMATH DE number 1380741
• Publication:3201756
• Solution for the tower of Hanoi problem with four pegs
• The complexity of an optimal algorithm for the generalized tower of hanoi problem

zbMATH Keywords

Reve's puzzle

Mathematics Subject Classification ID

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

Cites Work

• The Generalized Colour Towers of Hanoi: An Iterative Algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Representation Approach to the Tower of Hanoi Problem
• A problem-decomposition method using differences or equivalence relations between states
• The multiway trees of hanoi^†
• Title not available (Why is that?)

Cited In (10)

• The Reve's puzzle with an evildoer disc
• Shortest paths between regular states of the Tower of Hanoi
• A skeleton model to enumerate standard puzzle sequences
• Solving the Rubik's Cube Optimally is NP-complete
• Solution for the tower of Hanoi problem with four pegs
• On a recurrence relation related to the Reve's puzzle
• Title not available (Why is that?)
• Title not available (Why is that?)
• Mathematical derivation of the multi-peg Tower of Hanoi algorithm
• Title not available (Why is that?)

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

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