Connect Four on 6 high, 7 wide grid, there are 4,531,985,219,092 positions for all game boards populated with 0 to 42 pieces. The game was first solved by James Dow Allen (October 1, 1988), and independently by Victor Allis (October 16, 1988). Allis describes a knowledge-based approach, with nine strategies, as a solution for Connect Four. Allen also describes winning strategies in his analysis of the game. At the time of the initial solutions for Connect Four, brute-force analysis was not deemed feasible given the game's complexity and the computer technology available at the time. Connect Four has since been solved with
Connect Four brute force methods beginning with John Tromp's work in compiling an 8-ply database (Feb 4, 1995). The artificial intelligence algorithms able to strongly solve Connect Four are minimax or negamax, with optimizations that include alpha-beta pruning, move ordering, and transposition tables. The code for solving Connect Four with these methods is also the basis for the Fhourstones integer performance benchmark. The solved conclusion for Connect Four is first player win. With perfect play, the first player can force a win, on or before the 41st move (ply) by starting in the middle column. The game is a theoretical draw when