Projects

Gravity is a real-time n-body gravitational simulator built with Pygame. It simulates the gravitational pull between up to 300 bodies simultaneously, letting you watch emergent orbital patterns form in real time. I built it because I was fascinated by how simple physics rules produce complex, unpredictable behaviour and it was a good excuse to learn Pygame. The main tradeoff was performance: the simulation runs an O(n²) calculation on every frame, checking every body against every other. With 300 bodies this gets expensive fast. If I were building it again I'd use NumPy to vectorise the force calculations, which would give a significant speedup without changing the physics.

breadManager is a Discord economy bot where members of a server can earn, gamble, and steal each other's breads. It has commands for gambling your balance, robbing other users, and checking the leaderboard. I built it because I wanted my friend group's server to have something fun and custom rather than a generic bot. The biggest technical mistake I made was storing all user data in a JSON file — it worked fine at first but quickly became messy to manage and error-prone when multiple operations happened at once. If I rebuilt it today I'd use MongoDB which I learnt recently.

Equation Solver is a desktop GUI application that solves systems of equations with up to three variables. You enter your equations through a clean interface and the app finds the solution. I built it out of frustration — solving three-variable systems by hand is tedious and error-prone. The core limitation is that it uses brute force: it iterates through a range of possible values and checks which combination satisfies all equations. This means the solution range is limited and the approach is inefficient. I'm still confused on how I would optimize it further.

A functional clone of the board game Twixt, built in pure C. The win condition is checked using a depth-first search algorithm that traces whether a player has formed a connected path across the board. I built it as a Computer Programming assignment and it was my first time implementing a graph algorithm in C. It works correctly but the code is not optimised as the DFS runs on every move rather than only on the affected region of the board, which is wasteful. I didn't know enough at the time to optimise it, but now I'd look into incremental graph traversal to avoid redundant checks.

C-Unplugged is a CLI application built in pure C that simulates a music player — it "plays" songs by displaying their title in the terminal, with controls to skip, go back, and browse a playlist. I built it as a Computer Programming assignment specifically to understand how linked lists work in practice. Every song in the playlist is a node in a doubly linked list, so navigating forward and backward maps directly to traversing next and previous pointers. It's a simple project but a bit challenging in pure C.