Talk:Best shuffle: Difference between revisions
→Task Description: Distant from original solution
(→Task Description: Distant from original solution) |
|||
Line 10:
I recently compiled and ran the D codes that had replaced my own version and noticed that they produced the same result every time. This isn't what I had in mind when I used the word "shuffle". I'm assuming that the other "deterministic" codes have the same limitation. It isn't a problem as far as I'm concerned. It's still interesting and educational to see this approach. Nevertheless I'm putting back my own code because it produces the result that I was looking for.[[User:Fwend|Fwend]] 09:39, 15 May 2011 (UTC)
: If I read the task description correctly, the task is actually looking for an "an organization as distant from the original organization as possible". The result is probably provable to that end. If the non-deterministic code doesn't result in an optimum solution, it's probably incorrect. I may be wrong, though. --[[User:Short Circuit|Michael Mol]] 10:49, 15 May 2011 (UTC)
== J implementation notes ==
| |||