| 2014-2018: | B.A. Computer Science, Applied Mathematics at University of Wisconsin-Madison |
| 2018-2020: | M.S Computer Science at University of Texas at Austin |
| 2020-Present: | Software Engineer/Data and Applied Scientist at Microsoft |
GitHub LinkedIn
This is a Minimax based Chess AI that I wrote in Java. I added several Minimax optimizations (alpha-beta pruning, transposition tables, move-ordering heuristics, etc), an opening book generated from GM moves, and checkmating patterns for common endgames. It is also registered as a bot account on lichess.org, where it was adequate enough to defeat Stockfish Level 5.
Demo
This is a Sudoku solver written in Java that can quickly solve a standard Sudoku puzzle of any size. It treats the Sudoku puzzle as a more general Constraint Satisfaction Problem and uses Constraint Propogation and Conflict-Directed Backjumping to find the solution.
This project generates mazes in a variety of shapes using the Aldous-Broder and Recursive Backtracking generation algorithms. The mazes can be solved by hand using the arrow keys, or algorithmically using Depth-First Search, Dijkstra's Algorithm, and A-Star Search.
Code Demo