On the Star Puzzle

Authors

  • AAK Majumdar Ritsumeikan Asia-Pacific University, Beppu 874-8577, Japan

DOI:

https://doi.org/10.3329/ganit.v39i0.44158

Keywords:

Star puzzle, Three-in-a-row puzzle, Recurrence relation

Abstract

In the star puzzle, there are four pegs, the usual three pegs, S, P and D, and a fourth one at 0. Starting with a tower of n discs on the peg P, the objective is to transfer it to the peg D, in minimum number of moves, under the conditions of the classical Tower of Hanoi problem and the additional condition that all disc movements are either to or from the fourth peg. Denoting by MS(n) the minimum number of moves required to solve this variant, MS(n) satisfies the recurrence relation . This paper studies rigorously and extensively the above recurrence relation, and gives a solution of it.

GANIT J. Bangladesh Math. Soc.Vol. 39 (2019) 1-14

Downloads

Download data is not yet available.
Abstract
615
PDF
437

Downloads

Published

2019-11-19

How to Cite

Majumdar, A. (2019). On the Star Puzzle. GANIT: Journal of Bangladesh Mathematical Society, 39, 1–14. https://doi.org/10.3329/ganit.v39i0.44158

Issue

Section

Articles