技术标签: C/C++ 二维数组 三维 c语言 三维五子棋的胜负判断 五子棋
#include<stdio.h>
#include<Windows.h>
#include<time.h>
#include<stdlib.h>
#include<string.h>
#include<conio.h>
#define MAXIMUS 5 //定义棋盘大小(5*5个方框)
#define chess_number 30//定义棋盘高度
int count = 0, move_x = 0, move_y = 0, x = 0, y = 0, chess_num = chess_number / 2, chess_num_0;
struct MyStruct_0
{
char ChessBoard[MAXIMUS][MAXIMUS];
}MyStruct_0[chess_number];
/*棋盘初始化*/
void Initialize()
{
for (int i = 0; i < MAXIMUS; i++)
{
for (int j = 0; j < MAXIMUS; j++)
{
MyStruct_0[chess_num].ChessBoard[i][j] = ' ';
}
}
MyStruct_0[chess_num].ChessBoard[x][y] = '+';
}
/*画棋盘*/
void DrawBoard()
{
printf("\n当前棋盘位置(w,s调整):%d\n", chess_num_0);
printf("当前棋盘棋子情况:\n");
printf("o:\n");
for (int i = 0; i < MAXIMUS; i++)
{
for (int j = 0; j < MAXIMUS; j++)
{
if (MyStruct_0[chess_num].ChessBoard[i][j] == 'o')
printf("(%d,%d) ", i, j);
}
}
printf("\n*:\n");
for (int i = 0; i < MAXIMUS; i++)
{
for (int j = 0; j < MAXIMUS; j++)
{
if (MyStruct_0[chess_num].ChessBoard[i][j] == '*')
printf("(%d,%d) ", i, j);
}
}
printf("\n---------------------------------------------\n\n");
printf("┏");
for (int i = 0; i < MAXIMUS - 1; i++)
printf("─┳");
printf("─┓\n");
for (int i = 0; i< MAXIMUS - 1; i++)
{
for (int j = 0; j < MAXIMUS; j++)
{
printf("│%c ", MyStruct_0[chess_num].ChessBoard[i][j]);
}
printf("│\n");
printf("┣");
for (int i = 0; i < MAXIMUS - 1; i++)
{
printf("─╋");
}
printf("─┫\n");
}
for (int i = 0; i < MAXIMUS; i++)
{
printf("│%c ", MyStruct_0[chess_num].ChessBoard[MAXIMUS - 1][i]);
}
printf("│\n");
printf("┗");
for (int i = 0; i < MAXIMUS - 1; i++)
printf("─┻");
printf("─┛\n");
}
/*判断胜负*/
int Win_Or_Not()
{
/*水平判断*/
int W_ = 0, B_ = 0, i;
for (i = 1; i < 5; i++){ if (move_x - i >= 0 && MyStruct_0[chess_num].ChessBoard[move_x - i][move_y] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o')W_++; else break; }
for (i = 1; i < 5; i++){ if (move_x + i<MAXIMUS&&MyStruct_0[chess_num].ChessBoard[move_x + i][move_y] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o')W_++; else break; }
if (W_ >= 4)
return 1;
for (i = 1; i < 5; i++){ if (move_x - i >= 0 && MyStruct_0[chess_num].ChessBoard[move_x - i][move_y] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*')B_++; else break; }
for (i = 1; i < 5; i++){ if (move_x + i<MAXIMUS&&MyStruct_0[chess_num].ChessBoard[move_x + i][move_y] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*')B_++; else break; }
if (B_ >= 4)
return 2;
W_ = 0, B_ = 0;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num].ChessBoard[move_x][move_y + i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o')W_++; else { break; } }
if (W_ == 4)
return 1;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num].ChessBoard[move_x][move_y - i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o')W_++; else { break; } }
if (W_ == 4)
return 1;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num].ChessBoard[move_x][move_y + i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*')B_++; else { break; } }
if (B_ == 4)
return 2;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num].ChessBoard[move_x][move_y - i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*')B_++; else { break; } }
if (B_ == 4)
return 2;
W_ = 0, B_ = 0;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num].ChessBoard[move_x + i][move_y + i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o')W_++; else { break; } }
if (W_ == 4)
return 1;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num].ChessBoard[move_x - i][move_y - i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o')W_++; else { break; } }
if (W_ == 4)
return 1;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num].ChessBoard[move_x + i][move_y + i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*')B_++; else { break; } }
if (B_ == 4)
return 2;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num].ChessBoard[move_x - i][move_y - i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*')B_++; else { break; } }
if (B_ == 4)
return 2;
W_ = 0, B_ = 0;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num].ChessBoard[move_x + i][move_y - i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o')W_++; else { break; } }
if (W_ == 4)
return 1;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num].ChessBoard[move_x - i][move_y + i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o')W_++; else { break; } }
if (W_ == 4)
return 1;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num].ChessBoard[move_x + i][move_y - i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*')B_++; else { break; } }
if (B_ == 4)
return 2;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num].ChessBoard[move_x - i][move_y + i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*')B_++; else { break; } }
if (B_ == 4)
return 2;
/*立体判断*/
/*0号方向*/
W_ = 0, B_ = 0;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x][move_y] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else {
break;} }
if (W_ == 4)
return 1;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x][move_y] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
if (W_ == 4)
return 1;
W_ = 0, B_ = 0;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x][move_y] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
if (B_ == 4)
return 2;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x][move_y] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
if (B_ == 4)
return 2;
/*1号方向*/
W_ = 0, B_ = 0;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x][move_y - i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
if (W_ == 4)
return 1;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x][move_y + i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
if (W_ == 4)
return 1;
W_ = 0, B_ = 0;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x][move_y - i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
if (B_ == 4)
return 2;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x][move_y + i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
if (B_ == 4)
return 2;
/*2号方向*/
W_ = 0, B_ = 0;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x - i][move_y - i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
if (W_ == 4)
return 1;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x + i][move_y + i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
if (W_ == 4)
return 1;
W_ = 0, B_ = 0;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x - i][move_y - i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
if (B_ == 4)
return 2;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x + i][move_y + i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
if (B_ == 4)
return 2;
/*3号方向*/
W_ = 0, B_ = 0;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x - i][move_y] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
if (W_ == 4)
return 1;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x + i][move_y] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
if (W_ == 4)
return 1;
W_ = 0, B_ = 0;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x - i][move_y] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
if (B_ == 4)
return 2;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x + i][move_y] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
if (B_ == 4)
return 2;
/*4号方向*/
W_ = 0, B_ = 0;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x - i][move_y + i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
if (W_ == 4)
return 1;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x + i][move_y - i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
if (W_ == 4)
return 1;
W_ = 0, B_ = 0;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x - i][move_y + i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
if (B_ == 4)
return 2;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x + i][move_y - i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
if (B_ == 4)
return 2;
/*5号方向*/
W_ = 0, B_ = 0;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x][move_y + i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
if (W_ == 4)
return 1;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x][move_y - i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
if (W_ == 4)
return 1;
W_ = 0, B_ = 0;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x][move_y + i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
if (B_ == 4)
return 2;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x][move_y - i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
if (B_ == 4)
return 2;
/*6号方向*/
W_ = 0, B_ = 0;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x + i][move_y + i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
if (W_ == 4)
return 1;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x - i][move_y - i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
if (W_ == 4)
return 1;
W_ = 0, B_ = 0;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x + i][move_y + i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
if (B_ == 4)
return 2;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x - i][move_y - i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
if (B_ == 4)
return 2;
/*7号方向*/
W_ = 0, B_ = 0;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x + i][move_y] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
if (W_ == 4)
return 1;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x - i][move_y] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
if (W_ == 4)
return 1;
W_ = 0, B_ = 0;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x + i][move_y] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
if (B_ == 4)
return 2;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x - i][move_y] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
if (B_ == 4)
return 2;
/*8号方向*/
W_ = 0, B_ = 0;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x + i][move_y - i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
if (W_ == 4)
return 1;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x - i][move_y + i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
if (W_ == 4)
return 1;
W_ = 0, B_ = 0;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x + i][move_y - i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
if (B_ == 4)
return 2;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x - i][move_y + i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
if (B_ == 4)
return 2;
int sum = 0;
for (int i = 0; i < MAXIMUS; i++)
{
for (int j = 0; j < MAXIMUS; j++)
{
if (MyStruct_0[chess_num].ChessBoard[i][j] == 'o' || MyStruct_0[chess_num].ChessBoard[i][j] == '*')
sum += 1;
}
}
if (sum == MAXIMUS*MAXIMUS)
return 3;
return 0;
}
这里是最重要的胜负判断函数。比较笨拙,能力有限。
这里以1号方向为例讲解。
/*1号方向*/
W_ = 0, B_ = 0;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x][move_y - i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
if (W_ == 4)
return 1;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x][move_y + i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
if (W_ == 4)
return 1;
W_ = 0, B_ = 0;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x][move_y - i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
if (B_ == 4)
return 2;
for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x][move_y + i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
if (B_ == 4)
return 2;
MyStruct_0[chess_num + i].ChessBoard[move_x][move_y - i]
表示当前第chess_num个棋盘的状态void RunGame()
{
int input;
system("cls");
DrawBoard();//打印棋盘
input = getch();//等待键盘按下一个字符
if (input == 27)//如果是ESC则退出程序
{
exit(0);
}
else if (char(input) == 'c')
{
MyStruct_0[chess_num].ChessBoard[x][y] = ' ', move_x = x, move_y = y;
}
else if (char(input) == 'w')
{
chess_num_0++;
chess_num++;
}
else if (char(input) == 's')
{
chess_num_0--;
chess_num--;
}
else if (input == 0x20)//如果是空格则开始走子
{
if (count % 2 == 0)
MyStruct_0[chess_num].ChessBoard[x][y] = 'o', move_x = x, move_y = y;
else
MyStruct_0[chess_num].ChessBoard[x][y] = '*', move_x = x, move_y = y;
count += 1;
}
else if (input == 0xE0)//如果按下的是方向键,会填充两次输入,第一次为0xE0表示按下的是控制键
{
if (MyStruct_0[chess_num].ChessBoard[x][y] != '*'&&MyStruct_0[chess_num].ChessBoard[x][y] != 'o')
MyStruct_0[chess_num].ChessBoard[x][y] = ' ';
input = getch();//获得第二次输入信息
switch (input)//判断方向键方向并移动光标位置
{
case 0x4B:
y--;
break;
case 0x48:
x--;
break;
case 0x4D:
y++;
break;
case 0x50:
x++;
break;
}
if (x<0)x = MAXIMUS - 1;//如果光标位置越界则移动到对侧
if (y<0)y = MAXIMUS - 1;
if (x >= MAXIMUS)x = 0;
if (y >= MAXIMUS)y = 0;
if (MyStruct_0[chess_num].ChessBoard[x][y] != '*'&&MyStruct_0[chess_num].ChessBoard[x][y] != 'o')
MyStruct_0[chess_num].ChessBoard[x][y] = '+';
}
system("cls");
DrawBoard();//打印棋盘
printf("当前对局数:%d\n", count);
printf("稍等...\n");
Sleep(100);
}
input = getch();//等待键盘按下一个字符
if (input == 27)//如果是ESC则退出程序
{
exit(0);
}
else if (char(input) == 'c')
{
MyStruct_0[chess_num].ChessBoard[x][y] = ' ', move_x = x, move_y = y;
}
else if (char(input) == 'w')
{
chess_num_0++;
chess_num++;
}
`else if (input == 0x20)//如果是空格则开始走子
{
if (count % 2 == 0)
MyStruct_0[chess_num].ChessBoard[x][y] = ‘o’, move_x = x, move_y = y;
else
MyStruct_0[chess_num].ChessBoard[x][y] = ‘*’, move_x = x, move_y = y;
count += 1;
}`
如果输入空格则会将当前的光标坐标(x,y)依照当前局数奇偶来觉得是’o’还是’*’
执行完赋值操作后,局数加一
`else if (input == 0xE0)//如果按下的是方向键,会填充两次输入,第一次为0xE0表示按下的是控制键
{
if (MyStruct_0[chess_num].ChessBoard[x][y] != ‘*’&&MyStruct_0[chess_num].ChessBoard[x][y] != ‘o’)
MyStruct_0[chess_num].ChessBoard[x][y] = ’ ‘;
input = getch();//获得第二次输入信息
switch (input)//判断方向键方向并移动光标位置
{
case 0x4B:
y--;
break;
case 0x48:
x--;
break;
case 0x4D:
y++;
break;
case 0x50:
x++;
break;
}
if (x<0)x = MAXIMUS - 1;//如果光标位置越界则移动到对侧
if (y<0)y = MAXIMUS - 1;
if (x >= MAXIMUS)x = 0;
if (y >= MAXIMUS)y = 0;
if (MyStruct_0[chess_num].ChessBoard[x][y] != '*'&&MyStruct_0[chess_num].ChessBoard[x][y] != 'o')
MyStruct_0[chess_num].ChessBoard[x][y] = '+';
}`
当是方向键的时候,需要将’+’光标赋值给当前棋盘,并且将原来的位置的字符赋值为’ ‘
if (x<0)x = MAXIMUS - 1;//如果光标位置越界则移动到对侧
if (y<0)y = MAXIMUS - 1;
if (x >= MAXIMUS)x = 0;
if (y >= MAXIMUS)y = 0;
这段代码便解决了这个问题
int main()
{
system("title 五子棋(方框版) — J.m制作");//设置标题
system("mode con cols=60 lines=40");//设置窗口大小
system("color F0");//设置颜色
Initialize();
while (true)
{
if (Win_Or_Not() == 1)
{
system("cls");
DrawBoard();
printf("游戏结果: o Win\n");
system("pause");
}
if (Win_Or_Not() == 2)
{
system("cls");
DrawBoard();
printf("游戏结果: * Win\n");
system("pause");
}
if (Win_Or_Not() == 3)
{
system("cls");
DrawBoard();
printf("游戏结果: 平局\n");
system("pause");
}
RunGame();
}
return 0;
}
这里是主函数,需要注意的是这个程序永远不会退出,即使胜负已定。因为考虑到需要玩家查看当前棋盘状态,所以便没有设置结束。
文章浏览阅读1.5w次,点赞9次,收藏26次。简介一个创建某个文件到桌面快捷方式的BAT批处理.代码@echooff::设置程序或文件的完整路径(必选)setProgram=D:\Program Files (x86)\格式工厂.4.2.0\FormatFactory.exe::设置快捷方式名称(必选)setLnkName=格式工厂v4.2.0::设置程序的工作路径,一般为程序主目录,此项若留空,脚本将..._批处理创建桌面快捷方式
文章浏览阅读2k次。射频识别技术漫谈(6-10),概述RFID的通讯协议;射频ID卡的原理与实现,数据的传输与解码;介绍动物标签属性与数据传输;RFID识别号的变化等_芯片 ttf模式
文章浏览阅读1.1k次。今天小编心血来潮,为大家带来一个很有趣的项目,那就是使用 Python web 框架 Django 来实现支付宝支付,废话不多说,一起来看看如何实现吧。_django 对接支付宝接口流程
文章浏览阅读842次。Zabbix 5.0 LTS,跑了一年多了一直很稳定,前两天空间显示快满了,于是手贱清理了一下history_uint表(使用mysql truncate),结果折腾了一周。大概故障如下:然后zabbix论坛、各种群问了好久都没解决,最后自己一番折腾似乎搞定了。初步怀疑,应该是由于历史数据被清空后,zabbix需要去处理数据,但是数据量太大,跑不过来,所以来不及更新了(?)..._zabbix问题没有更新
文章浏览阅读296次。一、数据结构之字典 key-value
文章浏览阅读9.7k次,点赞3次,收藏13次。最近项目中遇到一个问题,是关于mybatis-plus的字段注解策略,记录一下。1问题调用了A组件(基础组件),来更新自身组件的数据,发现自己组件有个字段总是被清空。2原因分析调用的A组件的字段,属于基础字段,自己业务组件,对这个基础字段做了扩展,增加了业务字段。但是在自己的组件中的实体注解上,有一个注解使用错误。mybatis-plus封装的updateById方法,如果..._mybatisplus strategy
文章浏览阅读3.8k次。如何构建倒排索引,我们将这个过程叫做“索引构建”。如果我们的文档很多,这样索引就一次性装不下内存,该如何构建。硬件的限制 我们知道ram读写是随机的操作,只要输入相应的地址单元就能瞬间将数据读出来或者写进去。但是磁盘不行,磁盘必须有一个寻道的过程,外加一个旋转时间。那么只有涉及到磁盘,我们就可以考虑怎么节省I/O操作时间。【注】操作系统往往以数据块为单位进行读写。因为读一_为某一文档及集构件词项索引时,可使用哪些索引构建方法
文章浏览阅读836次。英特尔技术与制造事业部副总裁卞成刚7日在财富论坛间隙接受中新社记者采访时表示,该公司看好中国市场前景,扎根中国并以此走向世界是目前最重要的战略之一。卞成刚说,目前该公司正面临战略转型,即从传统PC服务领域扩展至所有智能设施领域,特别是移动终端。而中国目前正引领全球手机市场,预计未来手机、平板电脑等方面的发明创新将大量在中国市场涌现,并推向全球。持相同态度的还有英特尔中国区执行董事戈峻。戈峻
文章浏览阅读627次。https://blog.csdn.net/zrs19800702/article/details/53101213http://blog.csdn.net/lzw06061139/article/details/51445311https://my.oschina.net/linuxhunter/blog/654080rgw 概述Ceph 通过radosgw提供RES..._radosgw -c
文章浏览阅读3.7k次,点赞6次,收藏9次。我为什么选择ECharts ? 本周学校课程设计,原本随机佛系选了一个51单片机来做音乐播放器,结果在粗略玩了CN-DBpedia两天后才回过神,课设还没有开始整。于是懒癌发作,碍于身上还有比赛的作品没交,本菜鸡对硬件也没啥天赋,所以就直接把题目切换成软件方面的题目。写python的同学选择了一个时间序列数据的可视化曲线程序设计题目,果真python在数据可视化这一点性能很优秀。..._echarts 时间序列
文章浏览阅读1.6k次。事件类:/** * * * @className: EarlyWarnPublishEvent * * @description:数据风险预警发布事件 * * @param: * * @return: * * @throws: * * @author: lizz * * @date: 2020/05/06 15:31 * */public cl..._applicationeventpublisheraware
文章浏览阅读1.2k次。如需转载请注明出处!点击小图片转到图片查看的页面在Android开发中很常用到,抱着学习和分享的心态,在这里写下自己自定义的一个ImageView,可以实现类似微信朋友圈中查看图片的功能和效果。主要功能需求:1.缩放限制:自由缩放,有最大和最小的缩放限制 2居中显示:.若图片没充满整个ImageView,则缩放过程将图片居中 3.双击缩放:根据当前缩放的状态,双击放大两倍或缩小到原来 4.单指_imageview图片边界回弹