Author: Albert Bertilsson
Date: 03:11:59 04/10/03
Go up one level in this thread
On April 09, 2003 at 23:56:54, Russell Reagan wrote:
>So...who wants to explain how this works? I don't know how it works, but it
>finds all of the solutions to the 8 queens problem.
>
>#include <stdio.h>
>int v,i,j,k,l,s,a[99];
>void main(void){
>for(s=8;*a-s;v=a[j*=v]-a[i],k=i<s,j+=(v=j<s&&(!k&&!!printf(2+"\n\n%c"-(!l<<!j),"
>#Q"[l^v?(l^j)&1:2])&&++l||a[i]<s&&v&&v-i+j&&v+i-j))&&!(l%=s),v||(i==j?a[i+=k]=0:++a[i])>=s*k&&++a[--i]);
> printf("\n\n");
>}
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.