The Reve’s Puzzle with a single cheat of the Divine rule

Authors

  • Abdullah Al Kafi Majumdar Yamanote-cho 17 – 2, Beppu-shi 874-0828, Japan

DOI:

https://doi.org/10.3329/jbas.v48i2.66072

Keywords:

The Tower of Hanoi problem, divine rule, Reve’s puzzle, dynamic programming equation

Abstract

A new variant of the Reve’s puzzle, which allows (at most) one violation (or, “cheat”) of the “divine rule”, has been introduced in an earlier paper. Letting S(n) be the minimum number of moves required to solve the new generalization with n discs, this paper finds an explicit expression of S(n), taking into account all the possible schemes. Some results related to the generalization to the general case of c cheats are derived.

J. Bangladesh Acad. Sci. 48(2); 251-264: December 2024

Downloads

Abstract
82
PDF
246

Downloads

Published

2024-12-31

How to Cite

Majumdar, A. A. K. (2024). The Reve’s Puzzle with a single cheat of the Divine rule. Journal of Bangladesh Academy of Sciences, 48(2), 251–264. https://doi.org/10.3329/jbas.v48i2.66072

Issue

Vol. 48 No. 2 (2024)

Section

Research Articles

License

Copyright (c) 2024 Journal of Bangladesh Academy of Sciences

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.