If you have a few chess sets at home, try the following exercise: Arrange eight queens on a board so that none of them are attacking each other. If you succeed once, can you find a second arrangement?

The n-queens problem is about finding how many different ways queens can be placed on a chessboard so that none attack each other. A mathematician has now all but solved it. If you have a few chess ...

Add Yahoo as a preferred source to see more of our stories on Google. A 50-page proof shows the new estimated answer to the n queens problem. A chess board is a matrix, so it involves an entire field ...

The queen is the most powerful piece on the chessboard. Unlike any other (including the king), it can move any number of squares vertically, horizontally, or diagonally. Now consider this queen's ...