KöMaL 2005 B3862
In how many different ways is it possible to place 32 knights on a 8×8 chessboard, such that no pair of them should attack each other?
Official text KöMaL. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.