AbstractThe Hanoi graphs Hpn model the p-pegs n-discs Tower of Hanoi problem(s). It was previously known that Stirling numbers of the second kind and Stern's diatomic sequence appear naturally in the graphs Hpn. In this note, second-order Eulerian numbers and Lah numbers are added to this list. Considering a variant of the p-pegs n-discs problem, Catalan numbers are also encountered
AbstractIt is proved that seven different approaches to the multi-peg Tower of Hanoi problem are all...
AbstractAtkinson gave an algorithm for moving N disks from a peg to another one in the cyclic towers...
The Tower of Hanoi Puzzle is a fascinating mathematical puzzle invented by the French mathematician ...
AbstractThe Hanoi graphs Hpn model the p-pegs n-discs Tower of Hanoi problem(s). It was previously k...
AbstractIt is known that in the Tower of Hanoi graphs there are at most two different shortest paths...
AbstractHanoi graphs are the state graphs for Tower of Hanoi problems with three or more pegs. We pr...
AbstractThe Tower of Hanoi problem is generalized in such a way that the pegs are located at the ver...
The Tower of Hanoi puzzle with its disks and poles is familiar to students in mathematics and comput...
Combinatorial properties of the multi-peg Tower of Hanoi prob-lem on n discs and p pegs are studied....
More than a century after its proposal, the Towers of Hanoi puzzle with 4 pegs was solved by Thierry...
The objective of the well-known Towers of Hanoi puzzle is to move a set of disks one at a time from ...
AbstractFor the multi-peg Tower of Hanoi problem with k≥4 pegs, so far the best solution is obtained...
Abstract. For the Tower of Hanoi problem, it has been found that it is possible to construct a nice ...
Combinatorial properties of the multipeg Tower of Hanoi problem on n discs and p pegs are studied T...
In contrast to the widespread interest in the Frame-Stewart conjecture (FSC) about the optimal numbe...
AbstractIt is proved that seven different approaches to the multi-peg Tower of Hanoi problem are all...
AbstractAtkinson gave an algorithm for moving N disks from a peg to another one in the cyclic towers...
The Tower of Hanoi Puzzle is a fascinating mathematical puzzle invented by the French mathematician ...
AbstractThe Hanoi graphs Hpn model the p-pegs n-discs Tower of Hanoi problem(s). It was previously k...
AbstractIt is known that in the Tower of Hanoi graphs there are at most two different shortest paths...
AbstractHanoi graphs are the state graphs for Tower of Hanoi problems with three or more pegs. We pr...
AbstractThe Tower of Hanoi problem is generalized in such a way that the pegs are located at the ver...
The Tower of Hanoi puzzle with its disks and poles is familiar to students in mathematics and comput...
Combinatorial properties of the multi-peg Tower of Hanoi prob-lem on n discs and p pegs are studied....
More than a century after its proposal, the Towers of Hanoi puzzle with 4 pegs was solved by Thierry...
The objective of the well-known Towers of Hanoi puzzle is to move a set of disks one at a time from ...
AbstractFor the multi-peg Tower of Hanoi problem with k≥4 pegs, so far the best solution is obtained...
Abstract. For the Tower of Hanoi problem, it has been found that it is possible to construct a nice ...
Combinatorial properties of the multipeg Tower of Hanoi problem on n discs and p pegs are studied T...
In contrast to the widespread interest in the Frame-Stewart conjecture (FSC) about the optimal numbe...
AbstractIt is proved that seven different approaches to the multi-peg Tower of Hanoi problem are all...
AbstractAtkinson gave an algorithm for moving N disks from a peg to another one in the cyclic towers...
The Tower of Hanoi Puzzle is a fascinating mathematical puzzle invented by the French mathematician ...
DOI
Add to ORKG