1 / 6

Exploring Linear Complexity in Solving Complex Problems: The Towers of Hanoi

Explore linear complexity in problem-solving with a focus on The Towers of Hanoi puzzle. Understand how the number of moves required increases with the addition of extra inputs. Learn about solving the puzzle efficiently in 2n-1 moves.

aprilrodriguez
Download Presentation

Exploring Linear Complexity in Solving Complex Problems: The Towers of Hanoi

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Solving Complex Problems The Towers Of Hanoi Module 7- Solving Complex Problems

  2. Linear Complexity • Mowing the lawn is a problem that demonstrates linear complexity. • If you double the size of the area that you want to mow, it will take twice as long to complete the task.

  3. More Complex Problems • Many problems will increase in complexity very quickly each time an extra input is added. • We will explore the Towers Of Hanoi Puzzle http://www.tinyurl.com/hanoi1

  4. How many moves does it take? Did you know you should be able to complete the puzzle in (2n -1) moves where n is the number of disks. For 3 disks 2n -1= (23 – 1) = (8-1) =7 moves

  5. How many moves does it take? Remember it takes (2n-1) moves where n=number of disks

  6. How much time does it take? These calculations are based on a computer being able to execute 1 million instructions per second

More Related