skip to main content
LOTERRE

LOTERRE

Search from vocabulary

Lengua del contenido

| français English
Ayuda para la búsqueda

Concept information

Término preferido

Tower of Hanoi task  

Notice: Undefined index: in /var/www/html/model/Concept.php on line 546

Notice: Undefined index: in /var/www/html/model/Concept.php on line 546

Definición

  • "In the standard 3-disk TOH [Tower of Hanoi] puzzle, three disks of different sizes are stacked on a peg such that the largest disk is at the bottom and the smallest on top […]. There are three total pegs, and the goal is to re-stack the disks on the third peg with the following constraints (1) only one disk can be moved at a time, (2) a larger disk cannot be placed on top of a smaller disk and (3) a disk cannot be moved if there is another disk on top of it. There are countless variations of the task (for example, with different start and end states, different numbers of disks, and isomorphic contexts)." (Fansher et al., 2022, p. 1).

Concepto genérico

etiqueta alternativa (skos)

  • Lucas' Tower
  • problem of Benares Temple
  • problème de la Tour de Hanoï
  • pyramid puzzle
  • test de la Tour de Hanoï
  • TOH
  • Tour de Lucas
  • Tower of Brahma
  • Tower of Hanoi disk-transfer task
  • Tower of Hanoi problem
  • Tower of Hanoi puzzle
  • Tower of Hanoi test

Pertenece al grupo

Creador

  • Frank Arnould

En otras lenguas

URI

http://data.loterre.fr/ark:/67375/P66-BQBPNVTN-9

Descargue este concepto:

RDF/XML TURTLE JSON-LD Creado 22/8/23, última modificación 22/8/23