/* Hello This Program is a solution to the 8-Queens problem, which is a challenge to place 8 Queens on a Chess Board (8*8) so that No Queen attacks the other. The Queen can move an arbitary number of blocks diagonally, horizontally or vertically. Currently, There are only 92 possible solutions to the 8*8 problem... All the user needs to do is enter the row and column cooridinates (1-8) for placing the First Queen... Then you will get all the possible boards that can be created by the queen... Please give it a (+1) if you like it, and drop your suggestions in the comments...It will be a help to a fellow coder... Thank You Kinshuk V. V2.0.1 - 5th Mar 2017 @ V 1.0.0 Created 29th Feb 2017 */ #include using namespace std; class Arr{ private: int data[8]; int CSize; public: Arr() { CSize = 0; } bool Push(int d) { if (CSize == 8) {return false;} else{data[CSize] = d; CSize++; return true;} } bool Pop(int& d) { if (!CSize) {return false;} else{CSize--; d = data[CSize]; return true;} } }; enum States{used,vacant}; class Board{ private: char board[8][8]; States Rows[8], DiagsLR[15], DiagsRL[15]; public: Board() { for(int i=0; i<8; i++) { Rows[i] = vacant; for(int j=0; j<8; j++) board[i][j] = '-';} for(int k=0; k<15; k++) DiagsLR[k]=DiagsRL[k]=vacant;} void Print() { for(int i=0; i<8; i++) { for(int j=0; j<8; j++) cout<>r; cout<<"Enter the Column Absicca - "; cin>>c; if((c<=8&&r<=8)&&(c>0&&r>0)) { ccol=c-1;crow=r-1; ChessBoard.PlaceQueen(crow,ccol); cout<<"\n\nGetting the Queen Boards..."<=0); } else cout<<"\n\nFirst Queen Placed in the Void!\nThus, no board can be created!!"<

8 Queens - Chess Problem Solver!!