|
Related articles:
Eight queens puzzle
Depth-first search
Constraint satisfaction problem
Algorithm
Verbal arithmetic
Parsing
The Art of Computer Programming
Prolog
Key terms: c p candidate backtracking solution return tree procedure problem should reject search algorithm variable next search tree complete true root function node extension false depend backtracking algorithm constraint accept check instance potential call queens bt cannot should return whether value recursion integers output wedge programming then return assigned efficient parameter each node extended timestamp constraint satisfaction assume length define otherwise Search external links cited by footnotes on Wikipedia page Backtracking: |
|