game

/** game.cpp** Created on: 2013-12-19* Author: Mu & An*/#include<iostream>#include<utility>// for pair#include<cstring>#include<cctype>#include<string>using namespace std;typedef int Chess;const Chess BLACK = 1;const Chess WHITE = -1;const Chess NUL = 0;typedef pair<int, int> Position; // Position.first 行；Position.second 列const int BSIZE = 8;Chess human = BLACK;Chess curr_player; // 当前落子的一方Chess board[8][8];int num_steps; // 记录步数int num_pieces[3]; // 双方棋子个数const string player[3]= {"白", "", "黑"};const int INF = 9999999;const int value[BSIZE][BSIZE] = {{15, -2, 5, 5, 5, 5, -2, 15},{-2, -2, 0, 0, 0, 0, -2, -2},{ 5, 0, 0, 0, 0, 0, 0, 5},{ 5, 0, 0, 0, 0, 0, 0, 5},{ 5, 0, 0, 0, 0, 0, 0, 5},{ 5, 0, 0, 0, 0, 0, 0, 5},{-2, -2, 0, 0, 0, 0, -2, -2},{15, -2, 5, 5, 5, 5, -2, 15}};// 如果按照规则，curr_player可以board棋盘的在(x,y)处放置棋子，则返回truebool can_place(int x, int y, Chess board[][BSIZE], Chess curr_player) {if(board[x][y] != NUL) return false;// directions存储8个方向intdirections[8][2]={{-1,0},{-1,1},{0,1},{1,1},{1,0},{1,-1},{0,-1},{-1,-1} };for(int i=0; i<8; i++){int xx = x, yy = y;// 考察i方向，如果没有走出棋盘，而且碰到的是对方棋子，则前进，否则跳出循环do{xx += directions[i][0];yy += directions[i][1];}while(xx>=0 && xx<8 && yy>=0 && yy<8 && board[xx][yy]==-curr_player);// 如果走到最后走出棋盘或者碰到空白位置而停下，则表示// 从i方向的角度来看，不能确定在(x,y)位置能放置该颜色棋子if (xx<0 || xx>=8 || yy<0 || yy>=8 || board[xx][yy]==NUL) continue;int u = x + directions[i][0];int v = y + directions[i][1];// 如果只在i方向上走了1步，这样也不能说明可以在(x,y)放置该颜色的棋子// 如果走了多于一步，则表示停止位置和(x,y)之间全部为对方棋子，可以放置，返回trueif (u!=xx || v!=yy) return true;}return false;}// 在棋盘中找是否存在curr_player可以放置棋子的位置，并将合法位置写到list里。

// 返回共有多少个合法位置。

如果合法位置数量多于max，则只写入找到的前max个并// 返回max。

intget_move(Chess board[BSIZE][BSIZE], Position list[], Chess curr_player, int max){int nMoves=0;for (int i=0;i<BSIZE;i++){for (int j=0;j<BSIZE;j++){if (can_place(i, j, board, curr_player)){list[nMoves++] = std::make_pair(i, j);if (nMoves == max)return nMoves;}}}return nMoves;}// curr_player在(x,y)放置棋子之后，翻转所有在(x,y)与另一个同色棋子（一条直线）// 之间的对方棋子。

返回被翻转的棋子数。

新棋盘存储在dest里intreverse(Chess src[][BSIZE], Chess dest[][BSIZE], int x, int y, Chesscurr_player){if (curr_player == 0)return 0;int nReversed = 0;int directions[8][2] = {{-1,0},{-1,1},{0,1},{1,1},{1,0},{1,-1},{0,-1},{-1,-1}}; //8 directionsfor (int i=0; i<BSIZE; i++){for (int j=0; j<BSIZE; j++)dest[i][j] = src[i][j];} // 把棋盘复制一份dest[x][y] = curr_player; //place the chessfor (int i=0; i<8; i++){ //loop for all directionsint xx = x, yy = y; //searching x,ydo {xx += directions[i][0];yy += directions[i][1];}while(xx>=0 && xx<8 && yy>=0 && yy<8 && src[xx][yy]==-curr_player);//out of boundif (xx<0 || xx>=8 || yy<0 || yy>=8 || src[xx][yy]==NUL) continue;int u = x + directions[i][0];int v = y + directions[i][1];while (u!=xx || v!=yy){ // (u,v)!=(xx,yy) then continue reversing dest[u][v]=-dest[u][v]; //reverseu += directions[i][0];v += directions[i][1];++nReversed;}}return nReversed;}int search(Chess board[8][8], int thischess, int depth, int &x, int &y) {if (depth == 0) {int total_value = 0;for (int i = 0; i < BSIZE; i++)for (int j = 0; j < BSIZE; j++)total_value += board[i][j] * value[i][j] * thischess;return total_value;}Position list[60];int nMoves;int tx, ty;int bestx, besty;int best_value = -INF;int vmove;nMoves = get_move(board, list, thischess, 60);// std::cerr << depth << ", " << nMoves << std::endl;if (nMoves == 0){return -search(board, -thischess, depth-1, x, y);}// 考虑每一个可以落子的位置for (int i=0; i<nMoves; i++) {tx = list[i].first;ty = list[i].second;Chess testboard[8][8];// 在该处落子能后，当前回合得到的收益（翻转的对方棋子）int nReversed = reverse(board, testboard, tx, ty, thischess);// 减去下回合及以后对方的收益，得到总收益vmove = nReversed * 5 - search(testboard, -thischess, depth-1, x, y);if (vmove > best_value) {bestx = tx;besty = ty;best_value = vmove;}}x = bestx;y = besty;return best_value;}Position simple_ai(Chess board[8][8], Chess thischess){int x, y;search(board, thischess, 5, x, y);return make_pair(x, y);}Position game_ai(Chess board[8][8], Chess curr_player){return simple_ai(board, curr_player);}void game_init() // 棋局初始化{memset(board, 0, sizeof(board)); // 棋盘清空// 初始布局board[3][3] = WHITE;board[3][4] = BLACK;board[4][3] = BLACK;board[4][4] = WHITE;num_steps = 0;num_pieces[0] = num_pieces[2] = 2; // 黑、白棋各2颗curr_player = BLACK;}void print_board() // 显示棋盘{cout << "黑棋● " << num_pieces[2] << endl;cout << "白棋○ " << num_pieces[0] << endl;cout << " 1 2 3 4 5 6 7 8 " << endl;cout << " ╔══╦══╦══╦══╦══╦══╦══╦══╗" << endl;for (int i=0; i<8; i++){cout << " " << char('A' + i) << "║";for (int j=0; j<8; j++){switch (board[i][j]){case NUL:cout << " ";break;case BLACK:cout << "● ";break;case WHITE:cout << "○ ";break;}cout << "║";}cout << endl;if (i < 7) cout << " ╠══╬══╬══╬══╬══╬══╬══╬══╣" << endl;else cout << " ╚══╩══╩══╩══╩══╩══╩══╩══╝" << endl;}}void choose_colour(){int colour;cout << "请输入您需要选择的棋子颜色：(黑 1 or 白 -1)";while (true){cin >> colour;if (colour == 1 || colour == -1){human = colour;cout << "颜色选择成功！" << endl;break;}cout << "您选择的颜色有误，请重新输入：";}}pair<char, char> get_coordinate() // 提示用户输入坐标，并返回用户输入的合法坐标{char row, col;// 由于curr_player的取值为1（黑）或-1（白），curr_player+1取值0或2，正好// 对应player数组的两个有字幕的元素cout << "请输入您（" << player[curr_player+1]<< "棋）需要落子的位置坐标：（例如 A 1）" << endl;cout << "返回主菜单请输入：R M" << endl;// 循环，一直提示用户输入坐标，直到用户输入合法为止while (true){cin >> row >> col;row = toupper(row);if (row>='A' && row<='H' && col>='1' && col<='8'){if (can_place(row-'A', col-'1', board, curr_player)) break;else cout << "当前位置不能落子，请重新输入" << endl;}else if (row == 'R' && col == 'M') break; // 返回主菜单else cout << "输入坐标无效，请重新输入：" << endl;}return make_pair(row, col);}void game_loop() // 游戏{print_board();int moveflag = 0; // 记录不可移动的步数，2则游戏结束while (true){if (moveflag == 2 || num_steps == 60){cout << "游戏结束，";if (num_pieces[2] == num_pieces[0]) cout << "平局。