Author(s):
1. Abdullah-Al-Kafi Majumdar:
Ritsumeikan Asia-Pacific University,1-1 Jumonjibaru, Beppu-shi,Japan
Abstract:
The star puzzle is a variant of the classical Tower of Hanoi problem, where, in addition to the three pegs, S, P and D, there is a fourth one such that all disc movements are either to or from the fourth peg. Denoting by MS(n) the minimum number of moves required to solve the star puzzle, MS(n) satisfies the following recurrence relation: MS(n) = min 1 = k = n -1 This paper studies more closely the above recurrence relation and gives some new relationships, including some local-value relationships.
Page(s):
219-228
DOI:
DOI not available
Published:
Journal: Proceedings of the Pakistan Academy of Sciences: A. Physical and Computational Sciences, Volume: 54, Issue: 2, Year: 2017
Keywords:
recurrence relation
,
threeinarow puzzle
,
Star puzzle
,
localvalue relationships
References:
References are not available for this document.
Citations
Citations are not available for this document.