What specific type of game state evaluation in two-player games mitigates the horizon effect by continuing the search until all dynamic tactical capture moves subside?
Quiescence search expands non-quiet (tactically volatile) positions beyond the fixed depth limit—evaluating captures and checks—until a calm, quiet state is reached.
What is the effective time complexity of Alpha-Beta pruning when child moves are ordered perfectly (best moves examined first)?
With perfect move ordering, alpha-beta pruning doubles the searchable search depth within the same time budget, dropping time complexity from $O(b^d)$ to $O(b^(d/2))$.
Which game-playing AI developed by IBM defeated World Chess Champion Garry Kasparov in 1997?
IBM Deep Blue defeated Garry Kasparov in 1997. Since Deep Blue is not listed among choices (A), (B), or (C), (E) is the correct answer.
Which AI program developed by DeepMind defeated 18-time world Go champion Lee Sedol in 2016 using Monte Carlo Tree Search (MCTS) and deep reinforcement learning?
AlphaGo combined deep convolutional neural policy/value networks with Monte Carlo Tree Search to master the game of Go.
What are the four core phases executed in each iteration of Monte Carlo Tree Search (MCTS)?
The four phases of MCTS are Selection, Expansion, Simulation, and Backpropagation. Both (A) and (B) describe these phases.