aim and background: multiple sclerosis (ms) is a chronic inflammatory disease of the central nervous system in which primary symptoms emerges in adults between the age 20 and 40 years old. previous findings indicate 15-20 percent of multiple sclerosis (ms) patients are diagnosed with executive function impairments. the purpose of this study is to evaluate planning function as one of executive f...

The prefrontal cortex (PFC) plays an important role in cognitive function, involved in Executive Functions (EFs) such as planning, working memory, and inhibition. Activation in the PFC also occurs during some motor activities. One commonly used tool to assess EF is the Tower of Hanoi, demonstrating sensitivity to PFC dysfunction. However, limited neuroimaging evidence is available to support th...

Potential age differences in the electroencephalographic (EEG) correlation (r) between the prefrontal and parietal cortices during performance of the Tower of Hanoi task were studied. In three groups of healthy males (G1, 11-13; G2, 18-20, and G3, 26-30, years of age) EEGs were recorded at baseline and during performance of the Tower of Hanoi task. The parameters of the task showed no significa...

The purpose of this paper is to prove the Frame-Stewart algorithm for the generalized Towers of Hanoi problem as well as finding the number of moves required to solve the problem and studying the multitude of optimal solutions. The main idea is to study how to most effectively move away all but the last disc and use the fact that the total number of moves required to solve the problem is twice ...

Combinatorial properties of the multi-peg Tower of Hanoi problem on n discs and p pegs are studied. Top-maps are introduced as maps which reflect topmost discs of regular states. We study these maps from several points of view. We also count the number of edges in graphs of the multi-peg Tower of Hanoi problem and in this way obtain some combinatorial identities.

This pearl aims to demonstrate the ideas of wholemeal and projective programming using the Towers of Hanoi puzzle as a running example. The puzzle has its own beauty, which we hope to expose along the way.

Our theme bases on the classical Hanoi Towers Problem. In this paper we will define a new problem, permitting some positions, that were not legal in the classical problem. Our goal is to find an optimal (shortest possible) sequence of discs' moves. Besides that, we will research all versions of 3-pegs classical problem with some special constraints, when some types of moves are disallowed.

An L(2, 1)-labeling of a graph G is equitable if the number of elements in any two color classes differ by at most one. The equitable L(2, 1)-labeling number λe(G) of G is the smallest integer k such that G has an equitable L(2, 1)-labeling. Sierpiński graphs S(n, k) generalize the Tower of Hanoi graphs—the graph S(n, 3) is isomorphic to the graph of the Tower of Hanoi with n disks. In this pap...

In this we paper we consider the version of the classical Towers of Hanoi games where the game-board contains more than three pegs. For k pegs we give a 2k 1/(k−2) lower bound on the number of steps necessary for transferring n disks from one peg to another. Apart from the value of the constants Ck this bound is tight.

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 memory consolidation focuses on adults; hence, the current study examined sleep-r...