据说孔明棋是三国时期的诸葛亮发明的,所以叫孔明棋,成品是这样,就一百行代码就能实现,走棋的时候需要输入坐标,可以自己优化一下,使用easyx图形库,加入素材
听说能只剩下一颗棋的都很聪明,这下证明了我不是一个聪明的娃儿~照这视频走的剩下一颗棋
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
int main()
{
int i, j;
int a[8][8] = {0,3,4,5,6,7,8,9,
3,0,0,1,1,1,0,0,
4,0,0,1,1,1,0,0,
5,1,1,1,1,1,1,1,
6,1,1,1,2,1,1,1,
7,1,1,1,1,1,1,1,
8,0,0,1,1,1,0,0,
9,0,0,1,1,1,0,0};
while (1){
for (i = 0; i < 8; i++) {
for (j = 0; j < 8; j++) {
switch (a[i][j]) {
case 0:
printf(" ");
break;
case 1:
printf("●");
break;
case 2:
printf("○");
break;
case 3:
printf("1");
break;
case 4:
printf("2");
break;
case 5:
printf("3");
break;
case 6:
printf("4");
break;
case 7:
printf("5");
break;
case 8:
printf("6");
break;
case 9:
printf("7");
break;
}
}
printf("\n");
}
int i, j;
scanf_s("%d", &i,1);
scanf_s("%d", &j,1);
char jianpan = _getch();
switch (jianpan) {
case 72:
case 'w':
case 'W':
if (a[i][j] == 2) {
a[i][j] = 1;
a[i - 2][j] = 2;
a[i - 1][j] = 2;
}
break;
case 80:
case 's':
case 'S':
if (a[i][j] == 2) {
a[i][j] = 1;
a[i + 2][j] = 2;
a[i + 1][j] = 2;
}
break;
case 75:
case 'a':
case 'A':
if (a[i][j] == 2) {
a[i][j] = 1;
a[i][j - 2] = 2;
a[i][j - 1] = 2;
}
break;
case 77:
case 'd':
case 'D':
if (a[i][j] == 2) {
a[i][j] = 1;
a[i][j + 2] = 2;
a[i][j + 1] = 2;
}
break;
}
system("cls");
}
return 0;
}