八皇后问题 c语言 c++八皇后.docVIP

八皇后问题 c语言 c++八皇后 导读：就爱阅读网友为您分享以下“c++八皇后”资讯，希望对您有所帮助，感谢您对92的支持! #include lt;iostream.hgt; #includelt;conio.hgt; #includelt;iomanip.hgt; const int SSize = 8; typedef int SType; class Stack //定义栈及预先的处理 { private: SType data[SSize]; int Top; public: Stack() { Top = 0; } ~Stack() { } bool isEmpty() { return !Top; } int Size() { return Top; } bool Push(SType); bool Pop(SType ); bool StackTop(SType ); }; bool Stack::Push(SType d) { if (Top == SSize) return false; else { data[Top] = d; Top++; return true; } } bool Stack::Pop(SType d) { if (!Top) return false; else{ Top--; d = data[Top]; return true; } } bool Stack::StackTop(SType d) { if (!Top) return false; else { d = data[Top-1]; return true; } } 栈的预先处理结束 enum States { used, free }; class Board //一盘棋8*8 { private: char board[8][8]; States Rows[8], DiagsLR[15], DiagsRL[15]; char PrintBoard[100][8][8]; public: Board(); ~Board(){} bool isAttacked(int, int); void PlaceQueen(int, int); void RemoveQueen(int, int); bool isIn(int row,int col); //确保所有的皇后不出棋盘 void Save_Board(int); void Print5board(int , int); //五个一次打印棋盘 friend Print1(int , Board); //拿五个棋盘出去打印 }; Board::Board() //构造函数，初始化为空 { for(int i=0; ilt;8; i++) { Rows[i] = free; for(int j=0; jlt;8; j++) board[i][j] = ‘.’; //对//声明类 } for(int k=0; klt;15; k++) DiagsLR[k] = DiagsRL[k] = free; } bool Board::isAttacked(int row, int col) //是否冲突，是返回TRUE，否返回FALSE { int diagLR = col-row+7; int diagRL = row+col; if (Rows[row] == used || DiagsLR[diagLR] == used || DiagsRL[diagRL] == used) return true; return false; } void Board::PlaceQueen(int row, int col) //放皇后 { int diagLR = col-row+7; //左对角线元素 int diagRL = row+col; //右对角线元素 board[row][col] = ‘Q’; Rows[row] = used; DiagsLR[diagLR] = used; DiagsRL[diagRL] = used; } void Board::RemoveQueen(int row, int col) //移去皇后 { int diagLR = col-row+7; int di