top of page
Demonstrations
Handpose Model
Connections
GitHub Repository
In this project, my peer and I recreated the New York Times Game Connections, tailoring it to include categories related to my school. The game has four categories, each containing four words, and the purpose is to find all the categories before running out of mistakes available. We constructed a series of panels, each randomly containing a word from a category, which the user can click to select their guess. After submitting a guess, if the category matches, it is removed from the grid. Otherwise, the remaining mistakes decrease. Ultimately, when all categories are found or no mistakes are left, the categories and their words are revealed.
Search & Sort Visualizer
GitHub Repository
In this visualizer, I demonstrated a binary search algorithm and implemented a selection sort feature. The program iterates through a dataset containing information on the time people spend on social media, and which platform they spend it most on. The user inputs a number for the binary search to locate within the dataset, and the application shows which index it is found.
Game of Life
GitHub Repository
This project is also an imitation of John Conway’s Game of Life, a cellular automata. In the program, there is a grid of cells that are either alive (green cell) or dead(white cell). Depending on its surrounding cells, it follows this set of rules:
Alive cells with two or three alive adjacent cells continue to live.
Dead cells with three alive adjacent cells become alive.
Any other cells stay or become dead.
Langton’s Ant
GitHub Repository
This project is an imitation of Langton’s Ant, based on simple rules to create complex behaviors. In this assignment, I explored 2d arrays and constructed cells based on the rules:
When at a white square, change the color, turn 90 degrees clockwise, and move forward one square
When at a black square, change the color, turn 90 degrees counter-clockwise, and move forward one square
bottom of page