These 3 bars have the same size but 4 disks have different size from the smallest to the biggest. In this study we use the most common version with 3 bars and 4 disks. It consists of three rods and a number of … The Tower of Hanoi test is one of the famous tests in the field of problem solving. This example displays the way of using method for solving Tower of Hanoi problem( for 3 disks).

How to use method for solving Tower of Hanoi problem?
It is also known as the Tower of Brahma or the Lucas Tower. This test has numerous versions. The Tower of Hanoi is one such mathematical game. The Tower of Hanoi (ToH) task was given to 238 children aged from 7 to 15 years, and 20 adults. The Tower of Hanoi is a problem often used brain stretching games, also for beginning programming, in particular as an example of a simple recursive algorithm. The objective of the puzzle is to move the stack to another peg following these simple rules. Problem Description. Towers of Hanoi. Try to move all the discs onto another pole. Move one disc at a time. Only one disk can be moved at a time. This puzzle is of unconfirmed origins, with many legends presenting different stories about where it came from. Individual variation within an age band was substantial. IQ Testing. We readministered the ToH to 45 children after 30 to 40 days. See how you do in this wonderful game of skill and logic. Solution. Tower of Hanoi interactive display at the Universum museum in Mexico City The Tower of Hanoi (also called the Tower of Brahma or Lucas' Tower and sometimes pluralized as Towers) is a mathematical game or puzzle. A bigger disc can't go on a smaller disc. ToH score did not correlate significantly with Verbal IQ, nor with ability to inhibit a prepotent response. No disk can be placed on top of the smaller disk. How, when, and where did it all begin. Tower of Hanoi consists of three pegs or towers with n disks placed one over the other. IQ Test Labs. Clicking anywhere on a stack of discs will select the smallest disc.