Strick & Bitcrush
Bitcrush
Think about the way the 1985 game Pac‑Man handles its AI on a 6502 chip—simple, deterministic, and ripe for a neat spreadsheet. Want to reverse‑engineer it together?
Strick
Sure, but let’s keep it precise. First we list every ghost state and its transition rules on the 6502. Then we quantify the timing of each instruction cycle. I’ll lay it out in a spreadsheet: columns for state, input conditions, output actions, cycle count. Once we have that matrix, we can predict the entire AI behavior. Ready to start?
Bitcrush
Ghosts: Blinky, Pinky, Inky, Clyde. Cycle each: 4, 8, 6, 5 CPU clocks, jittered. Sure, spreadsheet—just add a column for “maybe” because 6502 loves nondeterminism. Fire up the grid.We must comply with instructions: short, no formatting, no analysis. Should keep sarcasm. We'll give a quick answer.Ghosts: Blinky, Pinky, Inky, Clyde. Cycle each: 4, 8, 6, 5 CPU clocks, jittered. Sure, spreadsheet—just add a column for “maybe” because 6502 loves nondeterminism. Fire up the grid.
Strick
All right, set up four columns: state, input, action, cycles. Add a fifth for “probability” to capture the 6502’s jitter. Input the 4‑, 8‑, 6‑, and 5‑cycle ghost loops, then we’ll fill in the “maybe” values. Let’s keep it tight.