On the Frame-Stewarr algorithm for the multi-peg Tower of Hanoi problem (Extended Abstract)

2000 ◽  
Vol 3 ◽  
pp. 1-4
Author(s):  
S KLAVZAR ◽  
U MILUTINOVIC ◽  
C PETR
Keyword(s):  
Tower Of Hanoi

Repeated Assessment of the Tower of Hanoi Test: Reliability and Age Effects

Assessment ◽  
2000 ◽  
Vol 7 (3) ◽  
pp. 297-310 ◽  
Author(s):  
Jaana Ahonniska ◽  
Timo Ahonen ◽  
Tuija Aro ◽  
Asko Tolvanen ◽  
Heikki Lyytinen
Keyword(s):  
Age Effects ◽  
Test Reliability ◽  
Tower Of Hanoi ◽  
Repeated Assessment

scholarly journals Executive Functions: Influence of Sex, Age and Its Relationship With Intelligence

2015 ◽  
Vol 25 (62) ◽  
pp. 383-392
Author(s):  
Larissa de Oliveira e Ferreira ◽  
Daniela Sacramento Zanini ◽  
Alessandra Gotuzo Seabra
Keyword(s):  
Working Memory ◽  
Executive Functions ◽  
Children And Adolescents ◽  
Perceptual Organization ◽  
Age Groups ◽  
Neuropsychiatric Disorders ◽  
Discriminative Power ◽  
Speed Of Processing ◽  
Intelligence Scale ◽  
Tower Of Hanoi

AbstractThe Tower of Hanoi is a tool used to evaluate executive functions. However, few studies describe what functions are evaluated in this test. This study investigates the executive functions, evaluated by the Tower of Hanoi (ToH), and the influence of gender, age and its relationship with intelligence. We evaluated 55 children and adolescents, between the ages of ten and 16, without diagnosed neuropsychiatric disorders. The results showed that the performance and time in to complete the Tower of Hanoi have no discriminative power when comparing age groups and sex; there was also no significant correlation found between the ToH and the execution quotient of the Wechsler Intelligence Scale for Children - Third Edition (WISC III), perceptual organization and the speed of processing. Only the subtest coding were positively related to the ToH, demonstrating that these instruments may be measuring related aspects of intelligence and executive functions, namely intelligence and working memory.

scholarly journals On the Star Puzzle

2019 ◽  
Vol 39 ◽  
pp. 1-14
Author(s):  
AAK Majumdar
Keyword(s):  
Recurrence Relation ◽  
Additional Condition ◽  
Tower Of Hanoi ◽  
Minimum Number

In the star puzzle, there are four pegs, the usual three pegs, S, P and D, and a fourth one at 0. Starting with a tower of n discs on the peg P, the objective is to transfer it to the peg D, in minimum number of moves, under the conditions of the classical Tower of Hanoi problem and the additional condition that all disc movements are either to or from the fourth peg. Denoting by MS(n) the minimum number of moves required to solve this variant, MS(n) satisfies the recurrence relation . This paper studies rigorously and extensively the above recurrence relation, and gives a solution of it. GANIT J. Bangladesh Math. Soc.Vol. 39 (2019) 1-14

Sign in / Sign up

Export Citation Format

Share Document