solving 15-disc Tower Of Hanoi puzzle in time-lapse

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

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.

[adreskrk]

En teoría para 15 niv los movimientos mínimos que se deben de hacer son 32767 y él hizo 32768, por un movimiento y le quedaba perfecto, pueden comprobar cuántos movimientos son los mínimos con esta ecuación [(2^n) - 1] donde n es el número de discos a resolver.
Edit: No mal interpreten el cometerio lo que el hizo es impresionante que dedicación