Minmax

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.

Problems

• 1406. Stone Game III (Hard)

Reference

• https://www.geeksforgeeks.org/minimax-algorithm-in-game-theory-set-1-introduction/