You are not logged in.
May 18, 2016, 10:05 a.m. Likes: 4
The Town Of Hanoi, also the Tower of Brahma or Lucas' Tower, has been considered as a classical strategy game to demonstrate to computer science students and the general public how algorithm work. It is explained as below: • There are 3 poles. • A certain number of bars are put into the first pole according to their width order, which means that the widest bar should be in the bottom of the pole. • The number of bars in the first pole can be chosen by players. • Players have to move all of the bars in the first pole on the left to the third pole in the right using the second bar in the middle, provided that: o Only one bar can be moved at one time. o The moved-in bar must NOT be wider than the top bar in the new pole. Here is the link to G... More
Credit: I would like to thank Karen Lang, David Wolber
and Josh Sheldon for their encouragement, feedback and support.
My special thank goes to Karen Lang for her time correcting the English grammar for the tutorial.
More Info: https://drive.google.com/folderview?id=0B8MPX-KrJRMuRFRDQVFFSXhmMDQ&usp=sharing
Load App Into MIT App Inventor
Other projects by same author
Report Project
Permanent link:
https://gallery.appinventor.mit.edu/?galleryid=6007560209694720