TowersOfHanoi|教育線上App不用買

The problem:

Given three towers and any number of disks of different sizes, the problem is to move all the disks from one tower to another.

At the start, all disks are on a single tower and arranged by size so that the smallest is on top and the largest is on the bottom.

Move the disks from tower to tower, one at a time and according to the following rules, until all disks are on another tower and in the original order.

The rules:

. only one disk can be moved at a time;

. only a top disk can be moved; and

. a disk cannot be placed on a larger disk.

Educational:

The Towers of Hanoi is a classic computer science problem for illustrating the beauty of a recursive algorithm.

Towers of Hanoi with n discs requires 2^n - 1 moves.

This version covers 3, 4,and 5 disks.

A player selects 'from' and 'to' towers and the disk move is animated.

A computer animation for each possible disk selection: 3, 4 or 5, is also given.

免費玩TowersOfHanoi APP玩免費

免費玩TowersOfHanoi App

TowersOfHanoi APP LOGO

TowersOfHanoi APP QRCode