New variants of the bottleneck tower of Hanoi problems

Authors

  • Abdullah Al Kafi Majumdar Beppu-shi Oaza Tsurumi, Renace Beppu, Beppu-shi, Japan

DOI:

https://doi.org/10.3329/jbas.v44i2.51463

Keywords:

Bottleneck Tower of Hanoi, Divine rule, Bottleneck Reve’s puzzle

Abstract

This paper considers two variants of the bottleneck Tower of Hanoi problems with n (≥1) discs and the bottleneck size b (≥2), which allows violation of the “divine rule” (at most) once. Denoting by MB3(n, b) the minimum number of moves required to solve the new variant of the bottleneck Tower of Hanoi problem, an explicit form of MB3(n, b) is found. Also, MB4(n, b) denotes the minimum number of moves required to solve the new variant of the bottleneck Reve’s puzzle, a closed-form expression of MB4(n, b) is derived.

Journal of Bangladesh Academy of Sciences, Vol. 44, No. 2, 197-200, 2020

Downloads

Download data is not yet available.
Abstract
2
PDF
2

Downloads

Published

2021-01-19

How to Cite

Majumdar, A. A. K. (2021). New variants of the bottleneck tower of Hanoi problems. Journal of Bangladesh Academy of Sciences, 44(2), 197–200. https://doi.org/10.3329/jbas.v44i2.51463

Issue

Vol. 44 No. 2 (2020)

Section

Short Communication