Upon completion, the world will end…

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

By Katie Dzerovych Jon Wood JB Henderson Mentor Professor Snapp.

The Tower Of Hanoi Edouard Lucas

CSED101 INTRODUCTION TO COMPUTING GREEDY APPROACH, DIVIDE AND CONQUER Hwanjo Yu.

The Algorithmic problems?

Chapter Recurrence Relations

Introduction to Algorithms

Development of mathematical thinking - prevention of schematic Mathematics can not be reduced to the same accounting skills, this leads to blocking of.

More Recursion: Permutations and Towers of Hanoi COP 3502.

AE1APS Algorithmic Problem Solving John Drake

MAT 4 – Kompleks Funktionsteori MATEMATIK 4 INDUKTION OG REKURSION MM 1.4 MM 1.4: Induktion og Rekursion Topics: Mathematical induction Example of Towers.

Analyzing Algorithms and Problems Prof. Sin-Min Lee Department of Computer Science.

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.

The Tower of Hanoi Ben Epstein Special Topics 2003.

Chapter 10: Recursion CS 201 Program Design with C Department of CS, Montana State University Mahmud Shahriar Hossain.

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.

Copyright © Cengage Learning. All rights reserved. CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION.

CSC 212 Recursion By Dr. Waleed Alsalih. Definition A recursive function (method) is one that calls itself. A recursive method must have a basis part.

Chapter 8 With Question/Answer Animations 1. Chapter Summary Applications of Recurrence Relations Solving Linear Recurrence Relations Homogeneous Recurrence.

Introduction to Programming (in C++) Recursion Jordi Cortadella, Ricard Gavaldà, Fernando Orejas Dept. of Computer Science, UPC.

Copyright © Cengage Learning. All rights reserved.

CSc /6 Week nine 1 CSc142 Algorithms and efficiency Week 9 Pete Bagnall Elizabeth Phillips

Advanced Counting Techniques

Analysis of Algorithm Lecture 3 Recurrence, control structure and few examples (Part 1) Huma Ayub (Assistant Professor) Department of Software Engineering.

Recursion Chapter 7 Copyright ©2012 by Pearson Education, Inc. All rights reserved.

Chapter 8. Section 8. 1 Section Summary Introduction Modeling with Recurrence Relations Fibonacci Numbers The Tower of Hanoi Counting Problems Algorithms.

Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.

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.

Thought Experiment Take a piece of paper one thousandth of an inch thick Now fold it in half and then in half again Do this 50 times (I know that this.

Chapter 8 With Question/Answer Animations. Chapter Summary Applications of Recurrence Relations Solving Linear Recurrence Relations Homogeneous Recurrence.

Chapter 6.1: Recurrence Relations Discrete Mathematical Structures: Theory and Applications.

Lecture - 8 On Stacks, Recursion. Prepared by, Jesmin Akhter, Lecturer, IIT,JU Lecture Outline Quick sort Algorithm Recursion –Calculate n factorial –Fibonacci.

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.

Pass the Buck Every good programmer is lazy, arrogant, and impatient. In the game “Pass the Buck” you try to do as little work as possible, by making your.

Discrete Mathematics Lecture # 22 Recursion.  First of all instead of giving the definition of Recursion we give you an example, you already know the.

UNIT 17 Recursion: Towers of Hanoi.

CMPF144 FUNDAMENTALS OF COMPUTING THEORY Module 9: The Tower of Hanoi.

1 Recursion Recursive function: a function that calls itself (directly or indirectly). Recursion is often a good alternative to iteration (loops). Its.

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.

Recursion by Ender Ozcan. Recursion in computing Recursion in computer programming defines a function in terms of itself. Recursion in computer programming.

Advanced Algorithms Analysis and Design By Dr. Nazir Ahmad Zafar Dr Nazir A. Zafar Advanced Algorithms Analysis and Design.

INTRO2CS Tirgul 6. Understanding the Traceback # in file t.py: def a(L): return b(L) def b(L): return L.len() #should have been len(L) # in the python.

Tower of Hanoi problem: Move the pile of rings from one peg to another

Pramada Ramachandran, Assistant Professor, Department of Mathematics,

Recursion Salim Arfaoui.

Introduction to Recurrence Relations

Recursion in Java December 12, 2005

Introduction to Computer Science - Alice

Recursive Thinking Chapter 9 introduces the technique of recursive programming. As you have seen, recursive programming involves spotting smaller occurrences.

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

Copyright © Cengage Learning. All rights reserved.

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.

Tower of Hanoi problem: Move the pile of rings from one peg to another

Copyright © Cengage Learning. All rights reserved.

Tower of Hanoi Algorithm

Tower of Hanoi Txt: 10.4 and p. 478 & SOL: DM.10

Chapter 19: Recursion.

Chapter 3 :Recursion © 2011 Pearson Addison-Wesley. All rights reserved.

Problem Solving WEEK 3.

Tower of Hanoi problem: Move the pile of rings from one peg to another

Presentation transcript:

Upon completion, the world will end…

History The Tower of Hanoi puzzle was invented by the French mathematician Edouard Lucas in 1883. Lucas is also known for his study of the Fibonacci sequence. The related Lucas sequence is named after him. He gave a formula for finding the nth term of the Fibonacci sequence. Lucas was educated at the Ecole Superieure. He worked in the Paris observatory and later became a professor of mathematics in Paris. In the meantime he served in the army.

The objective of the game is to move the entire stack to another peg. What is It? The Tower of Hanoi or Towers of Hanoi is a mathematical game or puzzle. It consists of three pegs, and a number of disks of different sizes which can slide onto any peg. The puzzle starts with the disks neatly stacked in order of size on one peg, smallest at the top, thus making a conical shape. The objective of the game is to move the entire stack to another peg.

The Rules Sound Simple??? Only one disk may be moved at a time. Each move consists of taking the upper disk from one of the pegs and sliding it onto another peg, on top of the other disks that may already be present on that peg. No disk may be placed on top of a smaller disk. Sound Simple???

The Solution This illustration shows the solution to the puzzle of the Tower of Hanoi using half the number of discs for a quicker demonstration.

The Legend… There is a legend about an Indian temple that contains a large room with three time-worn posts in it surrounded by 64 golden discs. The priests of Brahma, acting on an ancient prophecy, have been moving these discs in accordance with the rules of the puzzle. Legend has it that when the last move of the puzzle is complete, the world will end. This legend accredits the puzzles alternate name “The Tower of Brahma”. According to calculations, the process of moving all of the discs without breaking the rules of the puzzle would take 586.549 billion years. The earth is currently approximately 13.7 billion years old.

Applications Used in psychological research on Problem Solving Used as Backup Rotation Scheme when performing computer data backups. Popular for teaching recursive algorithms to beginning programming students Used as a memory test by neuropsychologists trying to evaluate amnesia Used for fun in Math class after you finish a test!

“Current World” Where have YOU seen the Tower of Hanoi? If you have played any of these video games, you may be quite familiar with it! Black & White The Island of Dr. Brain The Secret Island of Dr. Quandary Star Wars: Knights of the Old Republic Zork Zero The Legend of Kyrandia: Hand of Fate