There is a technique by which without checking each node of the game tree we can compute the correct minimax decision, and this technique is called?a.alpha-beta pruningb.minimax algorithmc.pruningd.Alpha-Beta Algorithm
Question
There is a technique by which without checking each node of the game tree we can compute the correct minimax decision, and this technique is called?a.alpha-beta pruningb.minimax algorithmc.pruningd.Alpha-Beta Algorithm
Solution
The technique by which we can compute the correct minimax decision without checking each node of the game tree is called alpha-beta pruning.
Similar Questions
Alpha-Beta pruning can change the final decision made by the Minimax algorithm.
General algorithm applied on game tree for making decision of win/lose is
Which algorithm is used in the Game tree to make decisions of Win/Lose?Heuristic Search AlgorithmMin/Max algorithmGreedy Search AlgorithmDFS/BFS algorithm
Alpha-beta pruning is a modified version of the?a.maximax algorithmb.minimax algorithmc.minimin algorithmd.maximin algorithm
General algorithm applied on game tree for making decision of win/lose is ____________a.DFS/BFS Search Algorithmsb.Heuristic Search Algorithmsc.Greedy Search Algorithmsd.MIN/MAX Algorithms
Upgrade your grade with Knowee
Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.