Let's test your knowledge. Fill in the missing part by typing it in.

The backtracking algorithm is a powerful technique for solving problems by exhaustively searching through all possible solutions. It follows a __ search approach and tries out different choices at each step, backtracking when it reaches a dead end. With backtracking, we can efficiently solve combinatorial problems like the word search puzzle.