c 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.

Tom Scott explains for Computerphile why handling time and timezones in code is so hard, walking through a simple web app that computes how long ago something happened. It covers the quirks of timezones and calendars and ends in an exasperated rant.

Rune Skovbo Johansen explains Surface-Stable Fractal Dithering, a technique he invented and released as open source. It makes dithering stick to 3D surfaces and covers the experiments and shortcomings along the way, inspired by Return of the Obra Dinn.

Pannenkoek explains how Super Mario 64 handles wall, floor and ceiling collisions, including triangles, normal vectors, quarter steps and out of bounds. It is a detailed 37-minute technical walkthrough of the game's physics.

Digital Foundry's Alex Battaglia analyzes Metro Exodus Enhanced Edition, the first AAA game built around ray tracing. It covers the new global illumination, emissive lighting, DLSS and performance on AMD and Nvidia hardware.

Modern Vintage Gamer looks at OpenLara, an open source Tomb Raider engine, running on the Game Boy Advance. The video explains how the port achieves playable speeds on the GBA's slow ARM CPU, with input from the developer XProger.

Kaze Emanuar searches for the best sine approximation for the Nintendo 64, comparing the lookup tables in Mario 64 and Ocarina of Time with polynomial alternatives. It walks through numerics and 3rd, 4th and 5th order approximations.

SalC1 explains how the seed behind the Minecraft title screen panorama was found, using community effort and the Minecraft@Home project. It covers the search through Beta 1.7.3 world seeds.

2swap explores lambda calculus using John Tromp's lambda diagrams, with animated beta-reductions, asking what PLUS times PLUS gives. It touches on Church encodings and the equivalence of Turing machines and lambda calculus.

Ward Cunningham explains the history and intent of the debt metaphor, which he coined while refactoring the WyCash product. He says debt means code reflecting an incomplete understanding of the problem, not sloppy programming.

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.

A short animated simulation comparing how Multics and Unix were developed, showing why Unix's small composable programs and pipes gave it a efficiency advantage. It frames Unix as a moonshot achievable by a small team.

CGP Grey compares airplane boarding methods, based on an arXiv paper, and shows why the intuitive back-to-front approach is slow while random or outside-in boarding does better.

Tom Scott-style absurdist tour by Tom7 of SIGBOVIK chess projects: a tournament of 30 weird chess algorithms used to rate a color- and piece-blind chess program. Topics include mirrors, arithmetic encoding, perverted game tree search and a diluted Stockfish.

The 8-Bit Guy covers IBM's 1981 CGA graphics system, including how composite output and artifacting produced extra colors beyond the nominal palette. He argues CGA looked better in period than it does on RGB monitors.

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.

LearnCode.academy presents a roadmap of web development technologies to learn in 2016 and 2017, spanning front-end, back-end and DevOps tools.

The 8-Bit Guy explains the color limitations of 1980s computers and consoles such as the NES and Commodore 64. It shows how sprites, attributes and palettes shaped the look of old games.

An episode of Plogue's chipresearch series on emulating the Yamaha DX7 from the hardware up. It covers the sub CPU and main CPU, address map investigation, cartridges, firmware analysis and a skeleton MAME driver.

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.

Moon Channel, run by a lawyer, explains the legal basis for emulation, including the history of emulation case law and Nintendo's takedown of Dolphin's Steam release. It argues the legality of emulators is more fragile than most people assume.

Tom Scott visits Penistone to explain the Scunthorpe problem, showing why naive web and profanity filters block innocent words.

An episode of Coding Secrets by Jon Burton on retro copy protection, in particular physically damaging a disk with a laser so copies fail. It explains how this defeated hackers and pirates.

Numberphile with Daniel Erman on the Josephus problem, where people in a circle are eliminated in turn. It shows how the survivor's position follows a neat pattern tied to powers of two and binary.

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.

LGR looks at the 1988 Canon Xap Shot, a still video camera that records photos to a floppy disk as analog NTSC signal rather than digital data.

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.

Tom Scott explains YouTube's 11-character video IDs, which are base-64 encoded 64-bit numbers, and whether YouTube could ever run out of them. It covers counting systems and base 64 briefly.

8-Bit Show And Tell walks through the BASIC source code of the original Commodore 64 Sid Meier's Pirates!. It covers bugs, quirks and traces of abandoned features and scenarios left in the code.

A short CGP Grey bonus video explaining the shortest-splitline algorithm, which draws electoral districts by repeatedly splitting a state along its shortest dividing line while balancing population. It is offered as a neutral, algorithmic fix for gerrymandering.

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.