Computational Proof of the Optimal 4x4 Boggle Board
2025-04-23
A programmer spent months using a branch and bound algorithm and custom data structures to computationally prove the highest-scoring board in a 4x4 game of Boggle. This solves a nearly 40-year-old problem, demonstrating that even seemingly impossible exhaustive searches can be achieved with deep enough search. The project used a 192-core CPU, took 5 days, and cost around $1200. While not using AI, it showcases the power of classic algorithms and data structures, and the role of cloud computing in tackling computationally intensive problems.
Game
computational proof