April 11, 2026
Center column supremacy
Optimal Strategy for Connect 4
A 150KB “cheat sheet” says Red always wins—fans cheer, purists nitpick, memes erupt
TLDR: A new 150KB “weak” strategy maps perfect first-player Connect 4 play—start center, follow the script—without heavy computing. Commenters hype the artful visuals and fresh clarity, while others say it’s not fundamentally new versus 1988/Allis; memes crowned “center or bust” and “150KB beats 14TB”.
Connect 4 drama alert: a new site drops a teeny-tiny 150KB “weak solution” that says if the first player opens in the center and follows the script, it’s game over. No supercomputer, no searching—just a quick scan of the board and a move. Fans are calling it the most gorgeous nerd flex of the year, with multiple commenters raving about the creator’s hypnotic graph animations and linking to the “I Solved Connect 4” video. The vibe: art-meets-math-meets-win button.
But the thread quickly split. On one side: hype merchants celebrating the elegance (“150KB beats 14 terabytes?! Put that on a T-shirt”). On the other: veteran theorists pointing out Connect 4 was strongly solved in 1988, and arguing this isn’t “fundamentally different” from earlier work by Victor Allis—just a killer, streamlined presentation. The phrase “center or bust” became the day’s meme, while jokers declared the middle column the new “pay-to-win.”
For non-nerds, here’s the tea: a “strong solution” covers every position (huge, heavy), while a “weak solution” only covers the perfect winning path for the first player. This one’s shockingly small, runs fast, and shows the structure in real time. So while the community tussles over novelty vs. packaging, everyone agrees on one thing: the visuals slap, the insights are crisp, and the center column just got crowned king.
Key Points
- •WeakC4 is a weak solution for 7x6 Connect Four that guarantees a first-player win from the start given prescribed play.
- •It encodes a language for perfect play on a subset of nodes and a small opening tree restricted to those nodes.
- •The approach uses no runtime search, selecting moves in O(wh) time and occupying about 150 KB before symmetry de-duplication.
- •The entire weak solution can be visualized and rendered in real time, illustrating challenging openings and lines.
- •The article contrasts weak vs. strong solutions, noting strong solutions cover all positions and can require ~14 TB uncompressed data, while weak solutions offer smaller, more interpretable representations.