This shows you the differences between two versions of the page.
Both sides previous revision Previous revision | Next revision Both sides next revision | ||
spcs:summer2014:d8 [2014/07/23 17:01] ffpaladin [Part 1: Blog] |
spcs:summer2014:d8 [2014/07/23 17:02] ffpaladin |
||
---|---|---|---|
Line 178: | Line 178: | ||
Please try to find one path that visits everyone. You do not need to find the shortest one, but try to find the shortest path after you've successfully drawn a path to everyone's home. Once you've done this, consider yourself finished, unless you want to unlock the bonus challenges. | Please try to find one path that visits everyone. You do not need to find the shortest one, but try to find the shortest path after you've successfully drawn a path to everyone's home. Once you've done this, consider yourself finished, unless you want to unlock the bonus challenges. | ||
- | **Design Challenge I:** For an additional challenge, try to find a round trip path back home that is the shortest. Starting at Stanford and ending at Stanford. | + | You do not have to do these in order! |
+ | |||
+ | **Design Challenge X:** For an additional challenge, try to find a round trip path back home that is the shortest. Starting at Stanford and ending at Stanford. | ||
{{:epgy:ai13:screen_shot_2013-07-21_at_8.01.54_pm.png|}} | {{:epgy:ai13:screen_shot_2013-07-21_at_8.01.54_pm.png|}} | ||
Line 184: | Line 186: | ||
{{:epgy:ai13:screen_shot_2013-07-21_at_7.56.30_pm.png|}} | {{:epgy:ai13:screen_shot_2013-07-21_at_7.56.30_pm.png|}} | ||
- | **Design Challenge II** - Once you have done this, make the program such that you can select the starting point anywhere on the map. Right now, Mousey starts at Stanford. When I click the screen, I want to be able to choose where Mousey starts. The algorithm should run again after every click. | + | **Design Challenge Y** - Make the program such that you can select the starting point anywhere on the map. Right now, Mousey starts at Stanford. When I click the screen, I want to be able to choose where Mousey starts. The algorithm should run again after every click. |
- | **Design Challenge III** - Most likely, your program draws each edge in that you are choosing. If your Traveling Sales Person or Shortest Distance program does not animate yet, add a button called "animate." This animation should demonstrate the search algorithm that you are using (similar to Visual Sorting). | + | **Design Challenge Z** - Most likely, your program draws each edge in that you are choosing. If your Traveling Sales Person or Shortest Distance program does not animate yet, add a button called "animate." This animation should demonstrate the search algorithm that you are using (similar to Visual Sorting). |
---- | ---- |