The Reve’s Puzzle with single relaxation 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.v46i2.60444

Keywords:

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

Abstract

This paper proposes a new version of the Reve’s puzzle, allowing at most one violation of the “divine rule”. Letting S(n) be the minimum number of moves required to solve the problem with n(³ 1) discs, an scheme is given to find the dynamic programming equation satisfied by S(n). A closed- form expression of S(n) is derived.

J. Bangladesh Acad. Sci. 46(2); 213-217 December 2022      

Downloads

Download data is not yet available.
Abstract
87
PDF
495

Downloads

Published

2022-12-31

How to Cite

Majumdar, A. A. K. . (2022). The Reve’s Puzzle with single relaxation of the Divine rule. Journal of Bangladesh Academy of Sciences, 46(2), 213–217. https://doi.org/10.3329/jbas.v46i2.60444

Issue

Vol. 46 No. 2 (2022)

Section

Short Communication