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. &nbsp; It said to &nbsp; <big> ''Solve the eight queens puzzle'', </big> &nbsp; and once solved, stopped looking for more solutions. &nbsp; I didn't see any point in providing multiple answers. &nbsp; Of the &nbsp; '''92''' &nbsp; solutions on an &nbsp; '''8x8''' &nbsp; board, &nbsp; '''12''' &nbsp; are fundamental solutions --- and just sifting (choosing which ones to display) those out (I thought) isn't part of the task's requirement. &nbsp; ··· And if the answers are an ASCII art depiction of the chessboard, the amount of output would be greatly compounded. &nbsp; -- [[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 thughtthought it would be much faster to calculate diagonals in advance. It did not help at all. I should have profiled before changing the code.
 
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)
23

edits