Summary: Solve the mathematical puzzle TOWER OF HANOI or TOWER OF BRAHMA with minimum possible moves...
Updated: May 26, 2012
Found in: manotech, tower, hanoi, brahma, puzzle, disk, move, free, touch, french, lucas, 1883, math
Requirements: Android OS 1.6 and higher
Downloads: 2
Doesnt matter how educated you are!!! Solve the mathematical puzzle TOWER OF HANOI or TOWER OF BRAHMA with minimum possible moves. This puzzle was published in 1883 by French mathematician Edouard Lucas. Now its your turn to solve this puzzle with least possible moves. What you have to do is just move all disks from leftmost tower to rightmost. You have to obey following rules to acomplish the task: * Only one disk may be moved at a time. * You cannot place a larger disk onto a smaller disk.Updated: May 26, 2012
Found in: manotech, tower, hanoi, brahma, puzzle, disk, move, free, touch, french, lucas, 1883, math
Requirements: Android OS 1.6 and higher
Downloads: 2
Barcode download
- Open your preferred Barcode scanner software
(Do not have barcode app? Get one here or more on the barcode page). - Point your phone camera at the QR code below and scan it.
- Follow the onscreen instructions to proceed with the installation.
Via: Tower of Hanoi
0 comments:
Post a Comment