Talk:Eight queens puzzle solutions

From Wikipedia, the free encyclopedia

This article is within the scope of WikiProject Chess, a collaborative effort to improve Wikipedia's coverage of chess. For more information, visit the project page, where you can join the project and/or contribute to the discussion.
Chess Portal
Start This article has been rated as Start-Class on the quality scale.
Low This article has been rated as Low-Importance on the importance scale.

The content on this page was moved from the main eight queens puzzle page. The proliferation of solutions was escalating into a war that dwarfed the article content. I agree that it might not be appropriate to have in WP at all, but if no specific page is devoted to these algorithms, I'm sure people will just add them to the main eight queens puzzle page.

Nestify (talk) 20:26, 18 November 2007 (UTC)

Maybe it is best to keep them in a separate article then. I'm going to withdraw the PROD. Make sure there's a section and a link in the main article, though. Ioeth (talk contribs friendly) 20:33, 18 November 2007 (UTC)
You beat me to it Ioeth. I was about to remove my prod2. Read through the links on the eight queens puzzle, and the code is in the public domain.ARendedWinter 20:50, 18 November 2007 (UTC)

Cbensf (talk) 03:02, 9 December 2007 (UTC) The algorithms are bad examples!

  • BFS solutions should be replaced with DFS. Since the search tree has constant depth of 8, BFS offer absolutely no benefits and requires more memory, as well as being slightly harder to understand than simple DFS recursion.
  • I will rewrite the Python one if there are no objections. Someone else will have to help with the Ruby.
  • The C brute-force solution is very unreadable - no comments, while loops instead of for, cryptic function names.
  • It should be either removed or rewritten in a high-level language. Is there any value at all in showing such an inefficient algorithm?
  • The C++ solution is actually plain simple C. And it's DFS.
  • The solutions should be grouped by algorithm, not language.