#game-search

Question 1: Single choice

Alpha-beta search normally explores a game tree depth-first down to a fixed depth and applies a static evaluator there. Which statement is correct?

It returns the correct minimax value only if it searches down to the end of the game1
It can be run breadth-first, level by level, with the same pruning and the same result2
With progressive deepening most of the time goes into repeating the shallow searches3
Progressive deepening works and returns the minimax value for each depth4