Connect 4 Weakly Solved in 150KB With Zero Runtime Search

A new project called WeakC4 presents a fundamentally different approach to solving Connect 4. Rather than brute-forcing the entire game tree - which runs to 14TB uncompressed as a strong solution - this weak solution guarantees a first-player win using only about 150 kilobytes of data and zero runtime computation, selecting moves in O(wh) time.

The key insight is the tradeoff between knowledge and computation. A strong solution precomputes every position; a naive player searches the tree in real time. WeakC4 instead identifies a compact “language” that describes perfect play for a critical subset of game positions, then finds a small opening tree whose leaf nodes all fall within that language. The result exploits the inherent structural regularity of Connect 4’s game tree - patterns and “simple tricks” that eliminate the need for both exhaustive memorization and runtime search.

Beyond practical play, the project is an exercise in understanding the intrinsic geometry of Connect 4. The solution is fully visualizable and renderable in real time, exposing the game’s structural self-similarity in a way that massive lookup tables never could. It reframes game-solving not as raw computation but as compression - finding the information-theoretically smallest representation that still guarantees perfect play.