Divide and conquer under global constraints: A solution to the N-queens problem
- 1 June 1989
- journal article
- Published by Elsevier BV in Journal of Parallel and Distributed Computing
- Vol. 6 (3), 649-662
- https://doi.org/10.1016/0743-7315(89)90011-7
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- DIB—a distributed implementation of backtrackingACM Transactions on Programming Languages and Systems, 1987
- A sufficient condition for backtrack-bounded searchJournal of the ACM, 1985
- Divide-and-Conquer for Parallel ProcessingIEEE Transactions on Computers, 1983
- Latin squares and superqueensJournal of Combinatorial Theory, Series A, 1983
- Increasing tree search efficiency for constraint satisfaction problemsArtificial Intelligence, 1980
- Estimating the Efficiency of Backtrack ProgramsMathematics of Computation, 1975
- Independent permutations, as related to a problem of Moser and a theorem of PólyaJournal of Combinatorial Theory, Series A, 1974
- Program development by stepwise refinementCommunications of the ACM, 1971
- Nondeterministic AlgorithmsJournal of the ACM, 1967