The Tower of Hanoi - IGGI

The Tower of Hanoi - IGGI

  • 2.3 MB

    File Size

  • Android 1.6+

    Android OS

About The Tower of Hanoi - IGGI

The classical game demonstrates the power of MIT App Inventor

This app is the final assessment of The MIT Master Trainers Program in Educational Mobile Computing, held March 24-26, 2016 at Boston, USA

ACKNOWLEDGMENTS

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:

https://drive.google.com/file/d/0B8MPX-KrJRMuMGFOSWhWbGtVdVU/view?usp=sharing

OVERVIEW

This tutorial is for advanced learners who want to explore the power of MIT App Inventor to create a complex and complicated Android game app, the Town Of Hanoi.

The Town Of Hanoi, also the Tower of Brahma or Lucas' Tower, is considered a classical strategy game to demonstrate how algorithms work for computer science students as well as the general public. It is explained below:

• There are 3 poles.

• Bars are put onto the first pole in their size order, which means that the widest bar should be on the bottom of the pole. Here is an example:

• The number of bars on the pole can be chosen by the players.

• Players have to move all of the bars from the first pole on the left to the third pole in the right using the second bar in the middle, with the following rules:

o Only one bar can be moved at one time.

o You cannot place a wider bar on top of a smaller bar.

Show More

What's new in the latest 1.2

Last updated on Jan 17, 2017
Minor bug fixes and improvements. Install or update to the newest version to check it out!
Show More

Videos and Screenshots

  • The Tower of Hanoi - IGGI poster
  • The Tower of Hanoi - IGGI screenshot 1
  • The Tower of Hanoi - IGGI screenshot 2

Old Versions of The Tower of Hanoi - IGGI

APKPure icon

Super Fast and Safe Downloading via APKPure App

One-click to install XAPK/APK files on Android!

Download APKPure
thank icon
We use cookies and other technologies on this website to enhance your user experience.
By clicking any link on this page you are giving your consent to our Privacy Policy and Cookies Policy.
Learn More about Policies