# GeekDad Puzzle of the Week – Eight Queens

Growing up playing chess with my Dad, it has been my honor and privilege to teach Max and Nora to play chess. Yes, I can still beat them both… for now at least.

When showing him how each piece moves, I challenged Max to a puzzle that I remember from both my Dad teaching me, as well as a high-school level computer science book.

The puzzle is simple, and is the core for this week’s GeekDad Puzzle of the Week:

Given that you have eight queens pieces, each of which can traverse the whole chessboard in the vertical, horizontal, and both diagonal directions, is it possible to place all eight on a standard 8×8 chessboard such that no queen can immediately capture another? If so, is there just one way, or are there multiple ways? And if there are indeed multiple ways, how many are truly distinct – and not simple rotations, reflections, or inversions of another solution?

For example, on a 5×5 chessboard, here are two solutions:

On each board, any given queen is in its own row and column, and no two queens share the same of the nine diagonals in either direction.

While the two solutions above appear different, further examination will lead you to the second being a translation or interpretation of the first. Specifically, the second board is simply the first rotated through 180° and then reflected across the upper-left to lower-right diagonal. These two would not be considered as “distinct” solutions for the purposes of this puzzle, as one can be flipped, rotated, or inverted to become the other.

As you do each week, please submit your responses (“yes, it can be done / there are n distinct solutions and here they are”, “no, it can’t be done,” etc.) to GeekDad Central. All reasonably correct, mature, or at least thought out solutions will be eligible for entry into a random drawing a \$50 Gift Certificate from the fine folks at ThinkGeek, purveyor of stuff for smart masses like yourself.

Good luck, and happy puzzling!