C. Clay
Abstract
This paper proposes a new solution to the problem of how many queens cover one chessboard. For the purposes of this paper, a Staunton style chess queen is assumed, and not the ruler of any country. This algorithm is implemented in Pidgin Algol (1), which will be demonstrated to support concurrency.
- 1. Aho, Hopcroft, Ullman, "The Design and Analysis of Computer Programs", Addison-Wesley, 1974, p. 34-8. Google Scholar
Digital Library
- 2. Lasker, Edward, "GO and GO-MOKU", Dover, 1960.Google Scholar
Index Terms
- A new solution to the N <= 8 queens problem
Recommendations
A linear solution to the n-Queens problem using vector spaces
This paper presents an approach to solving the n-Queens Problem using vector spaces. Although the situations in which this approach can be used are limited, it shows promise for wider generalization, or as an intermediate step that yields a partial ...
Different perspectives of the N-Queens problem
CSC '92: Proceedings of the 1992 ACM annual conference on CommunicationsThe 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-...
N queens problem: a metaprogramming stress test for the compiler
WGP '13: Proceedings of the 9th ACM SIGPLAN workshop on Generic programmingA metaprogram solving N queens problem is written using Boost MPL library. The solution is tested using different compilers to examine the level of their practical use for complex metaprogramming tasks. The corresponding benchmark results were obtained.
...
Comments