lecture 30 more recursion towers of hanoi
play

Lecture 30: More Recursion Towers of Hanoi From Wikipedia... The - PowerPoint PPT Presentation

Nov 27, 2022 •49 likes •99 views

Lecture 30: More Recursion Towers of Hanoi From Wikipedia... The puzzle was invented by the French mathematician Edouard Lucas in 1883. There is a story about an Indian temple in Kashi Vishwanath which contains a large room with three time-worn

  1. Lecture 30: More Recursion

  2. Towers of Hanoi From Wikipedia... The puzzle was invented by the French mathematician Edouard Lucas in 1883. There is a story about an Indian temple in Kashi Vishwanath which contains a large room with three time-worn posts in it surrounded by 64 golden disks. Brahmin priests, acting out the command of an ancient prophecy, have been moving these disks, in accordance with the immutable rules of the Brahma, since that time. The puzzle is therefore also known as the Tower of Brahma puzzle. According to the legend, when the last move of the puzzle will be completed, the world will end. It is not clear whether Lucas invented this legend or was inspired by it.

  3. Bubbles

  4. Bubbles: Recursively Splitting the Unit Square

  5. Problem: Seripienski Triangles

Recommend

CS302 - Data Structures using C++ Topic: The Towers of Hanoi Kostas Alexis The Towers of Hanoi

CS302 - Data Structures using C++ Topic: The Towers of Hanoi Kostas Alexis The Towers of Hanoi

CS302 - Data Structures using C++ Topic: The Towers of Hanoi Kostas Alexis The Towers of Hanoi Introduction to the problem The Towers of Hanoi is a mathematical puzzle where one has three pegs and n disks and the goal is to move

548 views • 23 slides
Recursion READING: LC textbook chapter 7 Recursion Recursive algorithms A

Recursion READING: LC textbook chapter 7 Recursion Recursive algorithms A

Summary Topics recursion overview simple examples Sierpinski gasket counting blobs in a grid csci 210: Data Structures Hanoi towers Recursion READING: LC textbook chapter 7 Recursion Recursive

308 views • 7 slides
Chapter 17 Recursion Chapter Scope The concept of recursion Recursive methods

Chapter 17 Recursion Chapter Scope The concept of recursion Recursive methods

Chapter 17 Recursion Chapter Scope The concept of recursion Recursive methods Infinite recursion When to use (and not use) recursion Using recursion to solve problems Solving a maze Towers of Hanoi Java Foundations,

602 views • 41 slides
Recursion Summary Topics recursion overview simple examples Sierpinski

Recursion Summary Topics recursion overview simple examples Sierpinski

csci 210: Data Structures Recursion Summary Topics recursion overview simple examples Sierpinski gasket counting blobs in a grid Hanoi towers READING: LC textbook chapter 7 Recursion A method

635 views • 25 slides
Recursion Summary Topics recursion overview simple examples Sierpinski

Recursion Summary Topics recursion overview simple examples Sierpinski

csci 210: Data Structures Recursion Summary Topics recursion overview simple examples Sierpinski gasket counting blobs in a grid Hanoi towers READING: GT textbook chapter 3.5 Recursion A

459 views • 24 slides
csci 210: Data Structures Recursion Summary Topics recursion overview simple

csci 210: Data Structures Recursion Summary Topics recursion overview simple

csci 210: Data Structures Recursion Summary Topics recursion overview simple examples Sierpinski gasket Hanoi towers Blob check READING: GT textbook chapter 3.5 Recursion In general, a method

469 views • 17 slides
Recursion Part II 11/19/2013 Tower of Hanoi The problem

Recursion Part II 11/19/2013 Tower of Hanoi The problem

Recursion Part II 11/19/2013 Tower of Hanoi The problem defini/on: There are three towers Ini:ally, there are N disks on tower i, where the

836 views • 55 slides
ECE 2574: Data Structures and Algorithms - Recursion II C. L. Wyatt Today we will look at two

ECE 2574: Data Structures and Algorithms - Recursion II C. L. Wyatt Today we will look at two

ECE 2574: Data Structures and Algorithms - Recursion II C. L. Wyatt Today we will look at two more examples of recursion and discuss performance issues Warmup Binary search of arrays Towers of Hanoi solution Efficiency of

562 views • 17 slides
RECURSION (CONTINUED) Lecture 9 CS2110 Summer 2019 Plus Tower of Hanoi 2 The objective

RECURSION (CONTINUED) Lecture 9 CS2110 Summer 2019 Plus Tower of Hanoi 2 The objective

RECURSION (CONTINUED) Lecture 9 CS2110 Summer 2019 Plus Tower of Hanoi 2 The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules: 1. Only one disk can be moved at a time. 2. Each move

277 views • 27 slides
The Towers of Hanoi A B C Goal: Move stack of

The Towers of Hanoi A B C Goal: Move stack of

The Towers of Hanoi A B C Goal: Move stack of rings to another peg Rule 1: May move only 1 ring at a time Rule 2: May never have larger ring on top of smaller ring Recursive Towers of

522 views • 11 slides
MA/CSSE 473 Day 15 Return Exam Student questions Towers of Hanoi Subsets Ordered Permutations

MA/CSSE 473 Day 15 Return Exam Student questions Towers of Hanoi Subsets Ordered Permutations

MA/CSSE 473 Day 15 Return Exam Student questions Towers of Hanoi Subsets Ordered Permutations MA/CSSE 473 Day 13 Student Questions on exam or anything else Towers of Hanoi Subset generation Gray code Permutations and order

347 views • 5 slides
GDHP g Distributed Hanoi Protocol NIIBE Yutaka <gniibe@fsij.org> The Free

GDHP g Distributed Hanoi Protocol NIIBE Yutaka <gniibe@fsij.org> The Free

GDHP g Distributed Hanoi Protocol NIIBE Yutaka <gniibe@fsij.org> The Free Software Initiative of Japan p. 1 2005-11-08 IWFST 2005 Towers of Hanoi In 1893, invented by douard Lucas (Professor N. CLAUS). Good

430 views • 6 slides
Trees Last time: recursion In the last lecture, we learned about recursion &

Trees Last time: recursion In the last lecture, we learned about recursion &

Trees Last time: recursion In the last lecture, we learned about recursion & divide-and-conquer Split the problem into smaller parts Solve each of the smaller parts separately: easier to code & understand! Apply these

782 views • 38 slides
Recursion: Introduction and Correctness Lecture B Jones MWF 9-9:50am PCNYN 109 Lecture D

Recursion: Introduction and Correctness Lecture B Jones MWF 9-9:50am PCNYN 109 Lecture D

Recursion: Introduction and Correctness Lecture B Jones MWF 9-9:50am PCNYN 109 Lecture D Russell MWF 4-4:50am Center 101 http://cseweb.ucsd.edu/classes/sp16/cse21-bd/ April 11, 2016 Today's plan 1. What's recursion? 2. Correctness of

716 views • 40 slides
Recursion Contents Recursion in general Simple examples The need to move closer to a

Recursion Contents Recursion in general Simple examples The need to move closer to a

Lecture 4 Recursion Contents Recursion in general Simple examples The need to move closer to a solution List processing predicates Recursion in general Recursion is the idea of defining something in terms of itself. It

474 views • 15 slides
Foundations of Computer Science Lecture 7 Recursion Powerful but Dangerous Recursion and

Foundations of Computer Science Lecture 7 Recursion Powerful but Dangerous Recursion and

Foundations of Computer Science Lecture 7 Recursion Powerful but Dangerous Recursion and Induction Recursive Sets and Structures Last Time 1 With induction, it may be easier to prove a stronger claim. 2 Leaping induction. n 3 < 2 n for

183 views • 16 slides
Recursion and Networking CS 118 Computer Network Fundamentals Peter Reiher Lecture 12 CS 118

Recursion and Networking CS 118 Computer Network Fundamentals Peter Reiher Lecture 12 CS 118

Recursion and Networking CS 118 Computer Network Fundamentals Peter Reiher Lecture 12 CS 118 Page 1 Winter 2016 Outline Preview and motivation What is recursion? The basic block concept Stacks, hourglasses, and DAGs Lecture

1.32k views • 69 slides
1 Recursive Definitions Infinite Recursion The recursive part of the LIST definition is used

1 Recursive Definitions Infinite Recursion The recursive part of the LIST definition is used

CSC 2014 Java Bootcamp Lecture 9 Recursion 2 Recursion Recursion is a fundamental programming technique that can provide an elegant solution certain kinds of problems RECURSIVE THINKING 3 4 Recursive Thinking Recursive Definitions

148 views • 4 slides
15-112 Fundamentals of Programming Week 5 - Lecture 2: Recursion June 14, 2016 What is

15-112 Fundamentals of Programming Week 5 - Lecture 2: Recursion June 14, 2016 What is

15-112 Fundamentals of Programming Week 5 - Lecture 2: Recursion June 14, 2016 What is recursion? Recursion: To understand recursion, you have to first understand recursion. What is recursion? Recursion: To understand recursion, you have

1.51k views • 118 slides
Lecture 15: Recursion (Sections 5.8-5.10) CS 1110 Introduction to Computing Using Python [E.

Lecture 15: Recursion (Sections 5.8-5.10) CS 1110 Introduction to Computing Using Python [E.

http://www.cs.cornell.edu/courses/cs1110/2019sp Lecture 15: Recursion (Sections 5.8-5.10) CS 1110 Introduction to Computing Using Python [E. Andersen, A. Bracy, D. Gries, L. Lee, S. Marschner, C. Van Loan, W. White] Recursion Recursive

488 views • 28 slides
Lecture 16: More Recursion! CS 1110 Introduction to Computing Using Python [E. Andersen, A.

Lecture 16: More Recursion! CS 1110 Introduction to Computing Using Python [E. Andersen, A.

http://www.cs.cornell.edu/courses/cs1110/2019sp Lecture 16: More Recursion! CS 1110 Introduction to Computing Using Python [E. Andersen, A. Bracy, D. Gries, L. Lee, S. Marschner, C. Van Loan, W. White] Recursion Recursive Function : A

588 views • 43 slides
15-112 Fundamentals of Programming Week 5 - Lecture 3: More Advanced Recursion June 15, 2016

15-112 Fundamentals of Programming Week 5 - Lecture 3: More Advanced Recursion June 15, 2016

15-112 Fundamentals of Programming Week 5 - Lecture 3: More Advanced Recursion June 15, 2016 Recursion vs Iteration 15-112 View Recursion Iteration - Elegance + - Performance + Debugability - + Memoization def fib(n): if (n <

762 views • 62 slides
Recursion in C++ Stephen P. Carl - CS 242 1 Recursion Defined Recursion is a technique for

Recursion in C++ Stephen P. Carl - CS 242 1 Recursion Defined Recursion is a technique for

Recursion in C++ Stephen P. Carl - CS 242 1 Recursion Defined Recursion is a technique for defining data structures or algorithms in terms of themselves . A recursive algorithm is a form of decomposition where rather than choosing an arbitrary

846 views • 22 slides
Topics Simple Recursion Chapter 13 Recursion with a Return Value Binary Search

Topics Simple Recursion Chapter 13 Recursion with a Return Value Binary Search

Topics Simple Recursion Chapter 13 Recursion with a Return Value Binary Search Revisited Recursion Recursion Versus Iteration Simple Recursion Recursive Methods When solving a problem using recursion, the idea is to

626 views • 13 slides

More recommend