Related articles:
Algorithm
Eight queens puzzle
Depth-first search
Prolog
The Art of Computer Programming
Key terms:
solution
return
bt
should
backtracking
reject
true
problem
root
node
procedure
algorithm
variable
false
check
depend
completed
cannot
partial candidate
function
accept
search tree
valid solution
extension
finding
queens
output
instance
wedge
constraint
recursion
integers
assume
define
choice point
should return
assigned
efficient
parameter
each node
otherwise
time stamp
backtracking algorithm
then return
variable trail
potential search tree
computer science
possibly be completed
completed to a valid solution
constraint satisfaction
Search external links cited by footnotes on Wikipedia page Backtracking:
|
|