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?

Katie has a PhD in maths, specializing in the intersection of dynamical systems and number theory. She reports on topics from maths and history to society and animals. Katie has a PhD in maths, ...

A mathematician from Harvard University has (mostly) solved a 150-year-old Queen's gambit of sorts: the delightful n queens puzzle. In newly self-published research (meaning it has not yet been ...

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