a) Alpha = max b) Beta = min c) Beta = max d) Both Alpha = max & Beta ...
View QuestionWhich search is similar to minimax search?
a) Hill-climbing search b) Depth-first search c) Breadth-first search d) All of the mentioned Answer: ...
View QuestionTo which depth does the alpha-beta pruning can be applied?
a) 10 states b) 8 States c) 6 States d) Any depth Answer: d Explanation: Alpha–beta ...
View QuestionWhich values are independant in minimax search algorithm?
a) Pruned leaves x and y b) Every states are dependant c) Root is independant d) ...
View QuestionWhich search is equal to minimax search but eliminates the branches that can’t influence the final decision?
a) Depth-first search b) Breadth-first search c) Alpha-beta pruning d) None of the ...
View QuestionWhat is the complexity of minimax algorithm?
a) Same as of DFS b) Space – bm and time – bm c) Time – bm and space ...
View QuestionThe minimax algorithm computes the minimax decision from the current state. It uses a simple recursive computation of the minimax values of each successor state, directly implementing the defining equations. The recursion proceeds all the way down to the leaves of the tree, and then the minimax values are backed up through the tree as the recursion unwinds.
a) true b) false Answer: a Explanation: true
View QuestionGeneral algorithm applied on game tree for making decision of win/lose is ____________
a) DFS/BFS Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) MIN/MAX Algorithms
View QuestionThe initial state and the legal moves for each side define the __________ for the game.
a) Search Tree b) Game Tree c) State Space Search d) Forest Answer: b Explanation: ...
View QuestionA game can be formally defined as a kind of search problem with the following components.
a) Initial State b) Successor Function c) Terminal Test d) All of the mentioned Answer: d Explanation: ...
View Question