[amp_mcq option1=”Depth-first search” option2=”Breadth-first search” option3=”Alpha-beta pruning” option4=”None of the mentioned” correct=”option3″]
The correct answer is C. Alpha-beta pruning.
Alpha-beta pruning is a search algorithm that is used to find the best move in a game tree. It is a more efficient version of minimax search, which is a recursive algorithm that searches all possible moves in a game tree. Alpha-beta pruning eliminates branches that cannot influence the final decision, which makes it faster than minimax search.
Depth-first search is a search algorithm that explores all possible paths in a tree before moving on to the next level. It is not as efficient as alpha-beta pruning, because it explores many paths that will not lead to the best move.
Breadth-first search is a search algorithm that explores all possible paths in a tree level by level. It is more efficient than depth-first search, but it is not as efficient as alpha-beta pruning.
None of the mentioned is not a correct answer.