A complex benchmark for logic programming and deductive databases, or who can beat the N-queens?
Werner Kießling · ACM SIGMOD Record · 1992
The N-queens problem with its long history and inherent complexity is a challenging benchmark target. We present our solution and performance results, hoping that this will stimulate a sort of benchmark competition for tough problems.