Talk:N-queens problem: Difference between revisions
→Pari/GP: new section
(→Pari/GP: new section) |
|||
(3 intermediate revisions by 2 users not shown) | |||
Line 1:
== Tcl: All Solutions ==▼
Is the goal to find one solution, or all solutions? --[[Special:Contributions/164.67.235.98|164.67.235.98]] 19:59, 12 September 2009 (UTC)
▲== Tcl: All Solutions ==
: 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 ==
Line 58 ⟶ 60:
== What about profiling? ==
When doing the Erlang version I
Is there a task on Rosettacode that looks at profiling? Similar to [[Time_a_function]], but for several functions in a task. [[User:bengt]] Sat Dec 7 13:23:33 CET 2013
== Pari/GP ==
I am not known for my compact code, but I have a script in Pari/GP. Not optimized to any extent. Just contact me.--[[User:Billymacc|Billymacc]] ([[User talk:Billymacc|talk]]) 12:42, 14 October 2017 (UTC)
|