Minimax algorithm is a basic adversarial decision-making algorithm. It is usually used in two-player games based on turns, and it aims to find the optimal next move. The assumption is the opponent’s playing rationally and trying to win the computer. A basic example is a chess play when a computer tries to choose good moves with the assumption “that a suitable static evaluation function is available, which is able to give an overall score to a given position.” Minimax’s main drawback is its slowness in complex games, but it can be enhanced by alpha-beta pruning.
Explain minimax search. Use examples.
Answer by Academic.tip's expert
An answer to this question is provided by one of our experts who specializes in technology & it. Let us know how much you liked it and give it a rating.
Cite this page
Select a citation style:
References
Academic.Tips. (2021) 'Explain minimax search. Use examples'. 30 September.
Reference
Academic.Tips. (2021, September 30). Explain minimax search. Use examples. https://academic.tips/question/explain-minimax-search-use-examples/
References
Academic.Tips. 2021. "Explain minimax search. Use examples." September 30, 2021. https://academic.tips/question/explain-minimax-search-use-examples/.
1. Academic.Tips. "Explain minimax search. Use examples." September 30, 2021. https://academic.tips/question/explain-minimax-search-use-examples/.
Bibliography
Academic.Tips. "Explain minimax search. Use examples." September 30, 2021. https://academic.tips/question/explain-minimax-search-use-examples/.
Work Cited
"Explain minimax search. Use examples." Academic.Tips, 30 Sept. 2021, academic.tips/question/explain-minimax-search-use-examples/.
Copy