Minimax

• The standard algorithm for adversarial search is called minimax.
• The idea is that one player is minimizing, and the other maximizing, thus minimax.
• So, the algorithm assumes that the opposition will make the best move (as you calculate it) for themselves.
• The plys alternate between minimizing and maximizing.
• The maximizing player selects the option that maximizes.
• The minimizing player selects the option the minimizes.
• If you expand to the end, you know the result, as in tic tac toe..
• You then pass the values up.
• If the last move can win, it will, let's say maximizing.
• However, if the move before leads to two options, draw or lose, the minimizing player will choose the draw option.
•