On 8/7/07, <b class="gmail_sendername">Donald Bruce Stewart</b> &lt;<a href="mailto:dons@cse.unsw.edu.au">dons@cse.unsw.edu.au</a>&gt; wrote:<div><span class="gmail_quote"></span><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
<br>No idea. You could compile them all with -O2, run them on a set of<br>puzzles, and produce a table of results :-)</blockquote><div><br>Well I could, but I wont ;-)&nbsp; If you had to guess which one is fastest which one would you guess?&nbsp;
</div><br><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">I&#39;m a little surprised no one&#39;s tried a parallel solution yet, actually.<br>
We&#39;ve got an SMP runtime for a reason, people!<br></blockquote></div><br>Funny that you should mention that, this was actually one of the Topcoder marathon match contests for multithreading:<br><br><a href="http://www.topcoder.com/longcontest/?module=ViewProblemStatement&amp;compid=5624&amp;rd=9892">
http://www.topcoder.com/longcontest/?module=ViewProblemStatement&amp;compid=5624&amp;rd=9892</a><br><br>(you&#39;ll need to login to see the problem statement, but basically it&#39;s Sudoku, on a 16-core Xeon (I think))<br>
<br>