By Katie Dzerovych Jon Wood JB Henderson Mentor Professor Snapp.

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

The Towers of Hanoi or Apocalypse When?.
CS1010: Programming Methodology
© 2011 Pearson Education, publishing as Addison-Wesley Chapter 8: Recursion Presentation slides for Java Software Solutions for AP* Computer Science 3rd.
The Tower Of Hanoi Edouard Lucas
The Algorithmic problems?
Fibonacci Numbers and Binet Formula (An Introduction to Number Theory)
Chapter Recurrence Relations
Introduction to Algorithms
Levers in History By: Christina Widder.
More Recursion: Permutations and Towers of Hanoi COP 3502.
ANCIENT EGYPT By:O.M November TABLE OF CONTENTS HIEROGLYPHICS WOMEN IN ANCIENT EGYPT IMPORTANT ANIMALS GODS AND GODDESSES PYRAMAIDS.
Pi Patrick Ahern. This is what the symbol for pi looks like.
Towers of Hanoi
Analyzing Algorithms and Problems Prof. Sin-Min Lee Department of Computer Science.
The Tower of Hanoi Ben Epstein Special Topics 2003.
Recursion.
1 Section 6.1 Recurrence Relations. 2 Recursive definition of a sequence Specify one or more initial terms Specify rule for obtaining subsequent terms.
C++ Programming: Program Design Including Data Structures, Fourth Edition Chapter 16: Recursion.
Evaluating a STEMM Career in Mathematics
Chapter 8 With Question/Answer Animations 1. Chapter Summary Applications of Recurrence Relations Solving Linear Recurrence Relations Homogeneous Recurrence.
HISTORY OF PUZZLES AND HOW THEY RELATE TO OUR EVERYDAY LIVES.
Introduction to Programming (in C++) Recursion Jordi Cortadella, Ricard Gavaldà, Fernando Orejas Dept. of Computer Science, UPC.
Copyright © Cengage Learning. All rights reserved.
Recursively Defined Sequences Lecture 35 Section 8.1 Wed, Mar 23, 2005.
Advanced Counting Techniques
Egyptian and Babylonian Period (2000 B.C B.C.) Introduction to early numeral systems Simple arithmetic Practical geometry Decimal and Sexagesimal.
Analysis of Algorithm Lecture 3 Recurrence, control structure and few examples (Part 1) Huma Ayub (Assistant Professor) Department of Software Engineering.
Chapter 8. Section 8. 1 Section Summary Introduction Modeling with Recurrence Relations Fibonacci Numbers The Tower of Hanoi Counting Problems Algorithms.
Mathematics in Ancient Egypt
COMPSCI 102 Introduction to Discrete Mathematics.
13.2 Recursive Definitions Objective 1) Provide the recursive definition for sequences; 2) Identify the type of a sequence from a recursive definition.
Recursion Jordi Cortadella Department of Computer Science.
Module #20 - Recurrences 1 Ch. 7 Recurrence Relations Rosen 6 th ed., §§7.1.
# 1# 1 VBA Recursion What is the “base case”? What is the programming stack? CS 105 Spring 2010.
Whiteboardmaths.com © 2004 All rights reserved
Chapter 8 With Question/Answer Animations. Chapter Summary Applications of Recurrence Relations Solving Linear Recurrence Relations Homogeneous Recurrence.
Java Programming: Guided Learning with Early Objects Chapter 11 Recursion.
Upon completion, the world will end…
Chapter 6.1: Recurrence Relations Discrete Mathematical Structures: Theory and Applications.
Copyright © 2011 Pearson Education, Inc. Exponential Astonishment.
22C:19 Discrete Math Advanced Counting Fall 2010 Sukumar Ghosh.
Recursion Colin Capham Recursion – an introduction to the concept.
Discrete Mathematics Lecture # 22 Recursion.  First of all instead of giving the definition of Recursion we give you an example, you already know the.
Great Theoretical Ideas in Computer Science.
UNIT 17 Recursion: Towers of Hanoi.
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.
Recursively Defined Sequences Lecture 40 Section 8.1 Wed, Apr 11, 2007.
Aumm-e-hani munir Maria umer Rakhshanda batool Faiza.
Recursion (Continued)
Tower of Hanoi problem: Move the pile of rings from one peg to another
Recursion.
Pramada Ramachandran, Assistant Professor, Department of Mathematics,
Great Theoretical Ideas in Computer Science
Introduction to Recurrence Relations
Great Theoretical Ideas in Computer Science
School of EECS, Peking University
Jordi Cortadella Department of Computer Science
Copyright © Cengage Learning. All rights reserved.
Exponential Astonishment
ECE 103 Engineering Programming
When Will The World End “Temple of Brahma” legend from the Indian city of Benares Priests must move 64 gold disks from one end of the temple to the other.
Exponential Astonishment
Tower of Hanoi problem: Move the pile of rings from one peg to another
Copyright © Cengage Learning. All rights reserved.
Tower of Hanoi Algorithm
Chapter 19: Recursion.
Problem Solving WEEK 3.
Tower of Hanoi problem: Move the pile of rings from one peg to another
Presentation transcript:

By Katie Dzerovych Jon Wood JB Henderson Mentor Professor Snapp

Puzzle A game, toy, or problem designed to test ingenuity or knowledge.

History The first puzzle found was an Egyptian document, the Rhind Mathematical Papyrus, that is over 3,600 years old There were 85 different puzzles in the papyrus One puzzle is: Seven houses contain seven cats. Each cat kills seven mice. Each mouse had eaten seven ears of grain. Each ear of grain would have produced seven hekats of wheat. What is the total of all of these? Archimedes invented a division of a square into 14 pieces leading to a game similar to Tangrams, Stomachion, involving making figures from the 14 pieces

Quick Puzzles ss/OutOfGlass.htm ss/OutOfGlass.htm /CrazyCut.htm /CrazyCut.htm TheSquares/CountingTheSquares.htm TheSquares/CountingTheSquares.htm

Tower of Hanoi Must transfer the tower of disks from one end peg to the other end peg The only rule is you cannot place a larger disk over a smaller disk Depending on the number of disks what is the least possible moves to make this work

History of the Tower of Hanoi Created by French mathematician, Edouard Lucas, in 1883 Based on the legend of a Hindu temple where the puzzle was used as mental discipline for young priests The legend says that since the beginning of time the priests in the temple were giving a stack of 64 gold disks one each a little smaller than the one below it The priests were to transfer the 64 disks from one of the three poles to another, the only rule they had was that a larger disk could never be on top of a smaller disk The legend says that when they finish the temple will crumble and the world will end

Tower of Hanoi Game game71.html game71.html

Equation for Tower of Hanoi The number of moves grows exponentially with the number of disks used If n is the number of disks and M is the number of moves M=2 n -1

Homework The legend of Hanoi says that there were 64 disks the priests would have to move before the world would end, how long would it take the priests to move the disks if it took them one second a move?

Works Cited O'Connor, J., and E. Robertson. "Mathematical Games and Recreations." May Web. 30 Nov Tower of Hanoi. Digital image. WTS Web. 30 Nov Belluck, Pam. "Ancient Egyptians Mathematical Ingenuity, Written on Papyrus - NYTimes.com." The New York Times - Breaking News, World News & Multimedia. 06 Dec Web. 30 Nov "LHS: Tower of Hanoi Facts." Lawrence Hall of Science. Web. 30 Nov Petković, Miodrag. Famous Puzzles of Great Mathematicians. Providence, RI: American Mathematical Society,