Deep Dark Blue Mini Max
Think you've mastered Tic-Tac-Toe? Meet the 'Deep Dark Blue Mini Max' (DDBMM).
It's equipped with a Minimax algorithm and alpha-beta pruning optimization. It's also theoretically unbeatable in chess and Go if exponential computing time doesn't faze you (it should).
Check it out for a game and for more info about AI decision-making in competitive search scenarios: Deep Dark Blue Mini Max
Published on LinkedIn on March 16, 2024