The Reve’s Puzzle Revisited
Reve’s Puzzle Revisited
DOI:
https://doi.org/10.53560/PPASA(58-2)585Keywords:
Classical Tower of Hanoi, Reve’s Puzzle, Dynamic Programming, Recurrence RelationAbstract
The Reve’s puzzle, introduced by the English puzzlist, H.E. Dudeney, is a mathematical puzzle with 10 discs of different sizes and four pegs, designated as S, P1, P2 and D. Initially, the n ( 1) discs rest on the source peg, S, in a tower (with the largest disc at the bottom and the smallest disc at the top). The objective is to move the tower from the peg S to the destination peg D, in a minimum number of moves, under the condition that each move can transfer only one disc from one peg to another such that no disc can ever be placed on top of a smaller one. This paper considers the solution of the dynamic programming equation corresponding to the Reve’s puzzle.
References
N. Claus., L.T. d’ Hanoi. Veritable Casse-tete Annamite, P. Bousrez. (1883).
H.E. Dudeney. The Canterburry Puzzles. Thomas Nelson and Son, London, 4th Edition by Dover (1958).
A.M. Hinz., S. Klavzar, and C. Petr. The Tower of Hanoi – Maths and Myths, Springer, 2nd Edition (2018).
T. Roth. The Tower of Brahma Revisited, Journal of Recreational Mathematics, 7(2): 116-119 (1974).
T. Bousch. La Quartrieme Tour de Hanoi, Bulletin of the Belgian Mathematical Society Simon Stevin 21:895-912 (2014).
A.A.K. Majumdar. Frame’s Conjecture and the Tower of Hanoi Problem with Four Pegs. Indian Journal of Mathematics, 36(3): 215-217 (1994).
.A.K. Majumdar. The Generalized Four -Peg Tower of Hanoi Problem. Optimization, 29: 349- 360 (1994).
A.A.K. Majumdar. The Classical Tower of Hanoi Problem and Its Generalizations Vol 1: Multi-Peg Generalization. Lambert Publishing, Germany (2012).
