Search A Search problem consists of: A state space A successor function(with actions, costs) A start state and a goal state A solution is a sequence of actions(plan) which transforms the start state to a goal state minimax search(adversarial search algorithm) with alpha and beta pruning