By submitting the following form, you agree to Club Z!'s Terms of Use and Privacy Policy
The queens problem asks for the maximum number of queens that can be placed on an n × n chessboard such that no two attack one another.
piecewise | n - 1 | n = 2 ∨ n = 3 n | (otherwise)
status | proved
mathematical problems | solved mathematics problems
Back to List | POWERED BY THE WOLFRAM LANGUAGE