Anonymous user
Talk:N-queens problem: Difference between revisions
→Tcl: All Solutions: added a comment.
m (moved the 1st query into the mainline body of the talk section so that the table of contents now appears at the top of all text.) |
(→Tcl: All Solutions: added a comment.) |
||
Line 3:
: I've put up code to find all solutions; finding just one is a trivial adaptation of that (stop iterating after the first solution is found...) —[[User:Dkf|Donal Fellows]] 20:37, 12 September 2009 (UTC)
:: I read the task's requirements differently. It said to <big> ''Solve the eight queens puzzle'', </big> and once solved, stopped looking for more solutions. I didn't see any point in providing multiple answers. Of the '''92''' solutions on an '''8x8''' board, '''12''' are fundamental solutions --- and just sifting (choosing which ones to display) those out (I thought) isn't part of the task's requirement. ··· And if the answers are an ASCII art depiction of the chessboard, the amount of output would be greatly compounded. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 21:57, 6 May 2016 (UTC)
== Python permission ==
| |||