This is just a collection of some fun projects that I've worked on :)
Features an AI that plays Minesweeper optimally.
New Version: Powered by the minimax algorithm. Plays perfectly, always making the optimal move. Features 3 game modes (play to win, play to lose, play to draw).
Old Version: Powered by countless painstakingly written if statements that happen to render it unbeatable, but in a very primitive and unsatisfying way.
Powered by the minimax algorithm. Plays chopsticks optimally.
Flappy Bird, but with a circle.
My implementation of Conway's Game of Life.
Uses left Riemann sums to numerically approximate integrals.
Solves linear systems in which the number of unknowns is equal to the number of equations.
Improved from Luca Todesco's jbme. Automatically retries upon failure. No user interaction necessary.
100,000 digits of π, formatted to aid in memorization. I have actually used this to memorize over 500 digits by staring at this page and reciting the digits in my head.