Aller directement à la navigation

Article : Les tours de Hanoï dans tous leurs états - Colegiul National Emil Racovita (Cluj - Roumanie)

Résumé de la production: 
After explaining the purpose of the game of the Hanoï towers, we worked on determining the number of minimum displacements required to move n disks from any situation A to any other situation B. In addition to the rules given, a new restriction was added: one can only move a disk to the nearest rod. Two methods have been used to provide the mathematical result of the minimum number of movements required to displace n disks from any given situation to another one. Firstly, the method of induction, after observing a certain numerical pattern in the studied examples, followed by a C++ program created for the situation in which the disks can be placed only on the neighbouring pillar.
Mots clés:

Menu principal 2

Compte_rendu | by Dr. Radut