1 / 3
Tower of Hanoi — image 1
1 / 3

Tower of Hanoi

Order a print of this model

We calculate the final price from your selected file. You review and accept it before payment.

Saved on this device.

Tower of Hanoi is a mathematical puzzle, The minimum number of moves required to solve the puzzle is 2^n - 1, where n is the number of disks. So, for 7 disks, you need at least 2^7 - 1 = 127 moves!

Rating
0 / 5
Likes
16
Downloads
26
Makes
0
Views
539
Reviews
0

Updated at source:

Model information

License
Creative Commons — Attribution

Tower of Hanoi is a mathematical puzzle, The minimum number of moves required to solve the puzzle is 2^n - 1, where n is the number of disks. So, for 7 disks, you need at least 2^7 - 1 = 127 moves!

Tags