Developer builds AI for six browser games using just three classic algorithms

A developer built six small browser games — including 2048, tic-tac-toe, and sudoku — each equipped with an AI opponent or solver written in plain JavaScript with no external libraries. Three foundational algorithms power all the games: Minimax with alpha-beta pruning for adversarial games, Expectimax for chance-based games like 2048, and BFS pathfinding for shortest-path style games. The 2048 solver uses a heuristic that rewards corner placement of large tiles, empty cell count, and tile smoothness, with search depth adapting to board state. Performance was validated through a headless self-play harness running thousands of games, revealing the solver reaches the 2048 tile roughly 70% of the time and the 4096 tile about 30% of the time. The entire project ships as a static file that runs locally in the browser, requiring no server calls or external dependencies.