hmmm, I'll need some more time to verify that answer.<div>/s<br><br><div class="gmail_quote">On 31 August 2011 13:14, Andre Renaud <span dir="ltr"><<a href="mailto:andre@bluewatersys.com">andre@bluewatersys.com</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">I've got 73712 for 13 queens, but it takes a noticeable amount of time.<br>
This is single threaded.<br>
<br>
andre@dunstan:~/tmp/queens$ gcc -o queens3 queens_single.c -O3 -g -Wall<br>
-pipe -lm && time ./queens3<br>
13 queens = 73712 solutions<br>
<br>
real 5m56.986s<br>
user 3m57.079s<br>
sys 0m0.508s<br>
<br>
<br>
Regards,<br>
<font color="#888888">Andre<br>
</font><div class="im"><br>
<br>
On 31/08/11 12:46, Synco Reynders wrote:<br>
> Hi All,<br>
> Now I'm willing to put up a chocolate fish for the person who can tell<br>
> how many solutions there are for the largest n.<br>
> I include all rotations / mirrored results. So for example:<br>
> For n=4 there are 2 solutions<br>
> For n=5 there are 10 solutions<br>
> For n=6 there are 4 solutions<br>
> For n=7 there are 40 solutions<br>
> ...<br>
> For n=10 there are 724 solutions<br>
> ...<br>
> Good-luck,<br>
> /s<br>
<br>
</div><div><div></div><div class="h5">_______________________________________________<br>
Chchrobotics mailing list <a href="mailto:Chchrobotics@lists.linuxnut.co.nz">Chchrobotics@lists.linuxnut.co.nz</a><br>
<a href="http://lists.ourshack.com/mailman/listinfo/chchrobotics" target="_blank">http://lists.ourshack.com/mailman/listinfo/chchrobotics</a><br>
Mail Archives: <a href="http://lists.ourshack.com/pipermail/chchrobotics/" target="_blank">http://lists.ourshack.com/pipermail/chchrobotics/</a><br>
Web site: <a href="http://kiwibots.org" target="_blank">http://kiwibots.org</a><br>
Meetings 3rd Monday each month at Tait Radio Communications, 175 Roydvale Ave, 6.30pm<br>
<br>
When replying, please edit your Subject line to reflect new content.<br>
</div></div></blockquote></div><br></div>