References
- [Aniley 77]. S. Ainley. Mathematical puzzles. Upper Saddle River, NJ: Prentice Hall, 1977.
- [Basu et al. 06]. S. Basu, R. Pollack, and M.-F. Roy. Algorithms in Real Algebraic Geometry, second edition, Algorithms and Computation in Mathematics, 10. Berlin: Springer-Verlag, 2006.
- [Bosch 99]. R. Bosch. “Peaceably Coexisting Armies of Queens.” Optima (Newsletter of the Mathematical Programming Society) 62:6–9 (1999), 271.
- [Brown 01]. C. W. Brown. “Simple CAD Construction and Its Applications.” J. Symb. Comput. 31:5 (2001), 521–547.
- [Caviness and Johnson 98]. B. Caviness and J. Johnson (Eds.). Quantifier Elimination and Cylindrical Algebraic Decomposition. New York: Springer-Verlag, 1998.
- [Jubin 15]. B. Jubin. “Improved Lower Bound for A250000.” Available online (https://oeis.org/A250000/a250000_1.txt).
- [Knuth 15]. D. E. Knuth. “Satisfiability, Fascicle 6.” In Art of Computer Programming, vol. 4. Addison-Wesley, Boston, 2015.
- [Sloane 18]. N. J. A. Sloane. “The On-Line Encyclopedia of Integer Sequences.” Notices Amer. Math. Soc. 65:9 (2018), 1062–1074.
- [Sloane 19]. N. J. A. Sloane. Peaceable Queens - Numberphile video, available from https://www.youtube.com/watch?v=IN1fPtY9jYg, 2019.
- [Sloane 64]. N. J. A. Sloane. “The On-Line Encyclopedia of Integer Sequences.” Available online (https://oeis.org/), 1964.