3B - One flew over the cuckoo hut

Code:


using namespace std;
class Queen
{
 public:
 int x = 1;
 int y = 1;
}

int compareDiag(A, B, C, D, E, F, G, H);
int check(A, B, C, D, E, F, G, H);

int main()
{
 Queen A, B, C, D, E, F, G, H;
 int a = b = c = d = e = f = g = h = 1;
 int solved = 1;
 
 //for loop cycles through every board iteration by cycling each queen through the rows
 for(a=1; a<=8; a++)
 {while(solved==1)
  A.y=a;
  for(b=1; B<=8; b++)
  {
    B.y=b;
    for(c=1; c<=8; c++)
    {
 C.y=c;
 for(d=1; d<9; d++)
 {
  D.y=d;
  for(e=1; e<9; e++)
  {
    E.y=e;
    for(f=1; f<9; f++)
    {
 F.y=f;
 for(g=1; g<9; g++)
 {
  G.y=g;
  for(h=1; h<9; h++)
  {
    H.y=h;

    //check if any piece is on the same row before comparing diagonals
    if(A.y != B.y && A.y != C.y && A.y != D.y && A.y != E.y && A.y != F.y && A.y != G.y && A.y != H.y
 && B.y != C.y && B.y != D.y && B.y != E.y && B.y != F.y && B.y != G.y && B.y != H.y
 && C.y != D.y && C.y != E.y && C.y != F.y && C.y != G.y && C.y != H.y
 && D.y != E.y && D.y != F.y && D.y != G.y && D.y != H.y
 && E.y != F.y && E.y != G.y && E.y != H.y
 && F.y != G.y && F.y != H.y
 && G.y != H.y)
    {
 solved = compareDiag(A, B, C, D, E, F, G, H);}
 }}}}}}}}}
if (solved==0)
{cout << A.x << "," << A.y << "\n";
 cout << B.x << "," << B.y << "\n";
 cout << C.x << "," << C.y << "\n";
 cout << D.x << "," << D.y << "\n";
 cout << E.x << "," << E.y << "\n";
 cout << F.x << "," << F.y << "\n";
 cout << G.x << "," << G.y << "\n";
 cout << H.x << "," << H.y << "\n";
}
else {cout << "No Solution.";

return 0;
}

int compareDiag(Queen A, Queen B, Queen C, Queen D, Queen E, Queen F, Queen G, Queen H)
{
  int correct=0;
  correct = check (A, B, C, D, E, F, G, H);
  if(correct==0) {correct = check(B, A, C, D, E, F, G, H);}
  if(correct==0) {correct = check(C, A, B, D, E, F, G, H);}  
  if(correct==0) {correct = check(D, A, B, C, E, F, G, H);}  
  if(correct==0) {correct = check(E, A, B, C, D, F, G, H);}  
  if(correct==0) {correct = check(F, A, B, C, D, E, G, H);}  
  if(correct==0) {correct = check(G, A, B, C, D, E, G, H);}
  if(correct==0) {correct = check(H, A, B, C, D, E, F, G);}

  return correct;    
}

int check(Queen A, Queen B, Queen C, Queen D, Queen E, Queen F, Queen G, Queen H)
{
  int correct = 0;
  Queen tempA;
  tempA.x = A.x;
  tempA.y = A.y;

  //check down right
  while(tempA.x <9 && tempA.y <9 && correct == 0)
  {
    tempA.x++;
    tempA.y++;
    if(tempA==B || tempA==C || tempA==D || tempA==E || tempA==F || tempA==G || tempA==H)
    {correct = 1;}
   }
  tempA.x = A.x;
  tempA.y = A.y;

//check up right
while( tempA.x < 9 && tempA.y>0 && correct == 0)
{
  tempA.x++;
  tempA.y--;
if(tempA==B || tempA==C || tempA==D || tempA==E || tempA==F || tempA==G || tempA==H)
    {correct = 1;}

//check down left
while(tempA.x >0 && tempA.y>0 && correct==0)
{
  tempA--;
  tempB--;
if(tempA==B || tempA==C || tempA==D || tempA==E || tempA==F || tempA==G || tempA==H)
    {correct = 1;}
}

//check up left
while(tempA.x > 0 && tempA.y < 9 && correct == 0)
{
  tempA.x--;
  tempA.y++;
if(tempA==B || tempA==C || tempA==D || tempA==E || tempA==F || tempA==G || tempA==H)
    {correct = 1;}
}

return correct;
}


Sam Dekker wrote:((I think the puzzle is going to be some version of place all the queens on the board so that no queen is attacked by any other queen. If that's the puzzle Sam does the following))

Sam places a queen at a8, c7, e6, g5, h1, f2, d3, and b4.

((Plotting these out. A8 and H1 align diagonally. Based on that, though, I managed to solve it. Gotta shove the upper half right one tile. That way they won't block the lower half as much. Then it's a matter of checking which ones are still free, and a quick bit of trial-and-error. This should work: B8, D7, F6, H5, C4, A3, G2, E1. Dunno the logic behind the lower half. I just filled up the gaps ))