06.02_Thinking2 - © S J Luck All rights reserved 1 © S J...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: © S. J. Luck All rights reserved 1 © S. J. Luck All Rights Reserved Thinking II • Tower of Hanoi – Goal: Move the disks from the post on one end to the post on the other end – Rule 1: You can move a disk from one post to the next, but you cannot skip a post – Rule 2: A larger disk can never be on top of a smaller disk • This is an example of a well-structured problem – The set of possible moves is clearly and completely speciFed by the description of the problem • An ill-structured problem – The possible steps are not speciFed • A really ill-structured problem: – Paul McGufFn was born in 1986 in St. Louis – His father was Irish; his mother was Native American – ¡ifty-two years later, he dies while playing chess in Nebraska – However, he dies in 1999 – How is this possible? • Possible answers: – In the Native American calendar, each year is counted as 4 years, making him 13 standard years old at time of death – He was playing chess in Room 1999 at the Omaha Motel 6 – “1999” is the name of a town in Nebraska – “However” is the name of his father There are 25 people who live on one ¢oor of an apartment building. On this ¢oor are 25 apartments laid out in a Fve by Fve grid. If you draw this grid, the square in the upper left-hand corner is number 1, and the next ones are 2, 3, 4, and 5. The line below that is 6, 7, 8, 9, 10, 11, and 12. This goes all the way to 25....
View Full Document

Page1 / 3

06.02_Thinking2 - © S J Luck All rights reserved 1 © S J...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online