Can I read Min-Max Algorithm in AI: Overview & Complexity on EtoBox?

Min-Max Algorithm in AI: Overview & Complexity by CED18I054 V S PRAVEEN is a document available to read on EtoBox.

What is Min-Max Algorithm in AI: Overview & Complexity about?

The mini-max algorithm is a recursive algorithm used in decision making and game theory. It uses a depth-first search to explore the game tree, with one player trying to maximize score and the other minimize it. The algorithm recursively traverses the tree to the terminal nodes, then backtracks to assign values at earlier nodes based on the terminal values. It runs in O(bm) time and space, where b is the branching factor and m is the maximum depth, and finds an optimal solution if both players play optimall

Author

CED18I054 V S PRAVEEN

Language

EN