08-Karel-Solves-Mazes

08-Karel-Solves-Mazes - CS106A Handout 08 April 4th, 2011...

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

View Full Document Right Arrow Icon
CS106A Handout 08 Spring 2011 April 4 th , 2011 Karel Solves Mazes Supposed Karel has been placed in the upper left corner of maze, and she needs to find the lone beeper assumed to be in the lower right corner. We’ll further assume the maze has no loops, so that there’s exactly one shortest path between any two locations. Many of you who’ve not programmed before might fear this problem as entirely too nerdy: the type of problem that in-costume Star Wars enthusiasts like to solve. Trust me that this is just one domain of computer science, and we’ll tackle problems from multiple domains
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 over the course of the quarter. This problem, however, comes with such a compact, brilliant solution that you’ll have to forgive me if I’m furthering a propagating stereotype. The reason this problem is important is because it demonstrates the importance of algorithmic thinking. In particular, the problem requires some intense thinking on how to best realize a solution, but once you come up with a clear recipe on how to get Karel from
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 08/24/2011 for the course CS 106A taught by Professor Sahami,m during the Spring '08 term at Stanford.

Page1 / 3

08-Karel-Solves-Mazes - CS106A Handout 08 April 4th, 2011...

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

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