spcs:summer2014:d8
Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
spcs:summer2014:d8 [2014/07/23 17:00] ffpaladin [Feedback!] |
spcs:summer2014:d8 [2014/07/24 16:12] (current) ffpaladin [Part 4: JavaScript - JS Shooter (For those who are breezing through)] |
||
|---|---|---|---|
| Line 152: | Line 152: | ||
| ====== Assignments ====== | ====== Assignments ====== | ||
| - | ===== Part 1: Blog ===== | + | ---- |
| + | ===== Part 1: Blog - Final Projects ===== | ||
| Of course, you already know to blog all your projects! | Of course, you already know to blog all your projects! | ||
| - | Moving onto the blog for today.... FINAL PROJECTS!!! | + | If all your projects are blogged, the move onto the blog for today.... FINAL PROJECTS!!! |
| Mousey the mouse heard that the Exploratorium was pretty cool. He's wondering if our class could pull together an exhibit of similar displays. Mousey was too small to use the mechanical devices, so he'd prefer computer programs or just smaller demos. | Mousey the mouse heard that the Exploratorium was pretty cool. He's wondering if our class could pull together an exhibit of similar displays. Mousey was too small to use the mechanical devices, so he'd prefer computer programs or just smaller demos. | ||
| Line 177: | 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 183: | 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). |
| ---- | ---- | ||
| Line 193: | Line 196: | ||
| We've talked about Depth-First and Breadth-First Search. Now, let's do A* Search. A* is used for AI Pathfinding. | We've talked about Depth-First and Breadth-First Search. Now, let's do A* Search. A* is used for AI Pathfinding. | ||
| - | Try this part ONLY if you feel up to the coding challenge. You may also go back and ENHANCE your Seurat program (being able to resize the ellipses) or the Visual Sort (adding a pause/randomize button). | + | Try this part ONLY if you feel up to the coding challenge. You may also go back and ENHANCE your Seurat program (being able to resize the ellipses) or the Visual Sort (adding a pause/randomize button) or the Ball Bouncing (adding gravity and more collisions). |
| Here are some resources on A* | Here are some resources on A* | ||
| Line 216: | Line 219: | ||
| ---- | ---- | ||
| - | ===== Part 4: JavaScript - JS Shooter ===== | + | ===== Part 4: JavaScript - JS Fighter (For those who are breezing through) ===== |
| - | Cookbook shooter game. Make sure to blog what you create! | + | Cookbook fighter game. Make sure to blog what you create! |
| + | |||
| + | ---- | ||
| ===== Feedback! ===== | ===== Feedback! ===== | ||
| Line 224: | Line 229: | ||
| https://docs.google.com/forms/d/1nNvgtxwBtGiDMfe_jjx1PH8MzwJlOR7jIAaEdLZ-sZI/viewform | https://docs.google.com/forms/d/1nNvgtxwBtGiDMfe_jjx1PH8MzwJlOR7jIAaEdLZ-sZI/viewform | ||
| - | ---- | + | |
/soe/sherol/.html/teaching/data/attic/spcs/summer2014/d8.1406160002.txt.gz · Last modified: 2014/07/23 17:00 by ffpaladin
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 3.0 Unported
