黑白棋程序段.doc

黑白棋程序段#include using namespace std;int const MAX=10000;enum Color WHITE=-1,BLANK,BLACK/是否能落子 /黑子;class Choicepublic: int posX; int posY; int score;class Chessmanpublic: enum Color color; unsigned stable;/* 棋子的稳定性(08),若棋子为BLANK则表示该位置落子后可翻过的棋子个数. */;/即下此位置后对方的棋变为自己的棋子的数目class Chessboard/棋盘public:Chessman cell88;/定义棋盘中有8*8个格子 unsigned whiteNum;/白棋数目 unsigned blackNum;/黑棋数void initChessboard(Chessboard *board);void clone( Chessboard *boardDest,const Chessboard *boardSource);void view( Chessboard *board);int judge( Chessboard *board,enum Color player);int putChess( Chessboard *board,Choice *choice,enum Color player);void setStable( Chessboard *board);int evaluate(Chessboard *board,enum Color player);void Chessboard:initChessboard(Chessboard *board)/初始化棋盘/声明一个Chessboard结构体boardint i,j;board-whiteNum=2;board-blackNum=2;for(i=0;i8;i+)for(j=0;jcellij.color=BLANK;board-cellij.stable=0;board-cell33.color=board-cell44.color=BLACK;board-cell34.color=board-cell43.color=WHITE;/ 复制棋盘.void Chessboard:clone( Chessboard *boardDest,const Chessboard *boardSource) int i,j; boardDest-whiteNum=boardSource-whiteNum; boardDest-blackNum=boardSource-blackNum; for(i=0;i8;i+)for(j=0;jcellij.color=boardSource-cellij.color;boardDest-cellij.stable=boardSource-cellij.stable; /显示棋盘.void Chessboard:view( Chessboard *board) int i,j; coutn-;for(i=0;i8;i+)cout-i+1;coutn n;for(i=0;i8;i+)couti+1-;for(j=0;jcellij.color)case BLACK:cout;break;case WHITE:coutcellij.stable)cout +;elsecout ;break;default: /* 棋子颜色错误 */ cout* ;coutn n;cout白棋()个数为:whiteNum ;cout黑棋()个数为:blackNumendlendlcellij.stable) int Chessboard:judge( Chessboard *board,enum Color player) int i,j; unsigned num=0; for(i=0;i8;i+)for(j=0;jcellij.color=BLANK)int x,y;board-cellij.stable=0;for(x=-1;x=1;x+)for(y=-1;y=0 & i2=0 & j2celli2j2.color=(enum Color)-player)num2+;else if(board-celli2j2.color=player)board-cellij.stable+=player*num2;break;else if(board-celli2j2.color=BLANK)break;if(board-cellij.stable)num+;return num;/落子,翻子.int Chessboard:putChess( Chessboard *board,Choice *choice,enum Color player) int i=choice-posX,j=choice-posY; int x,y; if(board-cellij.color!=BLANK | board-cellij.stable=0 | player=BLANK) return -1; board-cellij.color=player; board-cellij.stable=0; if(player=WHITE) board-whiteNum+; else if(player=BLACK) board-blackNum+; for(x=-1;x=1;x+) for(y=-1;y=0 & i2=0 & j2celli2j2.color=(enum Color)-player)num+;else if(board-celli2j2.color=player)board-whiteNum+=(player*WHITE)*num;board-blackNum+=(player*BLACK)*num; for(i2-=x,j2-=y;num0;num-,i2-=x,j2-=y) board-celli2j2.color=player; board-celli2j2.stable=0; break;else if(board-celli2j2.color=BLANK)break; return 0;/* * 设置棋子的稳定性(计算得分的依据)，空白处除外. */void Chessboard:setStable( Chessboard *board) int i,j; for(i=0;i8;i+) for(j=0;jcellij.color!=BLANK) int x,y; board-cellij.stable=1; for(x=-1;x=1;x+) for(y=-1;y=0 & i2=0 & j2celli2j2.color!=board-cellij.color) flag-; break; for(i2=i-x,j2=j-y;i2=0 & i2=0 & j2celli2j2.color!=board-cellij.color) flag-; break; if(flag) /* 在某一条线上稳定 */ board-cellij.stable+; /* * 评价棋手得分. */int Chessboard:evaluate(Chessboard *board,enum Color player) int value=0; int i,j; setStable(board); for(i=0;i8;i+) for(j=0;jcellij.color)*(board-cellij.stable); value+=64*board-cell00.color; value+=64*board-cell07.color; value+=64*board-cell70.color; value+=64*board-cell77.color; value-=32*board-cell11.color; value-=32*board-cell16.color; value-=32*board-cell61.color; value-=32*board-cell66.color; return value*player; /考虑step步，选择最优方案.采用最大最小博弈和-剪裁算法 Choice * maximin( Chessboard *board,enum Color player,int step,int min,int max, Choice *choice) int i,j,k,num; Choice *allChoices; choice-score=-MAX; choice-posX=-1; choice-posY=-1; num=board-judge(board,player); if(num=0) /* 无处落子 */ if(board-judge(board,(enum Color)-player) /* 对方可以落子,让对方下.*/ Chessboard tempBoard; Choice nextChoice; Choice *pNextChoice=&nextChoice;board-clone(&tempBoard,board); pNextChoice=maximin(&tempBoard,(enum Color)-player,step-1,-max,-min,pNextChoice); choice-score=-pNextChoice-score; choice-posX=-1; choice-posY=-1; return choice; else /* 对方也无处落子,游戏结束. */ int value=WHITE*(board-whiteNum) + BLACK*(board-blackNum); if(player*value0) choice-score=MAX-1; else if(player*valuescore=-MAX+1; else choice-score=0; return choice; if(stepscore=board-evaluate(board,player); return choice; allChoices=( Choice *)malloc(sizeof( Choice)*num); k=0; for(i=0;i8;i+) for(j=0;jcellij.color=BLANK & board-cellij.stable) allChoicesk.score=-MAX; allChoicesk.posX=i; allChoicesk.posY=j; k+; for(i=0;i8;i+) for(j=0;j=2 & i=2 & jcellij.color=BLANK & board-cellij.stable) allChoicesk.score=-MAX; allChoicesk.posX=i; allChoicesk.posY=j; k+; for(i=0;i8;i+) for(j=0;j=1 & i=1 & jcellij.color=BLANK & board-cellij.stable) allChoicesk.score=-MAX; allChoicesk.posX=i; allChoicesk.posY=j; k+; for(k=0;kclone(&tempBoard,board); board-putChess(&tempBoard,&thisChoice,player); pNextChoice=maximin(&tempBoard,(enum Color)-player,step-1,-max,-min,pNextChoice); thisChoice.score=-pNextChoice-score; if(thisChoice.scoremin & thisChoice.scorescore=thisChoice.score; choice-posX=thisChoice.posX; choice-posY=thisChoice.posY; else if(thisChoice.score=max) /* 好的超乎预计 */ choice-score=thisChoice.score; choice-posX=thisChoice.posX; choice-posY=thisChoice.posY; break; /* 不如已知最优值 */ free(allChoices); return choice;int main(void)/主函数 Chessboard board; Chessboard *pBoard=&board; enum Color player=BLANK,nowPlayer=BLACK;/声明两个enum枚举变量player，nowplayer Choice choice; Choice *pChoice=&choice; int dif=-1,step=4,success=0; char restart= ; start:/ player=BLANK;/ nowPlayer=BLACK; dif=-1; step=4; restart= ; int b; coutb; if(b=1)/人人对战/while(player!=WHITE & player!=BLACK)coutn请选择执黑棋()(1),或执白棋()(-1)t执黑棋先下:n;scanf(%d,&player);/if(player!=WHITE & player!=BLACK)cout黑白设置错误.n;board.initChessboard(pBoard);/初始化棋盘/ while(step64) /* 棋盘上未下满64子 */char *nowPlayerName=;if(nowPlayer=BLACK)nowPlayerName=黑棋();else if(nowPlayer=WHITE)nowPlayerName=白棋();if(board.judge(pBoard,nowPlayer)=0)if(board.judge(pBoard,(enum Color)-nowPlayer)=0)break; /* 双方都不能落子,游戏结束 */coutnowPlayerNamen无子可下.n;elseint i,j; board.view(pBoard); if(nowPlayer=player) /* 轮到人下 */while(1)coutnowPlayerName请输入棋子坐标(i,j):n;couti;i-;coutj;j-; pChoice-posX=i;pChoice-posY=j; if(i7 | j7 | pBoard-cellij.color!=BLANK | pBoard-cellij.stable=0)coutnowPlayerName不能在i+1,j+1落子.;board.view(pBoard);elsebreak;else/另外一个人下while(1)coutnowPlayerName请输入棋子坐标(i,j):n;couti;i-;coutj;j-; pChoice-posX=i;pChoice-posY=j; if(i7 | j7 | pBoard-cellij.color!=BLANK | pBoard-cellij.stable=0)coutnowPlayerName不能在i+1,j+1落子.;board.view(pBoard);elsebreak; board.putChess(pBoard,pChoice,nowPlayer);step+;coutnowPlayerName落子于坐标i+1,whiteNum - pBoard-blackNum; if(success0)coutn白棋()获胜.n;else if(success0)coutn黑棋()获胜.n;elsecoutn平局.n; coutn游戏结束!n;while(restart!=y & restart!=n)coutrestart;/if(restart=y)goto start;else /人机对战/while(dif60) /设置难度coutdif;if(dif60)cout难度设置错误.n;while(player!=WHITE & player!=BLACK)cout请选择执黑棋()(1),或执白棋()(-1)endl;cout执黑先行:;scanf(%d,&player);if(player!=WHITE & player!=BLACK)cout黑白设置错误.n;board.initChessboard(pBoard);/初始化棋盘 while(step64) / 棋盘上未下满64子 char *nowPlayerName=;if(nowPlayer=BLACK)nowPlayerNam