Enumerating moves in the optimal solution of the Tower of Hanoi

by   Hacène Belbachir, et al.

In the Tower of Hanoi problem, there is six types of moves between the three pegs. The main purpose of the present paper is to find out the number of each of these six elementary moves in the optimal sequence of moves. We present a recursive function based on indicator functions, which counts the number of each elementary move, we investigate some of its properties including combinatorial identities, recursive formulas and generating functions. Also we found and interesting sequence that is strongly related to counting each type of these elementary moves that we'll establish some if its properties as well.


page 1

page 2

page 3

page 4


The weighted Tower of Hanoi

The weighted Tower of Hanoi is a new generalization of the classical Tow...

Parameterized complexity of untangling knots

Deciding whether a diagram of a knot can be untangled with a given numbe...

Constructing Clustering Transformations

Clustering is one of the fundamental tasks in data analytics and machine...

Bouncing Towers move faster than Hanoi Towers, but still require exponential time

The problem of the Hanoi Tower is a classic exercise in recursive progra...

Exploring the tiers of rooted phylogenetic network space using tail moves

Popular methods for exploring the space of rooted phylogenetic trees use...

Fairer Chess: A Reversal of Two Opening Moves in Chess Creates Balance Between White and Black

Unlike tic-tac-toe or checkers, in which optimal play leads to a draw, i...

Chess2vec: Learning Vector Representations for Chess

We conduct the first study of its kind to generate and evaluate vector r...

Please sign up or login with your details

Forgot password? Click here to reset