92 ways to place 8 queens on a chessboard…

March 29, 2007 | General | By: Mark VandeWettering

such that no queen attacks any other queen. It’s a simple (really simple) program to write, but I can’t remember having done it. So I did it. And then I had to make a picture of one of the solutions.

8 queens on the chessboard

Technorati Tags: , , ,

Addendum: Wikipedia has a page on the puzzle, naturally. This kind of program would be a good one to test out Knuth’s “Dancing Links” idea. I might have to do that.

Addendum2: I swiped the chess font and methodology from this website, keeping with my long tradition of drawing stuff on my website using PostScript.

Addendum3: I made a different picture using the Adobe Cheq font:

8 Queens using Adobe Cheq font

Share Button
Be Sociable, Share!

Comments

Pingback from Solving problems using search « Notes on Artificial Intelligence
Time 6/2/2011 at 9:58 pm

[...] The eight queens – the goal of this problem is to arrange eight queens on a chess board in such a way that they cannot attack each other. Here is an example (thanks to http://brainwagon.org/2007/03/29/92-ways-to-place-8-queens-on-a-chessboard/): [...]

Write a comment






× four = 12