Acceso usuarios
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.
