This puzzle was first proposed in 1848 by a composer of chess puzzles called Max Bezzel and has since spawned much analysis and many variants. Simply phrased, it goes as follows:
“Can you place 8 queen’s on a standard (8×8) chessboard so that no two queen’s threaten each other?”
(Just in case, I’ll remind you a queen can move and attack any number of squares in a straight line – horizontally, vertically, or diagonally)
Here’s one example solution:
By all means have some fun trying to find extra solutions to this with pencil and paper or chessboard, however we do have computers (and SQL!) these days, so the real challenge is to try find ALL the possible solutions to this puzzle using T-SQL.
Enjoy 🙂
Got a problem or embarking on a SQL Server project and want some help and advice? I’m available for consulting – please get in touch or check out my services page to find out what I can do for you.