|
|
|
Article de revue:
|
|
Clé de citation BibTeX: Magalakaki2005
|
|
Magalakaki, O., & Tijus, C. A. (2005). Exploration et planification dans le problème des anneaux chinois: la découverte des règles à partir des propriétés. L'année Psychologique, 105(4), pp. 625–647.
Ajoutée par: Sterenn Audo 2008-02-04 13:15:31
|
|
|
|
|
|
|
|
Résumé
Solving the Chinese Rings Puzzle (ChRP, or baguenaudier) consists of removing tokens according to a recursive rule. Contrary to other puzzle problems, such as the Tower of Hanoi, the ChRP problem space is linear and a 21-state path leads from the initial to the final state: to reach the goal, it is enough to never return backwards. However, in practice, participants make up to 300 moves to solve the ChRP. We show that the heuristic "reduce the distance that separates the current state from the goal state (hill climbing)" and states informativeness are some of the factors explaining ChRP difficulty. (PsycINFO Database Record (c) 2007 APA, all rights reserved)(from the journal abstract)
Ajoutée par: Sterenn Audo
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Idées
pdf dispo
Ajoutée par: Sterenn Audo
|
|
|
