Backtracking is a problem-solving approach where a solution is built incrementally, and if at any point the solution cannot be extended, the algorithm backtracks and tries other possibilities. The Knight's tour problem is a classic example of backtracking.
Thus, the correct answer is \( \text{Knight's tour} \).