This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision | ||
spcs:summer2014:d6 [2014/07/22 12:05] ffpaladin [Part 2: Visual Sorting II. Spend 20-30 min (Yesterday Teams)] |
spcs:summer2014:d6 [2014/07/22 17:18] (current) ffpaladin [Part 4 - JS Platformer (Teams, if you have time)] |
||
---|---|---|---|
Line 161: | Line 161: | ||
- A Reset Button | - A Reset Button | ||
- | **Option 3:** If you'd rather work on your Seurat (Pixel Splotches), then you can create a way to change the ellipse sizes while within the program. | + | **Option 3:** If you'd rather work on your Seurat (Pixel Splotches), then you can create a way to change the ellipse sizes while within the running program. |
Remember, if your partner is done with the project, to Fork it into your own directory. Forking will allow you to continue the project on your own. You can keep a copy for yourself. | Remember, if your partner is done with the project, to Fork it into your own directory. Forking will allow you to continue the project on your own. You can keep a copy for yourself. | ||
+ | |||
+ | Everything on gh-pages! | ||
---- | ---- | ||
Line 256: | Line 258: | ||
==== Step 2: An object that has x and y ==== | ==== Step 2: An object that has x and y ==== | ||
- | Try to see if you can create objects like you did above. | + | Try to see if you can create objects like you did for the ball classes. |
==== Step 3: Adjacency Matrix ==== | ==== Step 3: Adjacency Matrix ==== | ||
Line 266: | Line 268: | ||
Using some algorithm... Maybe Breadth First Search, draw a path that on the screen that highlights what's going on in the code. See example of lines above. | Using some algorithm... Maybe Breadth First Search, draw a path that on the screen that highlights what's going on in the code. See example of lines above. | ||
- | REMINDER: Shortest Path is NOT the Traveling Sales Person problem. That one is much harder. You do not have to return home like the image above. | + | REMINDER: Shortest Path is NOT the Traveling Sales Person problem. TSP is much harder. You do not have to return home like the image above. |
- | ==== Step 5: Traveling Sales Person ==== | + | ==== Step 5: Traveling Sales Person (Optional) ==== |
Find the shortest distance that Mousey can go INCLUDING his return home. | Find the shortest distance that Mousey can go INCLUDING his return home. | ||
Line 280: | Line 282: | ||
---- | ---- | ||
- | ===== Part 4 - JS Platformer ===== | + | ===== Part 5 - JS Platformer (Teams, if you have time) ===== |
Cookbook! You know what to do. | Cookbook! You know what to do. |