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.
About
Stats
|
created |
4 years ago |
|
viewed |
2 times |
|
editors |
1 |
Top Answerers
more »
Recent Hot Answers
Is it normal for a chess engine to blunder material if its evaluation is only based on naive material evaluation?Is it normal for a chess engine to blunder material if its evaluation is only based on naive material evaluation?
How can minimax chess engines do alpha-beta pruning without reaching the final positions?
My Transposition Tables implementation slows down Alpha Beta Pruning
Why is my chess engine that uses minimax with alpha-beta pruning so slow, even at depth 3?
more »