About this document
Minimax Algorithm Analysis by Rakesh Kashyap is a document available to read on EtoBox.
The document describes how a variation of the minimax algorithm would work if both players tried to make the move that is worst for them according to the static evaluation function. In this scenario, player 2 would make the losing move to position F with a score of -5 in position B, then player 1 would make the losing move to position I with a score of -4 in position C, and then player 2 would make the losing move to position K with a score of -6 in position D, resulting in the game proceeding along the pat
- Author
- Rakesh Kashyap
- Language
- EN