O'Reilly logo

Introduction to Recursive Programming by Manuel Rubio-Sanchez

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

CHAPTER 12

Multiple Recursion III: Backtracking

He who would search for pearls must dive below.

—John Dryden

BACKTRACKING is one of the most important algorithm design paradigms. It can be regarded as an “intelligent” brute-forceAlgorithm!brute-force strategy that performs exhaustive searchesExhaustive search for solutions to constraint satisfactionConstraint satisfaction problem and discrete optimization problemsOptimization problem. The approach can be used to solve numerous puzzles and problems, including the eight-queens problem, finding paths through mazes, the sudoku puzzle, the 0-1 knapsack optimization problem, and many more.

Backtracking methods generally combine recursion and iteration, contain several parameters, and are not usually ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required