-
Notifications
You must be signed in to change notification settings - Fork 341
Homework 1
AnneMGal edited this page May 11, 2017
·
43 revisions
- Sign up for the class mailing list.
- If you would like to join the "coding train" slack group where I have a #machinelearning channel, let me know via e-mail.
- Design a programming exercise for yourself (suggestions below) and post a link to documentation of your work below.
- Add an AI/ML project that inspires you to the Project References wiki
- Post any questions below.
(These are video tutorials that I've made about the week 1 examples, there are more video tutorials references on the week 1 notes page.)
- Binary Search Tree 1, Binary Search Tree 2
- Depth First Search Maze Generation: Part1, Part2, Part3, Part4
- A star pathfinding: Part1 Part2 Part3
- Traveling Salesperson: Part1 Part2 Part3
- Also of relevance to the above videos and examples:
The assignment is to put your own creative "spin" on one of the examples (or create your own new example). Here are some suggestions but by no means do you need to stick to them.
- Add your own visual design ideas to the binary tree.
- Create an interactive version of the binary tree where users can add and delete nodes.
- Redesign the Six Degrees of Kevin Bacon example to use a larger dataset and/or your own dataset. Visualize the resulting path with a canvas.
- Make a web-based version of the Animal Guessing Game
- Add autonomous steering agents to the A star (or any other) pathfinding examples that appear to move through the space intelligently.
- In the A star example, each cell on the grid is either an "open spot" or a "wall." What happens if you think about the space more like a map with water, sand, roads, as well as possibly elevation?
- Try to develop an approximate solution to the Traveling Salesperson Problem. An example of this is a "Greedy" algorithm. 1) Start with a random node. 2) Pick the node closest to that node. Repeat step 2 until done! How well does this work?
- Investigate a search algorithm we didn't cover in class. For example, Dijkstra's algorithm.
- Document your work on the web and link to it below.
- Add any questions below:
- your question here -name
- How do you better / more evenly distribute the binary tree? -Lisa
- Name - assignment - any notes
- Sejo Vega-Cebrián - TSP Dances
- Daniel - I-It and I-Thou Relationships
- Dror - adding nodes
- Esther - Sorting pixels in binary tree
- FY - Useless Visualization for Binary Search Tree
- Jessica - Vending Machine Snack Decider
- Phil - Pathfinding on city street maps | Download executable
- Jade -
- Koji - Breadth-first search
- Laura - Six Degrees of Robert Johnson
- Miao -
- Ondina -Maze 1 Maze 2 Maze 3
- Richard - almost NOC
- Siman -
- Wangshu - Lighting the way
- Stanlyn -
- Yueping -
- Yun - Bean Machine
- Zach -
- Name - assignment - any notes
- Cristóbal Valenzuela - BFS with Wikipedia articles and words/terms
- Yuli - AStar in 3D using webgl in threejs
- Anne-Michelle - Blog/Binary Trees
- Hayley -Blog Bokeh light translator
- Jesal -
- Ji Young - Six degrees of Ji Young
- Lisa - Binary Tree in Three.js
- Lucy -
- Michael - - AStar (2D) (Processing) (link coming asap ... 😨)
- Mithru -
- Nanou -
- Patrick - code - Unfinished twitterbot version of the animal guessing game you can interact via DM
- Peiyu -
- Shivanku -
- Yao -
- Shelley - blog post and code
- Ada - An Actual Tree
- Yuchi -