Archive for June 24, 2009

N-Queens in a Tweet

Most people who like puzzles or study computer science have probably encountered the famous N-Queens problem. If you haven’t, before reading any further, try this online version of the most popular form, the 8-Queens problem.
The 8-Queens problem is to find positions on a chess board for eight queen chess pieces so that none of them [...]