The set of all possible sequences of moves in a chess game can be represented by a tree (decision tree). If you were to write a chess-playing computer program that can determine the best move at each step by searching the tree of possible moves and outcomes, would you use a depth-first or a breadth-first search for the best move at each step in the game? Explain.