Solving the "N<=8 Queens" problem with CSP and Modula-2.
Michael E. GoldsbyPublished in: ACM SIGPLAN Notices (1987)
Keyphrases
- constraint satisfaction problems
- partial constraint satisfaction
- dynamic constraint satisfaction problems
- sat encodings
- constraint satisfaction
- backtracking algorithm
- artificial neural networks
- data sets
- constraint problems
- non binary
- solving constraint satisfaction problems
- distributed constraint satisfaction problems
- finite domain
- tree decomposition
- constraint propagation
- np complete
- simulated annealing
- state space
- learning algorithm