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.
100,000 digits of π, formatted to aid in memorization. After experimenting with different layouts, I have settled on this as my favorite. So far, I've used this digit layout to memorize over 700 digits. The idea is that you stare at some digits and recite them in in your head until you can do so without looking at the screen. Repeat and you can memorize as many digits as you want.
Improved from Luca Todesco's jbme. Automatically retries upon failure. No user interaction necessary.