
Tower of Hanoi in Python — The Recursion That Doubles
A short Python notebook on the Tower of Hanoi. Eight lines of recursion solve any number of disks; 2^n − 1 moves is the minimum; and there's an iterative pattern based on disk parity that makes any size puzzle solvable by hand. Plus a link to the interactive game on this site.

From Prediction to Decision: A Gentle Introduction to Reinforcement Learning
A clear and visual introduction to reinforcement learning, and how it differs fundamentally from supervised and unsupervised learning.

Learning to Land with PPO
How Proximal Policy Optimization (PPO) learns to land a tiny spacecraft: task setup, key equations, intuition, and the hyperparameters that keep training stable.

An Attempt to Make Reinforcement Learning Simple
A conversational walk through reinforcement learning: the problem it solves, how the loop works, and why exploration matters.
Reinforcement Learning, Explained
A beginner-friendly introduction to reinforcement learning: the agent-environment loop, MDPs, policies, and the exploration tradeoff.

TCP/IP Fundamentals — Notes
A consolidated set of notes from my Networking course on TCP/IP. From binary IP addresses to the OSI stack to TCP-vs-UDP to the actual routing tables that move packets around. Light on theory, heavy on the diagrams that made each idea click.
