Which of the following statements are true? (A) Minimax search is…

Answer: The true statements are the one about alpha-beta pruning depending on move ordering and the one stating that alpha-beta yields the same optimal moves as minimax.

• Statement that minimax search is breadth-first (processes all nodes at a level before moving deeper): False. Minimax is typically implemented with a depth-first recursive search that explores down to terminal or evaluation depth rather than exploring level by level.

• Statement that the effectiveness of alpha-beta pruning is highly dependent on the order in which states are examined: True. Good move ordering (examining best moves first) produces much more pruning and reduces the number of nodes expanded.

• Statement that the alpha-beta search algorithm computes the same optimal moves as the minimax algorithm: True. Alpha-beta is an optimization that prunes branches without changing the minimax values, so it yields the same optimal moves as a full minimax search.

• Statement that optimal play in games of imperfect information does not require reasoning about the current and future belief states of each player: False. In imperfect-information games (for example, card games), optimal play generally requires maintaining and reasoning about belief distributions over hidden information and how those beliefs evolve.

Therefore, the correct choice is the answer that selects the two true statements: the dependence of alpha-beta on move ordering and the equivalence of alpha-beta with minimax in terms of optimal moves.