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

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      

Abstract
163
PDF
664

Downloads

Published

2022-12-31

How to Cite

The Reve’s Puzzle with single relaxation of the Divine rule. (2022). 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

How to Cite

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