基于C語(yǔ)言實(shí)現(xiàn)五子棋游戲
采用二維數(shù)組制作五子棋,用坐標(biāo)下棋。
請(qǐng)看代碼。

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.人機(jī)對(duì)戰(zhàn)(暫未開(kāi)放)\n");
printf(" *3.游戲須知\n");
printf(" #############################################\n");
printf(" 請(qǐng)選擇選項(xiàng),目前僅有 1 選項(xiàng)\n");
printf("\n");
printf(" ");
xuanze = _getch();
switch (xuanze)
{
case 1:
break;
case 3:
printf("本游戲是鍵盤(pán)輸入坐標(biāo)來(lái)落子的,白棋先落,第二次落子為黑色,依次落子。\n");
printf("若落子坐標(biāo)非法則需重新落子。\n");
printf("鍵盤(pán)輸入1直接進(jìn)入游戲\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()//棋盤(pán)
{
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("*請(qǐng)選擇落子坐標(biāo)(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)有棋子,請(qǐng)重新輸入\n");
continue;
}
}
else if (i < 1 || i > 21 || j < 1 || j > 21)
{
printf("坐標(biāo)不合法,請(qǐng)重新輸入\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)專(zhuān)題,分享給大家:
以上就是本文的全部?jī)?nèi)容,希望對(duì)大家的學(xué)習(xí)有所幫助,也希望大家多多支持腳本之家。
- 基于C語(yǔ)言實(shí)現(xiàn)五子棋游戲完整實(shí)例代碼
- 純C語(yǔ)言實(shí)現(xiàn)五子棋
- C語(yǔ)言實(shí)現(xiàn)五子棋小游戲
- C語(yǔ)言實(shí)現(xiàn)簡(jiǎn)易五子棋
- C語(yǔ)言實(shí)現(xiàn)五子棋游戲
- C語(yǔ)言編寫(xiě)五子棋游戲
- C語(yǔ)言實(shí)現(xiàn)簡(jiǎn)單五子棋小游戲
- C語(yǔ)言實(shí)現(xiàn)五子棋人人對(duì)戰(zhàn)
- C語(yǔ)言實(shí)現(xiàn)簡(jiǎn)易五子棋小游戲
- 基于C語(yǔ)言實(shí)現(xiàn)簡(jiǎn)單五子棋游戲
相關(guān)文章
動(dòng)態(tài)數(shù)組C++實(shí)現(xiàn)方法(分享)
下面小編就為大家?guī)?lái)一篇?jiǎng)討B(tài)數(shù)組C++實(shí)現(xiàn)方法(分享)。小編覺(jué)得挺不錯(cuò)的,現(xiàn)在就分享給大家,也給大家做個(gè)參考。一起跟隨小編過(guò)來(lái)看看吧2017-05-05
Qt向ini文件寫(xiě)入中文出現(xiàn)亂碼問(wèn)題的解決方法詳解
這篇文章主要為大家詳細(xì)介紹了當(dāng)Qt向ini文件寫(xiě)入中文出現(xiàn)亂碼問(wèn)題時(shí)的解決方法,文中的示例代碼講解詳細(xì),感興趣的小伙伴可以跟隨小編一起學(xué)習(xí)一下2023-12-12
C語(yǔ)言計(jì)算連續(xù)無(wú)序數(shù)組中缺省數(shù)字方法詳解
這篇文章主要介紹了C語(yǔ)言計(jì)算連續(xù)無(wú)序數(shù)組中缺省數(shù)字方法,文中通過(guò)示例代碼介紹的非常詳細(xì),對(duì)大家的學(xué)習(xí)或者工作具有一定的參考學(xué)習(xí)價(jià)值,需要的朋友們下面隨著小編來(lái)一起學(xué)習(xí)吧2023-02-02
C++數(shù)據(jù)結(jié)構(gòu)二叉搜索樹(shù)的實(shí)現(xiàn)應(yīng)用與分析
從這篇博客開(kāi)始,我就要和大家介紹有關(guān)二叉搜索樹(shù)的知識(shí),它還衍生出了兩棵樹(shù)——AVL樹(shù)和紅黑樹(shù),在后面兩篇博客我都會(huì)介紹。今天先從二叉搜索樹(shù)開(kāi)始引入2022-02-02
詳解C++中typedef 和 #define 的區(qū)別
這篇文章主要介紹了C++中typedef 與 #define 的區(qū)別,本文通過(guò)實(shí)例代碼給大家介紹的非常詳細(xì),對(duì)大家的學(xué)習(xí)或工作具有一定的參考借鑒價(jià)值,需要的朋友可以參考下2021-09-09
C語(yǔ)言中計(jì)算二叉樹(shù)的寬度的兩種方式
這篇文章主要介紹了C語(yǔ)言中計(jì)算二叉樹(shù)的寬度的兩種方式的相關(guān)資料,需要的朋友可以參考下2017-04-04
C語(yǔ)言實(shí)現(xiàn)無(wú)頭單鏈表詳解
大家好,本篇文章主要講的是C語(yǔ)言實(shí)現(xiàn)無(wú)頭單鏈表詳解,感興趣的同學(xué)趕快來(lái)看一看吧,對(duì)你有幫助的話記得收藏一下2022-02-02
Cocos2d-x保存用戶(hù)游戲數(shù)據(jù)之XML文件是否存在問(wèn)題判斷方法
這篇文章主要介紹了Cocos2d-x保存用戶(hù)游戲數(shù)據(jù)之XML文件是否存在問(wèn)題判斷方法,請(qǐng)注意代碼中包含大量注釋,需要的朋友可以參考下2014-09-09

