如果您无法下载资料，请参考说明：
1、部分资料下载需要金币，请确保您的账户上有足够的金币
2、已购买过的文档，再次下载不重复扣费
3、资料包下载后请先用软件解压，在使用对应软件打开
#ifndefChessBoard_H#defineChessBoard_h#defineBlack7#defineWhite1typedefstruct{intposX;intposY;intscore;}Position;classChessBoard{public:voidinitChessBoard();voidsetPosition(Positionpos);voidsetPosition(Positionpos1,Positionpos2,intside);boolisFull();boolisCover(Positionpos);boolisWin(Positionpos1,Positionpos2);voidshowChesssBoard();private:intchessboard[19][19];};#endif#include<iostream>#include<iomanip>#include"ChessBoard_H.h"usingnamespacestd;voidChessBoard::initChessBoard()//初始化棋盘{inti,j;for(i=0;i<19;i++){for(j=0;j<19;j++){chessboard[i][j]=0;}}}voidChessBoard::setPosition(Positionpos)//设定第一步黑子落子位置{chessboard[pos.posX][pos.posY]=Black;}voidChessBoard::setPosition(Positionpos1,Positionpos2,intside)//设定各方棋子落子位置{if(side==1)//设定白方落子位置{if(isCover(pos1))//判断白方第一个落子位置是否重叠{do{cout<<"白方第一个坐标输入错误,请重新输入:";cin>>pos1.posX>>pos1.posY;}while(isCover(pos1));}chessboard[pos1.posX][pos1.posY]=White;if(isCover(pos2))//判断白方第二个落子位置是否重叠{do{cout<<"白方第二个坐标输入错误,请重新输入:";cin>>pos2.posX>>pos2.posY;}while(isCover(pos2));}chessboard[pos2.posX][pos2.posY]=White;}elseif(side==-1)//设定黑方落子位置{if(isCover(pos1))//判断黑方第一个落子位置是否重叠{do{cout<<"黑方第一个坐标输入错误,请重新输入:";cin>>pos1.posX>>pos1.posY;}while(isCover(pos1));}chessboard[pos1.posX][pos1.posY]=Black;if(isCover(pos2))//判断黑方第二个落子位置是否重叠{do{cout<<"黑方第二个坐标输入错误,请重新输入:";cin>>pos2.posX>>pos2.posY;}while(isCover(pos2));}chessboard[pos2.posX][pos2.posY]=Black;}}boolChessBoard::isFull()//判断棋盘的状态是否已满{inti,j;intflag=0;for(i=0;i<19;i++){for(j=0;j<19;j++){if(chessboard[i][j]==0){flag=1;}}}if(flag==0){returntrue;}else{returnfalse;}}boolChessBoard::isWin(Positionpos1,Positionpos2)//判断当前棋局是否分出输赢{intx1=pos1.posX,x2=pos2.posX;inty1=pos1.posY,y2=pos2.posY;intflag=1;inti;intvalue1=chess
立即下载
