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.

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.

😀

I love the wonderfully elaborate answers.

8

Yep. And there will be another chess related question coming up another day.