Talk:Eight queens puzzle

How about some attribution or reference for the simple algorithm? When was it discovered? Given the number of published algorithms using various kinds of search even for finding single solutions, it would seem that this has to be a fairly recent discovery? Or?

Recent? Not really. The first proof of a simple algorithm for producing a solution to the n-queens problem for every n>=4 can be found here: Wilhelm Ahrens. Mathematische Unterhaltungen und Spiele. B.G. Teubner, 1910.

A proof in English can be found here: E.J. Hoffman, J.C. Loessi and R.C. Moore. Constructions for the Solution of the m Queens Problem. National Mathematics Magazine, March-April:66-72, 1969.

PittBill 13:28, 20 Apr 2005 (UTC)

I don't think any of those are on the Internet, so I can't check whether any of the published algorithms are simpler to follow or remember than the one in the article. If so, can you please replace the one in the article and give the source. If not, please leave it be. — 131.230.133.185 08:31, 13 Jun 2005 (UTC)

---

Who is Paul Muljadi? From a quick Google search, I gather that he is a Chess buff & possibly one of the top players, but seeing how his name is mentioned in a couple of Wikipedia articles & he provides no personal information on his website (or even a clear way to navigate it), it would be nice to provide an article with a few sentences about him. -- llywrch 15:25, 24 Apr 2004 (UTC)

I don't know who he is, but I know he's not a top player - he doesn't have a FIDE rating at all. I've never heard of him, myself. --Camembert

I was being polite by saying "possibly one of the top players": I'd rather be corrected for thinking he was one, than being corrected for thinking that he was not one. For the record, I might be able to name a dozen famous chess players, but only if I could include Philip Marlowe. -- llywrch 22:59, 24 Apr 2004 (UTC)

I came independently to the conlcusion that he was nobody in particular, that the "discoveries" described in the article were not mathematically interesting, and that he had probably placed them there himself out of vanity. I removed them, then saw this discussion on the talk page. -- Dominus 15:17, 25 Aug 2004 (UTC)

The Integer Sequences link at the bottom of the article goes to Paul Muljadi's webpage, which announces his "discoveries". The reason I haven't removed the link is that Paul's page does list the fundamental solutions to the eight queens problem. PittBill 14:31, 28 Aug 2004 (UTC)

---

It seems that almost the same web page exist, here is the link: http://www.informationclub.com/encyclopedia/e/ei/eight_queens_puzzle.html

Also say:

Copyright ©2003 InformationClub.com
This content from encyclopedia is licensed under the GNU Free Documentation License 

--andrejj 18:55, 15 Aug 2004 (UTC)

I believe the InformationClub is copying their pages verbatim from the Wikipedia. Other entities have similar copies, such as http://www.wordiq.com and http://www.fact-index.com PittBill 23:08, 15 Aug 2004 (UTC)

---

In general, the number of possible solutions of placing N queens on a N by N board, considering the symmetries as distinct solutions, is:

And then the formula is not given, only the values. -- WhiteDragon 06:26, 10 Feb 2005 (UTC)

That's because the formula is unknown. See [1] (http://www.research.att.com/projects/OEIS?Anum=A000170) for more information on the numbers of possible solutions. PittBill 10:43, 10 Feb 2005 (UTC)

I do see WhiteDragon's point, and have removed the In general since the table only gives values for specific N's, not a general formula. PittBill 23:47, 12 Feb 2005 (UTC)

---

What is CLP(FD)? PittBill 01:23, 6 Jun 2005 (UTC)

Constraint logic programming over finite domains (http://www.google.com./search?btnI&q=CLP+FD). Fixed in article. — 131.230.133.185 08:31, 13 Jun 2005 (UTC)