Results 141 to 150 of about 1,241 (174)

The Towers of Hanoi and Pileproblems

1997
Pileproblems are difficult discrete optimization problems. They deal with pratical tasks like loading and unloading trains, ships or trucks (Schulz [9]). Pileproblems can be described in terms of graph theory. This paper refers to the one by Schmiedel [8] and presents yet another variant of the Towers of Hanoi Problem.
Lutz Kämmerer, Lorenz Hempel
openaire   +1 more source

Towers of hanoi graphs

International Journal of Computer Mathematics, 1986
The notion of Hanoi Graph is introduced the first time for the Towers of Hanoi puzzle which greatly helps investigate the problem. And some new conclusions are presented in this paper.
openaire   +1 more source

Solving Towers of Hanoi and Related Puzzles

2013
Starting with the well-known Towers of Hanoi, we create a new sequence of puzzles which can essentially be solved in the same way. Since graphs and puzzles are intimately connected, we define a sequence of graphs, the iterated complete graphs, for our puzzles.
Paul Cull, Leanne Merrill, Tony Van, Celeste Burkhardt, Tommy Pitts   +4 more
openaire   +1 more source

A fast algorithm for the Towers of Hanoi problem

Comput. J., 1987
An O(n) time complexity algorithm for the `Towers of Hanoi' problem together with a proof of its correctness is given.
D. Gault, Maurice Clint
openaire   +2 more sources

The towers of Hanoi problem

Information Processing Letters, 1980
Peter Buneman, Leon S. Levy
openaire   +2 more sources

An Evolutionary Approach to Tower of Hanoi Problem

2015
The Tower of Hanoi problem is an ancient and interesting topic. In this paper, we presented an evolutionary algorithm approach for searching the solutions of the problem. We use a direct encoding and apply mutation only in the evolution. Experimental results are reported and show that the proposed method is capable of finding solutions for the problem ...
Jie Li, Rui Shen
openaire   +1 more source

The generalized towers of Hanoi

ACM SIGACT News, 1979
M. S. Krishnamoorthy, Somenath Biswas
openaire   +1 more source

Another nonrecursive algorithm for the towers of Hanoi

ACM SIGPLAN Notices, 1984
A nonrecursive algorithm for solving the Towers of Hanoi problem is described. The advantage of this algorithm is that it can be easily used by a human to play the game.
openaire   +1 more source

The Development and Preliminary Validation of the Tower of Hanoi-Revised

Assessment, 2001
Marilyn C Welsh, Mariette Huizinga
exaly  

Repeated Assessment of the Tower of Hanoi Test: Reliability and Age Effects

Assessment, 2000
Timo Ahonen, Tuija Aro, Asko Tolvanen
exaly