Backtracking's a general algorithm for finding all (or some) solutions to some computational problem, that incrementally builds candidates to the solutions, and abandons each partial candidate c ("backtracks") as soon as it determines that c can't possibly be completed to a valid solution . The classic textbook example of the use of backtracking's the eight queens puzzle, that asks for all arrangements of eight queens on a standard chessboard so that no queen attacks any other. In the common bac… (More on Backtracking)