GraphSweeper
Minesweeper on a random graph instead of a grid. Nodes are connected by edges from a Delaunay triangulation, laid out by a D3 force simulation, and the graph is live, so you can drag nodes around while you play.
Things I've built, broken, and learned from along the way.
Minesweeper on a random graph instead of a grid. Nodes are connected by edges from a Delaunay triangulation, laid out by a D3 force simulation, and the graph is live, so you can drag nodes around while you play.
A Python solver that exhaustively finds all possible mathematical expressions given a set of numbers to reach a target value. Implements recursive RPN tree generation and multiprocessing to solve puzzles like the '24 game' or Countdown's numbers round.
A Julia implementation of a primal-dual central path following algorithm for solving linear programming problems. Achieves 7+ digit accuracy on LPnetlib benchmarks, solving problems with 144,000+ non-zero entries in under 300 iterations.
A diffusion model for manufacturing action segmentation achieving 88.7% accuracy. Implemented YOLO-based hand detection with automatic task labeling for pipeline generalization across multiple production lines.