Sleep is an active state that plays an important role in the consolidation of memory. It has been found to enhance explicit memories in both adults and children. However, in contrast to adults, children do not always show a sleep-related improvement in implicit learning. The majority of research on sleep-dependent learning focuses on adults; hence the current study examined sleep-related effect...

In this paper, Hop eld neural networks have been considered in solving tower of Hanoi test which is used in determining of de cit of planning capability of human prefrontal cortex. The main di erence of this work from the ones in the literature which use neural networks, is: The tower of Hanoi problem has been formulated here as a special shortest path problem. In the literature, some Hop eld n...

Finding an optimal solution to the 4-peg version of the classic Tower of Hanoi problem has been an open problem since the 19th century, despite the existence of a presumed-optimal solution. We verify that the presumed-optimal Frame-Stewart algorithm for 4-peg Tower of Hanoi is indeed optimal, for up to 20 discs. We also develop a distributed Tower of Hanoi algorithm, and present 2D and 3D repre...

Every goal-oriented domain with a problem generator from the first or second IPPC (Younes, Littman, Weissman, & Asmuth, 2005; Bonet & Givan, 2006) was considered for inclusion in our experiments. For inclusion, we require a planning domain with a fixed action definition, as defined in Section 2.4 in the paper, that in addition has only ground conjunctive goal regions. Four domains have these pr...

In this paper we analyze a variant of the n-disk Towers of Hanoi problem with an arbitrary starting and ending configuration using transition graphs representing valid configurations. In particular, we show that starting with any configuration, there is a sequence of moves that goes through each valid configuration exactly once and back to the starting configuration. Also, we show how the origi...

The publisher regrets that the errors listed below occurred during the processing of the above-referenced paper. p. 39: " Towers of Hanoi " in the list of keywords should read " Tower of Hanoi " p. 71: " Substituting into Equation A1 " (above Eq. A3) should read " Substituting into Equation 1 " p. 71: " n ϭ 1 " as the summation index in Eq. A3 should read " i ϭ 1 " p. 71: " converges if s Ͻ 0.5...

We generalize Hammond-Lewis birank to multiranks for partitions into colors and give combinatorial interpretations for multipartitions such as b(n) defined by H. Zhao and Z. Zhong and Qp1,p2(n) defined by Toh congruences modulo 3, 5, 7.

Knowledge construction requires both perceptual information from external sources and our active interpretation of that information. Thirty one 5 grade elementary school students were asked to move plates in a Tower of Hanoi (TOH) task, which was displayed on a screen monitor. When the students were asked to respond to the weight of the plates, both imagination and non-imagination groups report...

Another version of programming ‘The Tower of Hanoi’ in TEX is provided. No nodding knowledge of Lisp is required; just plain TEX. There is no restriction on the number of disks, apart from the installed limits of TEX. Generalized disks can be moved as well.

The Tower of Hanoi problem with h ≥ 4 pegs is long known to require a sub-exponential number of moves in order to transfer a pile of n disks from one peg to another. In this paper we discuss the Pathh variant, where the pegs are placed along a line, and disks can be moved from a peg to its nearest neighbor(s) only. Whereas in the simple variant there are h(h − 1)/2 bi-directional interconnectio...