Get Math Help

GET TUTORING NEAR ME!

By submitting the following form, you agree to Club Z!'s Terms of Use and Privacy Policy

    Queens Problem

    Statement

    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.

    Solution

    piecewise | n - 1 | n = 2 ∨ n = 3
n | (otherwise)

    History

    status | proved

    Find the right fit or it’s free.

    We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.