Actual tower vs. computer simulation

Slides:



Advertisements
Similar presentations
Tower of Hanoi Tower of Hanoi is a mathematical puzzle invented by a French Mathematician Edouard Lucas in The game starts by having few discs stacked.
Advertisements

Instructional Technology vs. Educational Technology
Direct Instruction Also called explicit instruction Widely applicable strategy that can be used to teach both concepts and skills Uses teacher explanation.
Problem definition The Tower of Hanoi is a mathematical game or puzzle. It consists of three rods, and a number of disks of different sizes which can.
Design of icons for use by Chinese in Mainland China Interacting with computers 9(1998) Yee-Yin Choong, Gavriel Salvendy Report: Yang Kun, Ou.
Use of Computer Technology in Education Course Management Systems Learning Management Systems Classroom Teaching Technology Modeling and Simulation and.
1 On a question of Leiss regarding the Towers of Hanoi problem.
1 Recursion  Recursion is a fundamental programming technique that can provide an elegant solution certain kinds of problems  Chapter 11 of the book.
Computer Simulation (1). 8 A (8) Initial State 44 Goal State B (5) C (3) A (8) B (5) C (3) Step 1 Step 2 Step 3 Step 4 Step 5 Step 6 Step 7.
Recursion.
Anatomy of Direct Instruction EDTE 408 Principles of Teaching.
The Tower of Hanoi
Research Methods for HCI: Cognitive Modelling BCS HCI Tutorial 1 st September, 2008.
Chapter 8 With Question/Answer Animations 1. Chapter Summary Applications of Recurrence Relations Solving Linear Recurrence Relations Homogeneous Recurrence.
Recursion Apan Qasem Texas State University Spring 2011.
Advanced Counting Techniques
13.2 Recursive Definitions Objective 1) Provide the recursive definition for sequences; 2) Identify the type of a sequence from a recursive definition.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Recursion Textbook chapter Recursive Function Call a recursive call is a function call in which the called function is the same as the one making.
Recursion Jordi Cortadella Department of Computer Science.
# 1# 1 VBA Recursion What is the “base case”? What is the programming stack? CS 105 Spring 2010.
Gesturing has a larger impact on problem-solving than action, even when action is accompanied by words Caroline Trofatter*, Carly Kontra, Sian Beilock.
Guideline for Language Classroom Instruction. Language presentation Objectives Materials (modalities) Rule presentations and Explanations.
11-1 Recursive Thinking A recursive definition is one which uses the word or concept being defined in the definition itself When defining an English word,
Stanford hci group / cs376 u Jeffrey Heer · 29 April 2009 Distributed Cognition.
Lecture 7 b Recursion is a fundamental programming technique that can provide an elegant solution to certain kinds of problems b Today: thinking in a recursive.
Chapter 6.1: Recurrence Relations Discrete Mathematical Structures: Theory and Applications.
Tower of Hanoi Puzzle Jianying Yu. I. Introduction The Puzzle: Conditions: n disks and three pegs. Conditions: n disks and three pegs. Goal: Move disks.
Recursive Algorithms A recursive algorithm calls itself to do part of its work The “call to itself” must be on a smaller problem than the one originally.
22C:19 Discrete Math Advanced Counting Fall 2010 Sukumar Ghosh.
Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 12 Recursion.
Ergonomics/Human Integrated Systems (Project 02)
Discrete Mathematics Lecture # 22 Recursion.  First of all instead of giving the definition of Recursion we give you an example, you already know the.
GENERAL METHODS AND TECHNIQUES OF TEACHING
CMPF144 FUNDAMENTALS OF COMPUTING THEORY Module 9: The Tower of Hanoi.
Recursion Chapter What is recursion? Recursion occurs when a method calls itself, either directly or indirectly. Used to solve difficult, repetitive.
1 In this puzzle, the player begins with n disks of decreasing diameter placed one on top of the other on one of three pegs of the game board. The player.
Tower of Hanoi Tower of Hanoi is a mathematical puzzle invented by a French Mathematician Edouard Lucas in The game starts by having few discs stacked.
1 Towers of Hanoi Three pegs, one with n disks of decreasing diameter; two other pegs are empty Task: move all disks to the third peg under the following.
Tower of Hanoi problem: Move the pile of rings from one peg to another
Pramada Ramachandran, Assistant Professor, Department of Mathematics,
goal setting Motivating people through goal setting
Chapter 11: The Nuts and Bolts of one-factor experiments.
Chapter 15 Recursion.
Using Cognitive Science To Inform Instructional Design
Discrete ABC Based on Similarity for GCP
Oleh: Beni Setiawan, Wahyu Budi Sabtiawan
Chapter 15 Recursion.
Recursive Thinking Chapter 9 introduces the technique of recursive programming. As you have seen, recursive programming involves spotting smaller occurrences.
Unit 18: Computational Thinking
Recursive Thinking Chapter 9 introduces the technique of recursive programming. As you have seen, recursive programming involves spotting smaller occurrences.
Jordi Cortadella Department of Computer Science
Recursive Definitions
Recursion (part 2) October 26, 2007 ComS 207: Programming I (in Java)
BHS Methods in Behavioral Sciences I
CS1120: Recursion.
Chapter 6. Theoretical Perspectives & Expanding Directions
Static Class Members March 29, 2006 ComS 207: Programming I (in Java)
Tower of Hanoi problem: Move the pile of rings from one peg to another
The Hanoi Tower Problem
GENERAL METHODS AND TECHNIQUES OF TEACHING
Chapter 11 Recursion.
11 Recursion Software Solutions Lewis & Loftus java 5TH EDITION
Recursion.
Chapter 19: Recursion.
Recursion (part 2) March 22, 2006 ComS 207: Programming I (in Java)
COMPONENTS OF PROBLEM SOLVING
Tower of Hanoi problem: Move the pile of rings from one peg to another
Java Software Solutions Foundations of Program Design Sixth Edition
LEARNER-CENTERED PSYCHOLOGICAL PRINCIPLES. The American Psychological Association put together the Leaner-Centered Psychological Principles. These psychological.
Presentation transcript:

Actual tower vs. computer simulation The Effects of Practice, Verbalization and Mode of Presentation on Problem Solving Strategies for the Tower of Hanoi Problem Lucas L. Wong, Noah P. Cohen, & Gary Kose Department of Psychology, Long Island University-Brooklyn Introduction The Tower of Hanoi problem is known as the “perfect problem,” having a clear starting point, a clear end point and discrete steps to achieve a solution. Difficulty solving the problem involves mastering a recursive move sequence. Performance on the problem has been linked to higher cognitive processes, planning and metacognitive awareness (Simon and Anzai, 1979). Solving the problem involves moving a set of graduated disks across a group of three pegs to reach a predefined end state. Progress towards the goal configuration is limited by two rules: move only one disk at a time and larger disks cannot be placed on top of smaller disks. The problem becomes more difficult by increasing the number of discs to be moved: moving two discs takes a minimum of 3 moves, moving 3 discs takes a minimum of 7, moving 4 discs requires at least 15 moves. How do these factors affect problem solving skills? 1. Practice: participants practiced on a 3-disc problem and then preformed a 4-disc problem (Ahlum-Heath and Di Vesta, 1986). 2. Mode of presentation: participants either solved the problem using a wooden model or solved the task on a computer-simulated version (Noyes and Garland, 2003) . 3. Verbalization: participants either verbalized their move sequence or solved the problem in silence (Zhang and Norman, 1994). Note: All participants were tested on a 4-disc problem and time of completion, number of moves and the proportion of optimal moves were the dependent variables. Hypotheses: It was expected that practice would improve performance, performance on the actual wooden puzzle would be better than on the computer-simulated version and that describing the moves while solving the problem would facilitate performance. Method Participants. Ninety-five undergraduate students participated in this study. Materials. The physical model of the Tower of Hanoi puzzle is composed of three vertical pegs that hold a predetermined number of disks of graduated diameters attached to a board. The computer model of the Tower of Hanoi puzzle was presented on a laptop, using a program called PEBL (Mueller, 2012). Procedure. A 2 x 2 x 2 between subjects design was used. Participants were randomly assigned to eight conditions: mode of presentation (computer vs. physical), experience (practice vs. no practice) and verbalization (concurrent verbalization vs. no verbalization). In the training phase participants were given their respective instructions and completed between 1 (no practice) and 5 (practice) multi-disk problems. Then, in the test phase, the final 4-disk criterion puzzle was completed. Results MANOVA showed a significant main effect for modality (Wilks’ Λ = .846, F(2,85) = 7.764, p = .001, η² = .154); a marginally significant effect for verbalization (Wilks’ Λ = .933, F(2,85) = 3.071, p = .052, η² = .067); and there was no significant main effect for practice; however, there was a significant interaction effect for experience and verbalization (Wilks’ Λ = .94, F(2, 85) = 4.017, p = .022, η² = .086). Follow up ANOVAs found significant main effect of modality on the number of moves used to solve the problem (F(1,93) = 10.306, p = .002, η² = .107) and the proportion of optimal moves (F(1,93) = 10.597, p = .002, η² = .110). Interestingly, it required move moves with the actual problem than with the computer simulation, but there were more optimal moves with the actual problem. There was significant main effect of verbalization on the number of moves (F(1,93) = 5.748, p = .019, η² = .063). Also, significant interaction between experience and verbalization for the number of moves, F(1,93) = 7.503, p = .007, η² = .080). Finally, there was a marginally significant interaction between modality and experience for the number of moves (F(1,93) = 3.513, p = .064, η² = .039). Actual tower vs. computer simulation Conclusions Practice on a 3-disc problem did not improve performance on a more difficult 4-disc problem. Although, practice may be effective when verbalizing while solving the problems. The modality of presenting the problem did have an impact on performance. While the actual problem required more moves than the computer simulated version, more optimal moves were made with the actual problem. Performance on the physical model of the Tower of Hanoi puzzle was improved for the total number of moves and the proportion of optimal to total moves. With practice, no effects on performance were found for the physical task, but a marginally significant effect was found for the computer task on number of moves. References Ahlum-Heath, M. E., & Di Vesta, F. J. (1986). The effect of conscious controlled verbalization of a cognitive strategy on transfer in problem solving. Memory & Cognition, 14 (3), 281-285. Anzai, Y., & Simon, H. A. (1979). The Theory of Learning by Doing. Psychological Review, 86 (2), 124-139. Mueller, S. T. (2012). PEBL: The psychology experiment building language (Version 0.12) [Computer experiment programming language]. Retrieved from http://pebl.sourceforge.net. Noyes, J. M., & Garland, K. J. (2003). Solving the Tower of Hanoi: does mode of presentation matter? Computers in Human Behavior, 19, 579-592. Zhang, J., & Norman, D. A. (1994). Representations in Distributed Cognitive Tasks. Cognitive Science, 18, 87-122.