Interesting Question of the Day – 30 March 2015

What is the highest number of queens you could put on a chessboard such that none of them could attack another.  (So none of them shared a row, column, or diagonal.)

The first new player to comment with the correct answer wins a free drink at their next iQ Trivia show.

Tagged with: ,
4 comments on “Interesting Question of the Day – 30 March 2015
  1. Drew says:

    8 using Stienhaus’ formulas.
    You only need 5 howver to cover every square and also have no queen able to attack another.
    Vardi had a general solutions for the queens problem based on a nxn sized board.

  2. nathan frawley says: