Towers of Hanoi

Towers of Hanoi

C007/6209 Rights Managed

Request low-res file

530 pixels on longest edge, unwatermarked

Request/Download high-res file

Uncompressed file size: 50.6MB

Downloadable file size: 391.5KB

Price image Pricing

Please login to use the price calculator


Caption: Towers of Hanoi. Sequence showing the minimum number of moves needed to complete the Towers of Hanoi game for four discs. This mathematical game was devised in 1883 by the French mathematician Edouard Lucas (1842-1891). There are 'n' number of rings on the first of three poles, and the task is to move the rings to the third pole (at right), but only by moving one ring at a time and ensuring that the rings remain stacked with the larger ones under the smaller ones. For three pegs, the optimal solution is one less than 2 raised to the power of n. For four rings this optimal solution is 15 moves, as shown here.

Release details: Model release not required. Property release not required.

Keywords: 15, 1800s, 1883, 19th century, algorithm, algorithmic, artwork, best, computing, edouard lucas, fifteen, game, game theory, illustration, mathematical, mathematics, maths problems, minimal, minimum, optimal, pegs, problem, puzzle, rings, sequence, sequences, series, solution, tower of hanoi, towers of hanoi

Licence fees: A licence fee will be charged for any media (low or high resolution) used in your project.