A computer generated animated film on solving 25-disc Hanoi Tower Puzzle by moving stack of 25 discs from red to green rod. Solving at rate of 2 moves per second within 5-minute window, wisely and effectively time-lapsed from about 6 months.

For anyone who does not know what a Hanoi Tower Puzzle is, description follows. The Tower of Hanoi 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 in a neat stack in ascending 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 simple rules:
(1) Only one disk can be moved at a time.
(2) Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.
(3) No disk may be placed on top of a smaller disk.

Any compliments, suggestions or complaints, please leave comments and I will improve them into new films as time goes by.

Please subscribe for new films, usually uploaded at least weekly.