Caroline Hsu's Projects
I optimized the A* Algorithm to solve an 8 puzzle game.
Using Depth First Search and Breadth First Search, I wrote a program that implements "Find" Unix command searching through a file system (tree data structure) and outputed all the files with the extension .pdf. Each output included the full path from the root to the file as well as the file.
I implemented Dijkstra's Shortest Path algorithm using priority queue and another method using loops.
NAO will play the memory matching game where an even number of pairs of cards are organized in an array like fashion. It will achieve so through object recognition.
This project recognizes handwritten digits via a sensor and converts it into a 5x3 grid.