competitive programming

Retro Game Mechanics Explained shows how the Atari 2600 draws images with almost no video memory, by having the CPU race the CRT beam line by line. It walks through the techniques in detail.

aGameScout explains rolling, the third major NES Tetris playstyle, in which players tap the back of the controller to move pieces faster than hypertapping. It covers how the technique works and where it comes from.

Reducible's visual walkthrough of the Fast Fourier Transform, motivated by polynomial multiplication. It shows how the FFT's key ideas can be discovered by asking the right questions.

Veritasium tells the story of the Fast Fourier Transform, from its use in detecting nuclear tests to Cold War politics, and how it could have changed the arms race. It includes a short, intuitive explanation of what the Fourier transform does.

Martin Donald explains the Wave Function Collapse algorithm using Sudoku-like constraint solving and shows how he implemented it with Blender and Godot. It links demos and reference articles.

Polylog explains how algorithms can be turned into circuits and encoded as satisfiability problems, which lets you effectively run them backwards. It uses this to motivate breaking RSA, general reductions to SAT, and what P vs NP is really asking.

A walkthrough of the Quake III fast inverse square root, explaining where the constant 0x5f3759df comes from. It covers IEEE 754 floats, the bit hack that approximates a logarithm, and a Newton's method refinement.

2swap explains how he solved the Klotski sliding-block puzzle by mapping its full state space as a graph and visualizing it. The video includes footage of the Guinness world-record solve and links to an interactive graph.

AlphaPhoenix uses Monte Carlo simulation and annealing-style methods to draw North Carolina congressional district maps, both gerrymandered and fair. He focuses on the fascinating computational problem rather than the politics.

3Blue1Brown uses Wordle as an excuse to teach information theory and entropy, building a solver that picks guesses by expected information and incorporating word frequencies.

Matt Parker follows the community effort to speed up his slow Wordle-solving code, which ended up running hundreds of millions of times faster. He walks through the techniques contributors used.

Matthias Wandel tests old and new code on a range of PCs, including a new mini PC, to measure how much faster modern hardware really is. He also shows optimization techniques such as branchless code, with benchmark programs on GitHub.

Freya Holmer's 74-minute video essay on splines, covering Bezier curves, B-splines, derivatives and the different levels of continuity (C0, C1, C2), built with custom animation tools. She notes she did not cover non-uniform splines.

Asianometry examines why Japan's software industry has lagged despite its hardware strengths. It looks at dependence on US software and the low prestige of programming.