CSPLib
Problems
prob029
Results
029: Prime queen attacking problem
Specification
Data files
Results
References
Models
Cite
Json
Edit Page
For $n <= 4$, there are no solutions satisfying the constraints of type (1) and type (2).
For $5 <= n <= 8$, optimal solutions are known without any free primes.
Recently, Jacques Tramu has found optimal solutions for $9 <= n <= 10$.
For$ n >= 11$, no optimal solution (i.e. without free primes) exists.
This work is licensed under a Creative Commons Attribution 4.0 International License. This work is licensed under a Creative Commons Attribution 4.0 International License.