基于C語言實現(xiàn)五子棋游戲
更新時間:2020年11月03日 16:34:37 作者:文件傳渝助手
這篇文章主要為大家詳細介紹了基于C語言實現(xiàn)五子棋游戲,文中示例代碼介紹的非常詳細,具有一定的參考價值,感興趣的小伙伴們可以參考一下
采用二維數(shù)組制作五子棋,用坐標下棋。
請看代碼。

include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<windows.h>
#include<conio.h>
#include<time.h>
void menu()//目錄
{
char xuanze = 0,xuanze2;
printf("\n");
printf("\n");
printf(" #############################################\n");
printf(" *五子棋小游戲*\n");
printf(" *1.雙人游戲*\n");
printf(" *2.人機對戰(zhàn)(暫未開放)\n");
printf(" *3.游戲須知\n");
printf(" #############################################\n");
printf(" 請選擇選項,目前僅有 1 選項\n");
printf("\n");
printf(" ");
xuanze = _getch();
switch (xuanze)
{
case 1:
break;
case 3:
printf("本游戲是鍵盤輸入坐標來落子的,白棋先落,第二次落子為黑色,依次落子。\n");
printf("若落子坐標非法則需重新落子。\n");
printf("鍵盤輸入1直接進入游戲\n");
}
}
int t = 2;
int pan[20][20] =
{
{1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3},
{4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,6},
{4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,6},
{4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,6},
{4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,6},
{4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,6},
{4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,6},
{4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,6},
{4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,6},
{4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,6},
{4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,6},
{4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,6},
{4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,6},
{4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,6},
{4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,6},
{4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,6},
{4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,6},
{4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,6},
{4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,6},
{7,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,9}
};
void qp()//棋盤
{
int i, j, k = 0;
printf(" ");
for (i = 0; i < 10; i++)
printf(" %d", i + 1);
for (i = 10; i < 20; i++)
printf("%d", i + 1);
printf("\n");
printf("1 ");
//printf("┌ ┬ ┐├ ┼ ┤└ ┴ ┘│ ");©○●┼
for (i = 0; i < 20; i++)
for (j = 0; j < 20; j++)
{
switch (pan[i][j])
{
case 1:
printf("┌ ");
k++;
if (k % 20 == 0)
{
printf("\n");
}
break;
case 2:
printf("┬ ");
k++;
if (k % 20 == 0)
printf("\n");
break;
case 3:
printf("┐ ");
k++;
if (k % 20 == 0)
{
printf("%d", i+1);
printf("\n");
printf("%d ", i + 1);
}
break;
case 4:
printf("├ ");
k++;
if (k % 20 == 0)
printf("\n");
break;
case 5:
printf("┼ ");
k++;
if (k % 20 == 0)
printf("\n");
break;
case 6:
printf("┤ ");
k++;
if (k % 20 == 0)
{
printf("%d", i+1);
printf("\n");
if(i<8)
printf("%d ", i + 2);
if(i>7)
printf("%d", i + 2);
}
break;
case 7:
printf("└ ");
k++;
if (k % 20 == 0)
printf("\n");
break;
case 8:
printf("┴ ");
k++;
if (k % 20 == 0)
printf("\n");
break;
case 9:
printf("┘ ");
k++;
if (k % 20 == 0)
{
printf("%d", i + 1);
printf("\n");
}
break;
case 10:
printf("○");
k++;
if (k % 20 == 0)
{
printf("%d", i+1);
printf("\n");
}
break;
case 11:
printf("●");
k++;
if (k % 20 == 0)
{
printf("%d", i+1);
printf("\n");
}
break;
}
}
printf(" ");
for (i = 0; i < 10; i++)
printf(" %d", i + 1);
for (i = 10; i < 20; i++)
printf("%d", i + 1);
printf("\n");
printf("\n");
}
void play()
{
int i, j;
while (1)
{
printf("*請選擇落子坐標(x,y): ");
scanf_s("%d %d", &j, &i);
printf("\n");
if(i>0&&i<21&&j>0&&j<21)
{
if (pan[i - 1][j - 1] != 10 && pan[i - 1][j - 1] != 11)
{
if (t % 2 == 1)
{
t++;
pan[i - 1][j - 1] = 11;
break;
}
else if (t % 2 == 0)
{
t++;
pan[i - 1][j - 1] = 10;
break;
}
}
else if (pan[i-1][j-1] == 10 || pan[i-1][j-1] == 11)
{
printf("此處已經(jīng)有棋子,請重新輸入\n");
continue;
}
}
else if (i < 1 || i > 21 || j < 1 || j > 21)
{
printf("坐標不合法,請重新輸入\n");
continue;
}
}
}
void test()
{
int i, j;
for(i=0;i<20;i++)
for (j = 0; j < 20; j++)
{
if (pan[i][j] != 1 || 2 || 3 || 4 || 5 || 6 || 7 || 8 || 9)
{
if (pan[i][j] == pan[i][j + 1]&&pan[i][j] == pan[i][j + 2]&&pan[i][j] == pan[i][j + 3]&&pan[i][j] == pan[i][j + 4])
{
if (pan[i][j] == 11)
{
printf("白棋獲勝\n");
}
if (pan[i][j] == 10)
{
printf("黑棋獲勝\n");
}
}
if (pan[i][j] == pan[i + 1][j]&&pan[i][j] == pan[i + 2][j]&&pan[i][j] == pan[i + 3][j]&&pan[i][j] == pan[i + 4][j])
{
if (pan[i][j] == 11)
{
printf("白棋獲勝\n");
}
if (pan[i][j] == 10)
{
printf("黑棋獲勝\n");
}
}
if (pan[i][j] == pan[i + 1][j + 1]&&pan[i][j] == pan[i + 2][j + 2]&&pan[i][j] == pan[i + 3][j + 3] &&pan[i][j]== pan[i + 4][j + 4])
{
if (pan[i][j] == 11)
{
printf("白棋獲勝\n");
}
if (pan[i][j] == 10)
{
printf("黑棋獲勝\n");
}
}
if (pan[i][j] == pan[i - 1][j + 1]&&pan[i][j] == pan[i - 2][j + 2] &&pan[i][j]== pan[i - 3][j + 3]&&pan[i][j] == pan[i - 4][j + 4])
{
if (pan[i][j] == 11)
{
printf("白棋獲勝\n");
}
if (pan[i][j] == 10)
{
printf("黑棋獲勝\n");
}
}
}
}
}
int main()
{
system("mode con cols=98 lines=48");
SetConsoleTitleA("五子棋小游戲"); //設(shè)置窗口
menu();
system("cls");
while (1)
{
qp();
test();
play();
system("cls");
}
system("pause");
return 0;
}
更多有趣的經(jīng)典小游戲?qū)崿F(xiàn)專題,分享給大家:
以上就是本文的全部內(nèi)容,希望對大家的學習有所幫助,也希望大家多多支持腳本之家。
相關(guān)文章
一文詳解C++關(guān)鍵字nullptr及與NULL的區(qū)別
這篇文章主要給大家詳細介紹了C++關(guān)鍵字nullptr,及?NULL與nullptr的區(qū)別,文中通過代碼示例介紹的非常詳細,需要的朋友可以參考下2023-06-06
C++?shared_ptr智能指針reset()使用示例詳解
這篇文章主要為大家介紹了C++?shared_ptr智能指針reset()使用示例詳解,有需要的朋友可以借鑒參考下,希望能夠有所幫助,祝大家多多進步,早日升職加薪2023-08-08
Qt連接數(shù)據(jù)庫并實現(xiàn)數(shù)據(jù)庫增刪改查的圖文教程
QT連接數(shù)據(jù)庫是應用開發(fā)的常用基礎(chǔ)操作,經(jīng)過實驗我總結(jié)了一些例程,下面這篇文章主要給大家介紹了關(guān)于Qt連接數(shù)據(jù)庫并實現(xiàn)數(shù)據(jù)庫增刪改查的相關(guān)資料,文中通過實例代碼介紹的非常詳細,需要的朋友可以參考下2023-04-04

