(adsbygoogle = window.adsbygoogle || []).push({}); Can anyone explain the minimax algorithm please. I understand the game tree, but do not get how that can be used to select values for different moves by the AI. Particularly TicTacToe.
Thanks.

Also, what other games beside tic tac toe can minimax be used for.

Read about the heuristic score calculation here: You must login or register to view this content.
That's a good explanation with a code example, and the min-max algorithm can be used in any 1v1 game like checkers and chess. Read about it on stanford's page as well.