The Tower of Hanoi or Towers of Hanoi (also known as The Towers of Brahma) 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. The puzzle starts with the disks neatly stacked in order of size on one rod, the smallest at the top, thus making a conical shape.

The objective of the puzzle is to move the entire stack to another rod, obeying the following rules:

  • Only one disk may be moved at a time.
  • Each move consists of taking the upper disk from one of the rods and sliding it onto another rod, on top of the other disks that may already be present on that rod.
  • No disk may be placed on top of a smaller disk.

From Wikipedia under the GNU Free Documentation License
Mon Aug 24 00:15:35 2009

Vietnam Hanoi HoanKiemLake TortoiseTower jpg
arikah.net
Vietnam Hanoi HoanKiemLake TortoiseTower jpg
116px x 161px | 3.10kB

[source page]

with some of the older folk still speaking the language and the French influence is also reflected in the availability as elsewhere in Vietnam of good food wine coffee and baguettes Hanoi s Old Quarter is located on the north eastern shore of Hoan Kiem Lake which means Lake of the Restored Sword and originates in a legend which tells of the sword being given to the

hanoi flag tower big jpg
vietnamtour.org
hanoi flag tower big jpg
458px x 298px | 74.80kB

[source page]

A photo of the tower

Tower of Hanoi clip image010 jpg
people.revoledu.com
Tower of Hanoi clip image010 jpg
283px x 576px | 23.80kB

[source page]

To solve this problem we transform the state diagram into R matrix as shown in the picture below I used MS Excel without any programming you can download it here Then transform the R matrix into Q matrix and normalized it

From Yahoo Image Search: "Tower of Hanoi"
Mon Aug 31 21:50:23 2009

Tricon Towers A New Face for Hanoi | Vietnam Investment news ...
vietnaminvestment.net
Tricon Towers A New Face for Hanoi | Vietnam Investment news ...

hoang

Sat, 12 Sep 2009 01:33:03 GM

With 20 years of experience in real estate investment and sales in Asia and the US, the Minh Viet Investment Joint Stock Company (MVIC) is going to build the.

 Tower of Hanoi Schmoffly's Weblog
schmoffly.wordpress.com
Tower of Hanoi Schmoffly's Weblog

schmoffly

ue, 03 Mar 2009 16:15:21 GM

There is a game played using what is called a . Tower of Hanoi. . It is made using three small . towers. that are in a line and a number of round disks that fit over the . towers. . In order to win, all the disks must be moved from the first . tower. ...

Video games on attention, memory and executive control (Boot et al ...
vgresearcher.wordpress.com
Video games on attention, memory and executive control (Boot et al ...

Wai Yen Tang

hu, 18 Dec 2008 04:47:51 GM

Tower. of London: It looked more like the . tower of Hanoi. game. Differences are participants not limited by time, must complete within a number of moves and has three chances to complete it. There are nine games of increasing difficulty. ...

From Google Blog Search: "Tower of Hanoi"
Sat Oct 3 02:13:50 2009

BUSINESS IN BRIEF 30/9 - VietNamNet Bridge
news.google.com
business in brief 30/9

VietNamNet Bridge

... Viet Investment Joint Stock Company to provide loans to customers buying Tricon Towers apartments in the An Khanh residential area in northern Hanoi . ...



and more »
DS REVIEW: Professor Layton and the Diabolical Box - Nintendophiles
news.google.com
ds review: Professor Layton and the Diabolical Box

Nintendophiles

... author of pen-and-paper brainteasers, range in subject from math trickery to sliding block puzzles to more famous puzzles such as the " Towers of Hanoi ". ...



and more »
BUSINESS IN BRIEF 10/9 - VietNamNet Bridge
news.google.com
business in brief 10/9

VietNamNet Bridge

The two towers are part of the Republic of Korea-invested complex project Kumho Asiana Plaza , which is located on the downtown land lot bordering Le Duan, ...

From Google News Search: "Tower of Hanoi"
Thu Oct 1 12:07:29 2009

what is the formula used to determine the number of moves needed to complete the tower of hanoi?
Q. do this without being able to skip a peg
Asked by John M - Tue Jun 6 18:40:45 2006 - - 2 Answers - 0 Comments

A. (2^n)-1 where n is the number of disks on the original peg.
Answered by Arbitrage - Tue Jun 6 18:43:15 2006

Can somebody describe the recursive solution of the Tower of Hanoi?
Q. Can somebody describe the recursive solution of the Tower of Hanoi?
Asked by PIMA - Sun Nov 19 02:15:24 2006 - - 4 Answers - 0 Comments

A. Tower of honoi To some its a never ending game, to others its a good way to test the speed of their CPU, but, to us it is a great example of recursion. In the original Tower of Honoi, you have 64 disks in position A stacked on top of each other. The largest disk at the bottom and smallest at the top and disks sorted from large to small. The task at hand is to move all 64 disks from position A to position B using position C, without ever putting a larger disk on top of a smaller one and only moving 1 disk at a time. How long do you think that would take you to complete? Chinese priest thought that the completion of this task will bring the end of the world, it was considered an unendable task. But, that was before the age high speed… [cont.]
Answered by mein Hoon na - Sun Nov 19 04:57:15 2006

can anyone solve a computer program(cpp language) ::::its the tower of hanoi.?
Q. u can solve this only if u know the concept of tower of hanoi program.
Asked by lively - Tue Feb 6 08:19:28 2007 - - 3 Answers - 0 Comments

A. well here is the code in "C"...I use GCC compiler...so better u run this on that...I am not sure abt tht other compilers... *** #include void transfer(int n,char from[],char to[],char temp[]); main() { int n; char L[]="Left"; char C[]="Center"; char R[]="Right"; printf("Welcome to towers of hanoi\n\n"); printf("How many discs? "); scanf("%d",&n); printf("\n"); transfer(n,L,R,C); } void transfer(int n,char from[],char to[],char temp[]) { if(n>0) { transfer(n-1,from,temp,to ); printf("Move disc %d from %s to %s\n",n,from,to); transfer(n-1,temp,to,from ); } return; } ***
Answered by sg_iit_8&3 - Tue Feb 6 09:14:01 2007

From Yahoo Answer Search: "Tower of Hanoi"
Sat Oct 3 02:06:43 2009

Custom search only Tower of Hanoi sites:

Help build the largest human-edited directory on the web.
Submit a Site - Open Directory Project - Become an Editor
Sat Jul 25 08:45:48 2009