Tower of Hanoi

Known as: Tower of Hanoi puzzle, Lucas' Tower, Tower of hanio 
The Tower of Hanoi (also called the Tower of Brahma or Lucas' Tower, and sometimes pluralized) is a mathematical game or puzzle. It consists of three… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
New updated! The latest book from a very famous author finally comes out. Book of the tower of hanoi myths and maths, as an… (More)
Is this relevant?
2010
2010
The classical Tower of Hanoi "puzzle" or "mathematical game", invented by the French mathematician Edouard Lucas in 1883, spans… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2008
2008
The Tower of Hanoi puzzle, invented by Édouard Lucas in 1883, is well known to students of discrete mathematics and computer… (More)
Is this relevant?
Review
2005
Review
2005
This is a substantially enlarged edition of the Tower of Hanoi bibliography first posted in 1997. In this edition, an attempt has… (More)
Is this relevant?
2004
2004
We consider a variant of the classical three-peg Tower of Hanoi problem, where limitations on the possible moves among the pegs… (More)
Is this relevant?
2000
2000
ing the Tower of Hanoi Craig A. Knoblock School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 cak@cs.cmu… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1992
1992
Two generalizations of the classical Tower of Hanoi problem p0, i.e., to transfer n discs from one peg to another by a series of… (More)
Is this relevant?
Highly Cited
1985
Highly Cited
1985
This paper analyzes the causes for large differences in difficulty of various isomorphic versions of the Tower of Hanoi problem… (More)
  • table 1
  • table 2
  • figure 3
  • table 3
  • table 4
Is this relevant?
1981
1981
The famous Towers of Hanoi puzzle consists of 3 pegs (A, B, C) on one of which (A) are stacked n rings of different sizes, each… (More)
Is this relevant?
1980
1980
In the Towers of Hanoi Problem there are three pegs A, B and C, and n (n 3 1) disks of different diameters. The disks are placed… (More)
Is this relevant?