Study guides

Q: How can you solve the tower of hanoi?

Write your answer...

Submit

Related questions

by implementing ones of the algorithms that solve the tower of hanoi game, using the C language.

There are a couple patterns that solve the puzzle. I am not sure of those patterns though.

The number of moves required to solve the Hanoi tower is 2m + 1 . Therefore for a tower of five disks the minimum number of moves required is: 31.

It is the "Tower of Hanoi" and it is a puzzle. When you can solve the puzzle you can write the program, when you have learned enough to write simple programs. You do want to be able to write computer programs, don't you?

The tower of hanoi was invented in 1883.........

Flag Tower of Hanoi was created in 1812.

Keangnam Hanoi Landmark Tower is a building found at Hanoi in Vietnam.

Can I please have the steps, sketch and formula for the tower of hanoi

The floor area of Keangnam Hanoi Landmark Tower is 609,673 m2.

The puzzle is called the "Lukas Tower" in the movie. It can be found by the name "Lukas's Tower of Hanoi" or nonpossessively "Tower of Hanoi".

According to the legend, when the last move of the Tower of Hanoi puzzle is completed, the world will end.

you dont

a

times 2 plus 1

Edouard (sorry about the spelling Eddy) Lucas

100000000

18,948,387,374,746,172,084

127

y=2(to the x)-1

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 rods, and a number of disks of different sizes which can slide onto any rod.

A tower of hanoi with 10 discs could be solved in 1023 moves See the related link for a step by step 7 disc solution with 127 moves

Tower of Hanoi puzzle game - mathematical problem

1,048,575 moves and I know because I did the math.

It is not trivial, but possible. Please consult wikipedia (attached link).

2^64-1 = 18446744073709551615