Definition: backtracking algorithm

A formula for solving combinatorial problems such as finding the most efficient airline or delivery route as well as solving crossword puzzles, Sudoku and similar games. The backtracking process abandons each incomplete sequence as soon as it determines that the outcome of continuing this particular logic will not achieve the desired results.