svtechie.com — Though instead of starting queen placement at predefined position (at 0,0 or at a corner), 1st queen placement in first row can be specified by user. An fun web page is created with CGI/PERL script where above algorithm can be seen in work. This program is iterative rule based algorithm. Implementation is mainly C.
May 8, 2006 View in Crawl 4
Closed AccountMay 8, 2006
I remember this from 200 level CS courses. When they talk about recursion vs. iteration and backtracking the 8 Queens, Knight's Tour, and Towers of Hanoi problems come up (In fact I think I still have the Java code for a recursive Knights tour program I wrote a while ago). There is plenty of source code from this floating around on the web. Judging by your profile you're devoted to self promotion.No Digg.
itsallgeektomeMay 8, 2006
Yeah, this is one of those that you see in brain teaser/chess books. Here's Wikipedia's take (with some solutions)<a class="user" href="http://en.wikipedia.org/wiki/Eight_queens_puzzle">http://en.wikipedia.org/wiki/Eight_queens_puzzle</a>And if you really want to mess with someone, give them an 8x8x8 chess board to look at. (Look in my profile if you want to see a shameless plug).
svtechieMay 8, 2006Submitter
Sometime problem can be simple enough that someone may feel that it is not worth to mention it but we should have consideration for people who are newbie or people from non-CS background. How can one draw the line that problem is not worth discussion?On separate note, isn't life all about self promotion?