![]() Only the most upper disk from one of the rods can be moved in a move.The aim of the game is to move the tower of disks from one rod to another rod. the largest disk at the bottom and the smallest one on top. A number of disks is stacked in decreasing order from the bottom to the top of one rod, i.e. The game "Towers of Hanoi" uses three rods. The rules of the game are very simple, but the solution is not so obvious. The legend and the game "towers of Hanoi" had been conceived by the French mathematician Edouard Lucas in 1883. But there is - most probably - no ancient legend. But don't be afraid, it's not very likely that they will finish their work soon, because 264 - 1 moves are necessary, i.e. When they would have finished their work, the legend tells, the temple would crumble into dust, and the world would end. But one rule has to be applied: a large disk can never be placed on top of a smaller one. ![]() The priests, if the legend is about a temple, or the monks, if it is about a monastery, have to move this stack from one of the three poles to another one. each disk on the pole a little smaller than the one beneath it. The disks are of different sizes, and they are put on top of each other, according to their size, i.e. There is an old legend about a temple or monastery, which contains three poles. Enjoying this page? We offer live Python training courses covering the content of this site.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |