Complete the 8 queens 2 dimensional array program with backtracking . c++

==

didididu 10 11 1 #include 2 using namespace std; 3 int main() { 4 int b[8][8] = {0}, row, col = 8, counter = 0; 5 b(@j (0) - 1; // setting an element to indicates a queen 6 NC: col++; 7 if I Col -- 8 ) goto PRINT; // because we have a solution B row = -1; 9 NR: row++; if ( row -- 8 ) goto BACKTRACK: 12 13 // row test 14 // 15 // 16 11 up diagonal test 17 18 19 1/ down diagonal tes 20 // 21 11 Assume there were not conflicts 22 23 // place a queen 24 birow) cou) - 1; 25 26 // the next thing to do is to place a queen in the next column 27 goto NC: 28 29 30 BACKTRACK: Col- 31 if i col - -1 ) return 0; 32 row -; 33 34 1 35 36 37 PRINT: // nested loop 38 1/ for your print code 39 40 goto BACKTRACK 41 return 0; 42 )