PowerPoint 演示文稿
GROUP WORK
PPT OF KANG
Backgammon
HANDLE hout = GetStdHandle(STD_OUTPUT_HANDLE), hin = GetStdHandle(STD_INPUT_HANDLE);
COORD coord, pos;
void locate(int x, int y)
{
coord.X = y;
coord.Y = x;
SetConsoleCursorPosition(hout, coord);
};
光标定位
void hide()
{
CONSOLE_CURSOR_INFO cursor_info = { 1, 0 };
SetConsoleCursorInfo(hout, &cursor_info);
}
INPUT_RECORD mouseRec;
DWORD res;
struct win_list
{
bool is_able;
int x[5], y[5];
bool is_used[5];
};
int len, sum;
int chess[20][20], scoreC[20][20], scoreP[20][20];
int last_x, last_y;
win_list computer[2000], person[2000];
隐藏光标
void init()
{
int i, j, k;
sum = 0;
memset(chess, 0, sizeof(chess));
for (i = 0; i <= len - 1; i++)
{
for (j = 0; j <= len - 5; j++)
{
computer[sum + (len - 4)*i + j].is_able = true;
for (k = 0; k <= 4; k++)
{
computer[sum + (len - 4)*i + j].is_used[k] = false;
computer[sum + (len - 4)*i + j].x[k] = i;
computer[sum + (len - 4)*i + j].y[k] = j + k;
}
}
}
数据初始化，将所有可能获胜的情况录入
sum += (len - 4)*len;
for (i = 0; i <= len - 5; i++)
{
for (j = 0; j <= len - 1; j++)
{
computer[sum + len*i + j].is_able = true;
for (k = 0; k <= 4; k++)
{
computer[sum + len*i + j].is_used[k] = false;
computer[sum + len*i + j].x[k] = i + k;
computer[sum + len*i + j].y[k] = j;
}
}
}
sum += (len - 4)*len;
for (i = 0; i <= len - 5; i++)
{
for (j = 0; j <= len - 5; j++)
{
computer[sum + (len - 4)*i + j].is_able = true;
for (k = 0; k <= 4; k++)
{
computer[sum + (len - 4)*i + j].is_used[k] = false;
computer[sum + (len - 4)*i + j].x[k] = i + k;
computer[sum + (len - 4)*i + j].y[k] = j + k;
}}}
sum += (len - 4)*(len - 4);
for (i = 4; i <= len - 1; i++)
{
for (j = 0; j <= len - 5; j++)
{
computer[sum + (len - 4)*(i - 4) + j].is_able = true;
for (k = 0; k <= 4; k++)
{
computer[sum + (len - 4)*(i - 4) + j].is_used[k] = false;
computer[sum + (len - 4)*(i - 4) + j].x[k] = i - k;
computer[sum + (len - 4)*(i - 4) + j].y[k] = j + k;
}}}
sum += (len - 4)*(len - 4);
for (i = 0; i <= sum - 1; i++)
person[i] = computer[i];
}
void put_down(int x0, int y0, int w)
{
chess[x0][y0] = w;
locate(x0 + 2, y0 + 2);
if (w == 2) cout << "o";
else
{
cout << "+";
if (last_x != -1)
{
locate(last_x + 2, last_y + 2);
cout << "+";
}
last_x = x0; last_y = y0;
}
locate(len + 3, 0);
落子函数，其中w=1代表机器落子，w=2代表人落子
int i, j;
for (i = 0; i <= sum - 1; i++)
{
for (j = 0; j <= 4; j++)
{
if (w == 1)
{
if (computer[i].x[j] == x0 && computer[i].y[j] == y0)
computer[i].is_used[j] = true;
if (person[i].x[j] == x0 && person[i].y[j] == y0)
person[i].is_able = false;
}
else
{
if (computer[i].x[j] == x0 && computer[i].y[j] == y0)
computer[i].is_able = false;
if (person[i].x[j] == x0 && person[i].y[j] == y0)
person[i].is_used[j] = true;
}
}}}
int where()
{
int i, j;
int tempCx, tempCy, tempPx, tempPy;
int scoreC = 0, scoreP = 0;
int a, b;
for (i = 0; i <= len - 1; i++)
{
for (j = 0; j <= len - 1; j++)
{
if (chess[i][j] == 0)
{
a = judge(i, j, 1);
寻找落子位置
if (scoreC
{
判断游戏是否结束
k–;
score++;
}
k = j + 1;
while (k <= 4 && computer[i].is_used[k] == true)
{
k++;
score++;
}
if (score == 5) return false;
break;
}
}
}
}
else
{
for (i = 0; i <= sum - 1; i++)
{
score = 1;
if (person[i].is_able == false) continue;
for (j = 0; j <= 4; j++)
{
if (person[i].x[j] == x0 && person[i].y[j] == y0)
{
k = j - 1;
while (k >= 0 && person[i].is_used[k] == true)
{
k–;
score++;
}
k = j + 1;
while (k <= 4 && person[i].is_used[k] == true)
{
k++;
score++;
}
if (score == 5) return false;
break;
}}}}return true;}
void print()
{
locate(0, 0);
int i, j;
for (i = 1; i <= 4; i++) cout << " " << endl;
locate(0, 0);
cout << " ";
for (i = 1; i <= len; i++) cout << i % 10;
cout << endl << " ";
for (i = 1; i <= len; i++) cout << "-";
cout << endl;
for (i = 1; i <= len; i++)
{
cout << i % 10 << "|";
for (j = 1; j <= len; j++) cout << " ";
cout << "|" << endl;}
cout << " ";
for (i = 0; i <= len - 1; i++) cout << "-";
cout << endl;}
输出棋盘
int main()
{
cout << "--------Backgammon--------" << endl;
cout << "Please input the width of map(10-20)" << endl;
cout << "Please use mouse to play the game" << endl;
cout << "--------------------------" << endl;
cin >> len;
if (len<10)
{
cout << "ERROR" << endl;
system("pause");
return 0;
}
主函数
int x0, y0, z0;
int input = 0, e = 0;
last_x = last_y = -1;
init();
print();
hide();
while (1)
{
while (1)
{
ReadConsoleInput(hin, &mouseRec, 1, &res);
if (mouseRec.EventType == MOUSE_EVENT)
{
pos = mouseRec.Event.MouseEvent.dwMousePosition;
x0 = pos.Y - 2; y0 = pos.X - 2;
if (mouseRec.Event.MouseEvent.dwButtonState == FROM_LEFT_1ST_BUTTON_PRESSED)
{
if ((x0 >= 0 && x0 <= len - 1 && y0 >= 0 && y0 <= len - 1 && chess[x0][y0] == 0)) break;
}
}}
locate(len + 3, 0);
cout << " ";
put_down(x0, y0, 2);
if (!is_ended(x0, y0, 2))
{
e = 2; break;
}
input++;
if (input>len*len) break;
z0 = where();
x0 = z0 / len; y0 = z0%len;
put_down(x0, y0, 1);
if (!is_ended(x0, y0, 1))
{
e = 1; break;
}
input++;
if (input>len*len) break;
}
locate(len + 3, 0);
if (e == 0) cout << "Draw!" << endl;
if (e == 1) cout << "You lose!" << endl;
if (e == 2) cout << "You win!" << endl;
system("pause");
return 0;
}
Enjoy yourself!
THANKS
/docProps/thumbnail.jpeg