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

The problem first appeared in 1869. When you purchase through links on our site, we may earn an affiliate commission. Here’s how it works. A chess problem that has stumped mathematicians for more than ...

Chess aficionados know that the game is one of exponential complexity. The first three moves yield more than 9 million possible board positions and there are nearly 319 billion possible ways to play ...

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?