The Reve’s Puzzle with Relaxation of The Divine Rule: The Reve’s Puzzle with Relaxation

Abdullah-Al-Kafi  Majumdar

Authors

Abdullah-Al-Kafi Majumdar Ritsumeikan Asia-Pacific University, 1–1 Jumonjibaru, Beppu 874-8577, Japan

Keywords:

Tower of Hanoi, Divine rule, Sinner’s tower, Reve’s puzzle

Abstract

This paper considers a variant of the Reve’s puzzle with n ( >1) discs which admits of r ( >1) number of violations of the “divine rule”. Denoting by S₄(n, r) the minimum number of moves required to solve the new variant, we give a scheme to find the optimality equation satisfied by S₄(n, r). We then find an explicit form of the optimal value function S₄(n, r).

References

Claus. N, La Tour d Hanoi, Jeu de Calcul. Sci. Nat,1(8): 127-128 (1883).

Dudeney, H.E. (1958) The Canterbury Puzzles. Dover, 4th Edition.

Majumdar, A.A.K. The Classical Tower of Hanoi Problem and Its Generalizations, Other Generalizations. Lambert Academic Publishing, U.S.A. (2) (2013).

Chen, X., B. Tian, & L. Wang, Santa Claus’ Towers of Hanoi, Graphs and Combinatorics, 23: 153-167 (2013).

Roth. T, The Tower of Brahma Revisited. J. Recreational Mathematics, 7(2): 116 -119 (1974).

Wood. D, The Towers of Brahma and Hanoi Revisited, Journal of Recreational Mathematics, 14: 17-24 (1981).

Hinz, A.M, An Iterative Algorithm for Tower of Hanoi Problem with Four Pegs. Computing, 42:133-140 (1881).

Chu. X. P, & R. Johnsonbaugh, The Four-Peg Tower of Hanoi Puzzle. SIGCSE Bulletin, 23(3): 2-4 (1991).

Majumdar, A.A.K, The Generalized Four-Peg Tower of Hanoi Problem. Optimization, 29:349-360(1994).

Majumdar, A.A.K, The Classical Tower of Hanoi Problem and Its Generalizations, Multi-Peg Generalizations. Lambert Academic Publishing, U.S.A (1) (2012).

The Reve’s Puzzle with Relaxation of The Divine Rule