Corpus ID: 14243013

La quatrième tour de Hanöı

@inproceedings{Bousch2014LaQT,
  title={La quatrième tour de Hanöı},
  author={Thierry Bousch},
  year={2014}
}

Thierry Bousch

Published 2014

In the four-peg variant of the Towers of Hanoi game, it is well known that N disks can be transferred from a column to another in 2 + 2 + · · · + 2 moves, where ∇n denotes the largest integer p such that p(p + 1)/2 6 n, and it was conjectured that this number of moves was the minimum possible. We shall see, in this article, that is is indeed the case. Résumé Dans la variante à quatre colonnes des Tours de Hanöı, on sait bien qu’on peut transférer N disques d’une colonne vers une autre en 2 + 2… CONTINUE READING

topo.math.u-psud.fr

Save to Library

Create Alert

Cite

Launch Research Feed