Min Max Algorithm
Minmax algorithm is optimal against a minmax opponent for a perfect information game, but can occasionally make poor decisions against other types of opponent. (MCTS for games with Hidden Information and Uncertainty pg. 77)
Minmax algorithm is optimal against a minmax opponent for a perfect information game, but can occasionally make poor decisions against other types of opponent. (MCTS for games with Hidden Information and Uncertainty pg. 77)