The web content discusses various chessboard non-attacking problems, including the n-rooks problem, n-bishops problem, n-queens problem, n-kings problem, and n-knights problem. The author provides mathematical models and explanations for each of these problems, highlighting the optimization objectives, constraints, and possible solutions. The content also mentions the use of solvers like Cplex for finding all possible configurations. Notably, it is mentioned that the number of different solutions for the n-queens problem is 92, but a tolerance issue may cause one solution to be missed. The content concludes with a discussion on the use of solution pools and the potential issues with default tolerances.
http://yetanothermathprogrammingconsultant.blogspot.com/2018/11/chess-and-solution-pool.html