Reference no: EM13167720

Complete the 8 queens 2 dimensional array program with backtracking. please change the below program using backtracking  and please run before posting it . the program suppose to print 92 solution . amd also comment before each line to better understand.

#include <cmath>

#include <iostream>

using namespace std;

    bool ok(int board[][8]){

         for(int c = 7; c > 0; c--){

         int r = 0;

        while(board[r][c] != 1 ){

          r++;
    }


             for(int i = 1; i <= c; i++){

               if(board[r][c-i] == 1)

               return false;

               else if (board[r-i][c-i] == 1)

               return false;

             else if (board[r+i][c-i] == 1)

              return false;

         }


      }

      return true;

   }


void print(int board[][8], int count){

     cout << count << endl;

      for(int i = 0; i < 8; i++){

         for(int j = 0; j < 8; j++){

          cout << board[i][j];

     }

     cout << endl;


   }

   }

int main (){


   int board[8][8];

      for ( int i = 0; i < 8; i++ )

            for ( int j = 0; j < 8; j++ )

            board[i][j] = 0;

    int count = 0;

       for(int i0 = 0; i0 < 8; i0++)

          for(int i1=0; i1 < 8; i1++)

             for(int i2 = 0; i2 < 8; i2++)

                for(int i3 = 0; i3 < 8; i3++)

                    for(int i4 = 0; i4 < 8; i4++)

                        for(int i5 = 0; i5 < 8; i5++)

                           for(int i6 = 0; i6 < 8; i6++)

                              for(int i7 = 0; i7 < 8; i7++){

  board[i0][0]=1;

  board[i1][1]=1;

  board[i2][2]=1;

  board[i3][3]=1;

  board[i4][4]=1;

  board[i5][5]=1;

  board[i6][6]=1;

  board[i7][7]=1;


    if(ok(board))print(board, ++count);


    board[i0][0]=0;

    board[i1][1]=0;

    board[i2][2]=0;

    board[i3][3]=0;

    board[i4][4]=0;

    board[i5][5]=0;

    board[i6][6]=0;

    board[i7][7]=0;

  }

return 0;

}