The causes underlying the correlation between working memory and fluid intelligence remain unknown. There are some researchers who argue that the answer can be found on the presumed executive component of working memory. However, the available empirical evidence is far from conclusive. The present study tested a sample of 229 participants. Intelligence, working memory, and executive functioning...

We study integration of task planning and motion planning in a general execution monitoring framework. We show the applicability of this framework, on a modified version of Tower of Hanoi where the orientations of rings matter and rotations of rings maybe required while being moved. We represent this problem as a planning problem in the action language C+, and compute a shortest task plan using...

For any n ≥ 1 and any k ≥ 1, a graph S(n, k) is introduced. Vertices of S(n, k) are n-tuples over {1, 2, . . . , k} and two n-tuples are adjacent if they are in a certain relation. These graphs are graphs of a particular variant of the Tower of Hanoi problem. Namely, the graphs S(n, 3) are isomorphic to the graphs of the Tower of Hanoi problem. It is proved that there are at most two shortest p...

This paper explores the interaction between implicit and explicit processes during skill learning, in terms of top-down learning (that is, learning that goes from explicit to implicit knowledge) versus bottom-up learning (that is, learning that goes from implicit to explicit knowledge). Instead of studying each type of knowledge (implicit or explicit) in isolation, we stress the interaction bet...

Research has shown the importance of strategies in guiding problem solving behavior. The experiment and model presented here provide further specification of how more optimal strategies come to be adopted with experience. Isomorphs of the Tower of Hanoi were used to allow participants to develop a degree of expertise with a novel task. In the solutions, evidence for at least two strategies is a...

The classic Tower of Hanoi puzzle was marketed by Edouard Lucas in 1883 under the name ”Tower of Hanoi” [31]. There, n disks are due to be moved from one peg to another, using an auxiliary peg while never placing a bigger disk above a smaller one. Its optimal solution is classic in Computer Science. In this thesis, we study a generalization of the original puzzle. The problem is generalized by ...