{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

recitation17

# recitation17 - MIT OpenCourseWare http/ocw.mit.edu 6.006...

This preview shows pages 1–8. Sign up to view the full content.

MIT OpenCourseWare http://ocw.mit.edu 6.006 Introduction to Algorithms Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms .

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

View Full Document
6.006 Recitation Build 2008.36
6.006 Proudly Presents PS 6 Super Mario Brothers Points Back on Tests DP vs. Minimum-Cost Paths

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

View Full Document
PS 6 Out The best way to gauge your understanding of Dynamic Programming Do fib (fibonacci) over the weekend Come get help if you can’t do it quickly! Do the other problems as soon as you understand them
Beating Super Mario: The Vision 1. Abstract into 6.006 problem 2. Solve using DP 3. pwn

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

View Full Document
Platforming I P platforms, at (x i , y i ) Starting on platform 1, want to get to platform P Pure pwnage Always move right Minimum # moves 5: (2, 7) 6: (2, 6) 4: (1,4) 2: (2, 3) 7: (3, 2) 3: (1,1) 1: (0,0)
Platforming II Moves from (x, y) walk: (x+1, y) jump: (x+1, y+1) or (x +1, y+2) super-jump: (x+1, y+3) or (x+1, y+4) fall: (x+d, y-d-d’) as long as d+d’ < 5 5: (2, 7) 6: (2, 6) 4: (1,4) 2: (2, 3) 7: (3, 2) 3: (1,1)

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}