1992 · 46 citations · 17 references
ComputingComputer ScienceMathematicsAlgorithmsCombinatoricsTheory Of ComputationCombinatorial OptimizationComputational ComplexityCombinatorial SearchEnumerative AlgorithmsFundamental SolutionsN-queens Problem
The N-Queens problem is a commonly used example in computer science. There are numerous approaches proposed to solve the problem. We introduce several definitions of the problem, and review some of the algorithms. We classify the algorithms for the N-Queens problem into 3 categories. The fmt category cnmpriaca the algorithms generating all the solutions for a given N. The algorithms in the second category are designed to generate otdy the fundamental solutions The algorithms in the last category generate only one or several solutions but not necessarily all of them.
17
Dominic Welsh · Bulletin of the London Mathematical Society · 1974 · 1.1K citations
Program development by stepwise refinement
Niklaus Wirth · Communications of the ACM · 1983 · 690 citations · Full text
Computing, Computer Science, Building Information Modeling +5
Solomon W. Golomb, L. D. Baumert · Journal of the ACM · 1965 · 485 citations · Full text
Algorithmics: theory and practice
Choice Reviews Online · 1989 · 187 citations