Minimax Algorithm in Game Theory | Set 1 (Introduction)
https://www.geeksforgeeks.org/minimax-algorithm-in-game-theory-set-1-introduction/
WebLast Updated : 13 Jun, 2022. Minimax is a kind of backtracking algorithm that is used in decision making and game theory to find the optimal move for a player, assuming that your opponent also plays optimally. It is widely used in two player turn-based games such as Tic-Tac-Toe, Backgammon, Mancala, Chess, etc.
DA: 93 PA: 15 MOZ Rank: 88 Up or Down: Up