Explicit solutions to the N-queens problem for all N
Explicit solutions to the N-queens problem for all N
复制标题
DOI：
10.1145/122319.122322
复制
发表时间：
1991-02
期刊：
影响因子：
--
通讯作者：
B. Bernhardsson
中科院分区：
文献类型：
--
作者：
B. Bernhardsson
Please try later.
The n-queens problem is often used as a benchmark problem for AI research and in combinatorial optimization. An example is the recent article [1] in this magazine that presented a polynomial time algorithm for finding a solution. Several CPU-hours were spent finding solutions for some n up to 500,000.