programming

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.

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.

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.

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.

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.

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.

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.

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.