Cosmic Wipeout
A push your luck game with 5 dice, made in Java. Combinations of symbols rolled on the dice determine score and other effects, and certain combinations result in a bust if the player keeps rolling; or they can stay and keep the points. The hardest part was getting all the different combinations programmed correctly and to react to each other as a player keeps rolling.
Traveling Salesperson problem (TSP) solver
A algorithm coded in Java that is used to solve the TSP, a problem based on finding the shortest and/or most efficient route. It utilized the greedy Manhattan approach, which calculates distances on a horizontal and vertical grid and attempts to find the shortest path to the goal. It does this by continously jumping to the nearest unvisited location until the route is complete. The hardest part was visulainzing the theory and translating it into a coordinates based code algorithm.
Pong and beyond
Using Visual Studio and coding in JS, re-created Pong, and then continually built upon the knowledge gained to make more advanced games, backgrounds, and player input/score tracking. The hardest part was figuring out what was needed to make the games work right, since just about everything had to be hardcoded into exsistence and manually placed.