Which of the following search technique agents compete against each other?ans.iii) Bi-directional search algorithmiv) None the aboveii) Alpha-Beta pruning algorithmi) Min-max algorithm Previous Marked for Review Next

The search techniques in which agents compete against each other are:

ii) Alpha-Beta pruning algorithm i) Min-max algorithm

These algorithms are typically used in game theory and artificial intelligence for decision making, where two or more agents are in competition with each other. The Min-max algorithm is used in decision making and game theory to find the optimal move for a player, assuming that the other player is also playing optimally. It is widely used in two player turn-based games.

The Alpha-Beta pruning algorithm is an optimization technique for the Min-max algorithm. It reduces the computation time by a huge factor. This allows us to search much faster and even go into deeper levels in the game tree. It cuts off branches in the game tree which need not be searched because there already exists a better move available. It is called Alpha-Beta pruning because it passes 2 extra parameters in the minimax function, namely alpha and beta.