Hanojské věže - Laštovička

The towers of Hanoi is a program that solves the problem in general - with any number of towers. You may be familiar with the simple case with three towers, where the number of moves is equal to (2^n-1). For example, with 20 disks, 1048575 moves are needed. If you use four towers instead of three, then only 289 moves are needed. In addition, the program can solve an even more general problem: at the beginning, the disks are randomly placed and the task is to get them all to a single tower. Of course, a human can also play the game and then compare his result with the computer.