Minimax Algorithm Time Complexity
Minimax Algorithm Time Complexity . Refer definition of minimax algorithm. Bestval = +infinity for each move in board : Jrtechs CSCI 331 Review 1 from jrtechs.net Let t (n) = time required to apply the algorithm on an array of size n. To curb this situation, there are a few optimizations that can be added to the algorithm. The time complexity for such an order is o(b m).