Mathematician Answers Chess Problem About Attacking Queens
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. The post Mathematician Answers Chess Problem About Attacking Queens first appeared on Quanta Magazine
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? A third? How many are there? This challenge is over 150 years old. It is the earliest version of a mathematical question called the n-queens problem whose solution Michael Simkin...
Originally published in Quanta Abstractions.
