0
im not sure but it could be double it plus one?
if you find out can you please answer the question
thanks The answer is (2^n) - 1 where n is the number of disks
Wiki User
∙ 15y ago
Add your answer:
Earn +20 pts
Towers of hanoi?
Putting a question mark after the name of a game or puzzle does not make it a sensible question.
How long would it take to the hanoi puzzle with 6 7 8 discs?
For any n-disc version of the Tower of Hanoi, the optimum solution for the puzzle takes a minimum of 2n-1 moves. In the case of 6, 7, 8-sized Towers of Hanoi, the puzzle would take: 26-1 = 63, 27-1 = 127, 28-1 = 255 moves.
What time does Alton towers open?
It normally opens at about 10am to 7pm...
What is the formula of a triangular prism?
What is the formula for a triangular prism
Aryabhatta's quadratic formula's?
aryabhatt's quadratic formula
What is the nth term for the towers of hanoi?
2n-1
What are the instructions for the towers of hanoi on your maths for 5 discs?
010001010001011111100010100010101010111100110011100111000101001100 In binary
What is the name of the test with 4 rings shown in 'Rise of the Planet of the Apes'?
Towers of Hanoi.
Towers of hanoi?
Putting a question mark after the name of a game or puzzle does not make it a sensible question.
Formula for tower of hanoi?
times 2 plus 1
What is Towers of hanoi?
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.
How much is the average rental rate of a furnished two bedroom apartment at Sky City Towers Hanoi?
The rental price of high ranking apartments in Hanoi is going down this year. At this time, rate of furnished 2 bedroom apartment at Sky City Towers - 88 Lang Ha is about 1000 - 1200 USD per month
What is the formula for the tower of Hanoi?
2 with an exponent of n minus onen=number of disks
How long would it take to the hanoi puzzle with 6 7 8 discs?
For any n-disc version of the Tower of Hanoi, the optimum solution for the puzzle takes a minimum of 2n-1 moves. In the case of 6, 7, 8-sized Towers of Hanoi, the puzzle would take: 26-1 = 63, 27-1 = 127, 28-1 = 255 moves.
Grey humpreys tower of hanoi problem step by step explanation?
Can I please have the steps, sketch and formula for the tower of hanoi
What is the game where you move rings on to a different post without putting larger disks on to smaller disks?
That game with 5 or more rings and 3 posts is known as "the Towers of Hanoi".
Where is Ngoc Son Temple and Hoan Kiem Lake?
Hanoi Hanoi Hanoi
