The Tower of Hanoi is a well-known puzzle where disks of different sizes are moved back and forth between three rods ($A, B$, and $C$). At the beginning, all disks are in position $A$. The aim is to bring all the disks into position $B$, whereby the rod $C$ can also be used in between.
The essential condition is that a larger disk must never lie on top of a smaller one.
Click on the image.
Δεν υπάρχουν σχόλια:
Δημοσίευση σχολίου