May 18, 2026
Checkmate, but make it cursed
Regex Chess: A 2-ply minimax chess engine in 84,688 regular expressions
A wildly pointless chess stunt has commenters stunned, laughing, and roasting the bot
TLDR: A developer made a real chess engine out of 84,688 text-matching rules, and the internet can’t decide whether it’s genius or madness. Commenters were dazzled by the absurd ambition, but some also roasted it after finding it could miss an immediate checkmate threat.
The internet has found its latest beautifully unhinged obsession: a programmer built a chess-playing system out of 84,688 regular expressions—basically turning a tool meant for finding text into a machine that can choose chess moves. The creator openly admits this was done for no practical reason whatsoever, which only made people love it more. The vibe in the comments was part awe, part confusion, part “why would anyone do this?” and honestly, that’s exactly why it took off.
The strongest reactions fell into two camps: the worshippers and the roast squad. One commenter summed up the general mood with, “This is like a fever dream,” while another simply posted “2025,” as if no other explanation was needed for this level of chaotic invention. Fans treated it like mad-scientist art, with one person practically swooning over finally seeing ideas from computer science textbooks come alive thanks to the creator’s weird-computer habit. But the drama came when someone actually played against it and quickly found a glaring weakness: the engine reportedly failed to stop a one-move checkmate, which is chess-speak for “your weird text monster can still get embarrassed fast.”
That clash is what made the comment section sparkle. Was this a genius masterpiece, a cursed science fair project, or both? Community consensus: absolutely both. Even skeptics sounded impressed, basically saying, “Sure, it’s possible—but I would never be the one insane enough to build it.” And that, really, is the whole appeal of Regex Chess: it’s not just code, it’s performance art with commenters supplying the popcorn.
Key Points
- •The article presents “Regex Chess,” a chess engine implemented as 84,688 regular expressions applied sequentially to a board state.
- •The program takes a chess board string as input and transforms it through regex replacements to output a valid move.
- •The author’s method is to build a regex-based virtual computer rather than encode chess logic directly in a conventional program.
- •The machine state is represented as a single string containing both a stack and named variables.
- •The article demonstrates the approach with a basic push instruction implemented as a regex pattern and replacement using capture groups and back-references.