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 ...

Editor’s Note: This post was originally published on Seattle 2.0, and imported to GeekWire as part of our acquisition of Seattle 2.0 and its archival content. For more background, see this post. By ...