Why classical game-tree search beats LLMs as a browser game opponent

A developer at lkforge.com has built three browser-based game AI engines using classical algorithms — minimax with alpha-beta pruning for tic-tac-toe, expectimax for 2048, and breadth-first search for Color Lines — deliberately avoiding large language models. The tic-tac-toe engine delivers a provably optimal move in roughly 0.3 milliseconds, runs entirely on-device with no server calls, and has not lost a single game across 1,200 self-play tests. The developer argues that LLMs, trained to predict text tokens rather than search game trees, can explain strategy fluently but still make losing moves, making them unsuitable for solved games with finite rule sets. By contrast, the deterministic nature of classical search allows precise performance benchmarking, such as the 2048 solver reaching the 2048 tile in 69.6% of 250 self-play games. The project frames the choice not as anti-LLM but as matching the right tool to the problem — classical search for fixed-rule board games, language models for language tasks.