A polynomial time algorithm for the N-Queens problem
ACM SIGART Bulletin
On a general framework for large-scale constraint-based optimization
ACM SIGART Bulletin
Efficient Local Search with Conflict Minimization: A Case Study of the n-Queens Problem
IEEE Transactions on Knowledge and Data Engineering
ACM SIGCSE Bulletin
An efficient non-probabilistic search algorithm for the N-queens problem
ACST'07 Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology
New decision rules for exact search in N-Queens
Journal of Global Optimization
Dynamic load balancing on non-homogeneous clusters
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
| Hi-index | 0.00 |
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.