這篇文章主要介紹了C語(yǔ)言如何編寫(xiě)五子棋游戲,具有一定借鑒價(jià)值,感興趣的朋友可以參考下,希望大家閱讀完這篇文章之后大有收獲,下面讓小編帶著大家一起了解一下。
創(chuàng)新互聯(lián)專注為客戶提供全方位的互聯(lián)網(wǎng)綜合服務(wù),包含不限于成都網(wǎng)站制作、成都網(wǎng)站設(shè)計(jì)、略陽(yáng)網(wǎng)絡(luò)推廣、重慶小程序開(kāi)發(fā)公司、略陽(yáng)網(wǎng)絡(luò)營(yíng)銷、略陽(yáng)企業(yè)策劃、略陽(yáng)品牌公關(guān)、搜索引擎seo、人物專訪、企業(yè)宣傳片、企業(yè)代運(yùn)營(yíng)等,從售前售中售后,我們都將竭誠(chéng)為您服務(wù),您的肯定,是我們最大的嘉獎(jiǎng);創(chuàng)新互聯(lián)為所有大學(xué)生創(chuàng)業(yè)者提供略陽(yáng)建站搭建服務(wù),24小時(shí)服務(wù)熱線:028-86922220,官方網(wǎng)址:jinyejixie.com
一、構(gòu)建棋盤(pán)
首先可以用一個(gè)二維數(shù)組來(lái)構(gòu)建棋盤(pán),下標(biāo)表示位置,內(nèi)容表示黑子白子或者空位。當(dāng)數(shù)組內(nèi)容為1時(shí),該位置為白字,當(dāng)數(shù)組為0時(shí),該位置為白子,空位輸出+
int w[11][11], flag = 0; int a, b; for (int k = 0; k < 11; k++) printf("第%d列\(zhòng)t", k); printf("\n"); for (int i = 0; i < 11; i++) { for (int j = 0; j < 11; j++) { if (w[i][j] == 0) printf("黑\t"); else if (w[i][j] == 1) printf("白\t"); else printf("+\t"); } printf("第%d行\(zhòng)n\n", i); }
二、判斷位置超范圍與錯(cuò)誤輸入
當(dāng)輸入的棋子坐標(biāo)超出范圍或者該位置已經(jīng)存在棋子,則再次輸入棋子坐標(biāo)。其中flag作為標(biāo)志作為判別黑手白手的標(biāo)志。
if (flag == 0) { printf("黑色下棋\n"); scanf("%d %d", &a, &b); while (a < 0 || a>10 || b < 0 || b>10) { printf("此位置超出范圍,請(qǐng)重新輸入:"); scanf("%d %d", &a, &b); } while (w[a][b] == 0 || w[a][b] == 1) { printf("此位置已有棋子,請(qǐng)重新輸入:"); scanf("%d %d", &a, &b); } flag = 1; w[a][b] = 0; } else { printf("白色下棋\n"); scanf("%d %d", &a, &b); while (a < 0 || a>10 || b < 0 || b>10) { printf("此位置超出范圍,請(qǐng)重新輸入:"); scanf("%d %d", &a, &b); } while (w[a][b] == 0 || w[a][b] == 1) { printf("此位置已有棋子,請(qǐng)重新輸入:"); scanf("%d %d", &a, &b); }
三、判斷勝負(fù)
在五子棋中,出現(xiàn)五個(gè)棋子排成一排或者一列或者斜排即可判為勝出。每當(dāng)落下一個(gè)棋子,對(duì)該棋子前后上下斜排五個(gè)棋子進(jìn)行判別,超過(guò)五個(gè)連續(xù)的一樣顏色的棋子則勝出。
int A = 1, B = 1, jieguo = 0, C = 1, D = 1; int x = 1, y = 1, m = 1, n = 1; if (w[a][b] == 1) { for (int i = 1; i < 5; i++) { if (w[a][b + i] == 1) A++; else break; } for (int i = 1; i < 5; i++) { if (w[a][b - i] == 1) A++; else break; } for (int i = 1; i < 5; i++) { if (w[a+i][b] == 1) C++; else break; } for (int i = 1; i < 5; i++) { if (w[a - i][b] == 1) C++; else break; } if (A > 4 || C > 4) jieguo = 1;//白棋勝利標(biāo)志 else { for (int i = 1; i < 5; i++) { if (w[a+i][b + i] == 1) x++; else break; } for (int i = 1; i < 5; i++) { if (w[a-i][b - i] == 1) x++; else break; } for (int i = 1; i < 5; i++) { if (w[a + i][b-i] == 1) y++; else break; } for (int i = 1; i < 5; i++) { if (w[a - i][b+i] == 1) y++; else break; } if (x > 4 || y > 4) jieguo = 1; } } if (w[a][b] == 0) { for (int i = 1; i < 5; i++) { if (w[a][b + i] == 0) B++; else break; } for (int i = 1; i < 5; i++) { if (w[a][b - i] == 0) B++; else break; } for (int i = 1; i < 5; i++) { if (w[a + i][b] == 0) D++; else break; } for (int i = 1; i < 5; i++) { if (w[a - i][b] == 0) D++; else break; } if (B > 4 || D > 4) jieguo = 2;//黑棋勝利標(biāo)志 else { for (int i = 1; i < 5; i++) { if (w[a + i][b + i] == 0) m++; else break; } for (int i = 1; i < 5; i++) { if (w[a - i][b - i] == 0) m++; else break; } for (int i = 1; i < 5; i++) { if (w[a + i][b - i] == 0) n++; else break; } for (int i = 1; i < 5; i++) { if (w[a - i][b + i] == 0) n++; else break; } if (m > 4 || n > 4) jieguo = 2; } }
程序完成
四、演示結(jié)果
五、源代碼
int main() { int w[11][11], flag = 0; int a, b; while (1) { if (flag == 0) { printf("黑色下棋\n"); scanf("%d %d", &a, &b); while (a < 0 || a>10 || b < 0 || b>10) { printf("此位置超出范圍,請(qǐng)重新輸入:"); scanf("%d %d", &a, &b); } while (w[a][b] == 0 || w[a][b] == 1) { printf("此位置已有棋子,請(qǐng)重新輸入:"); scanf("%d %d", &a, &b); } flag = 1; w[a][b] = 0; } else { printf("白色下棋\n"); scanf("%d %d", &a, &b); while (a < 0 || a>10 || b < 0 || b>10) { printf("此位置超出范圍,請(qǐng)重新輸入:"); scanf("%d %d", &a, &b); } while (w[a][b] == 0 || w[a][b] == 1) { printf("此位置已有棋子,請(qǐng)重新輸入:"); scanf("%d %d", &a, &b); } flag = 0; w[a][b] = 1; } int A = 1, B = 1, jieguo = 0, C = 1, D = 1; int x = 1, y = 1, m = 1, n = 1; if (w[a][b] == 1) { for (int i = 1; i < 5; i++) { if (w[a][b + i] == 1) A++; else break; } for (int i = 1; i < 5; i++) { if (w[a][b - i] == 1) A++; else break; } for (int i = 1; i < 5; i++) { if (w[a+i][b] == 1) C++; else break; } for (int i = 1; i < 5; i++) { if (w[a - i][b] == 1) C++; else break; } if (A > 4 || C > 4) jieguo = 1;//白棋勝利標(biāo)志 else { for (int i = 1; i < 5; i++) { if (w[a+i][b + i] == 1) x++; else break; } for (int i = 1; i < 5; i++) { if (w[a-i][b - i] == 1) x++; else break; } for (int i = 1; i < 5; i++) { if (w[a + i][b-i] == 1) y++; else break; } for (int i = 1; i < 5; i++) { if (w[a - i][b+i] == 1) y++; else break; } if (x > 4 || y > 4) jieguo = 1; } } if (w[a][b] == 0) { for (int i = 1; i < 5; i++) { if (w[a][b + i] == 0) B++; else break; } for (int i = 1; i < 5; i++) { if (w[a][b - i] == 0) B++; else break; } for (int i = 1; i < 5; i++) { if (w[a + i][b] == 0) D++; else break; } for (int i = 1; i < 5; i++) { if (w[a - i][b] == 0) D++; else break; } if (B > 4 || D > 4) jieguo = 2;//黑棋勝利標(biāo)志 else { for (int i = 1; i < 5; i++) { if (w[a + i][b + i] == 0) m++; else break; } for (int i = 1; i < 5; i++) { if (w[a - i][b - i] == 0) m++; else break; } for (int i = 1; i < 5; i++) { if (w[a + i][b - i] == 0) n++; else break; } for (int i = 1; i < 5; i++) { if (w[a - i][b + i] == 0) n++; else break; } if (m > 4 || n > 4) jieguo = 2; } } for (int k = 0; k < 11; k++) printf("第%d列\(zhòng)t", k); printf("\n"); for (int i = 0; i < 11; i++) { for (int j = 0; j < 11; j++) { if (w[i][j] == 0) printf("黑\t"); else if (w[i][j] == 1) printf("白\t"); else printf("+\t"); } printf("第%d行\(zhòng)n\n", i); } if (jieguo == 1) { printf("白棋勝利"); break; } if (jieguo == 2) { printf("黑棋勝利"); break; } } return 0; }
感謝你能夠認(rèn)真閱讀完這篇文章,希望小編分享的“C語(yǔ)言如何編寫(xiě)五子棋游戲”這篇文章對(duì)大家有幫助,同時(shí)也希望大家多多支持創(chuàng)新互聯(lián),關(guān)注創(chuàng)新互聯(lián)行業(yè)資訊頻道,更多相關(guān)知識(shí)等著你來(lái)學(xué)習(xí)!
網(wǎng)頁(yè)標(biāo)題:C語(yǔ)言如何編寫(xiě)五子棋游戲
標(biāo)題網(wǎng)址:http://jinyejixie.com/article8/jogiip.html
成都網(wǎng)站建設(shè)公司_創(chuàng)新互聯(lián),為您提供ChatGPT、搜索引擎優(yōu)化、網(wǎng)站收錄、Google、網(wǎng)站維護(hù)、品牌網(wǎng)站制作
聲明:本網(wǎng)站發(fā)布的內(nèi)容(圖片、視頻和文字)以用戶投稿、用戶轉(zhuǎn)載內(nèi)容為主,如果涉及侵權(quán)請(qǐng)盡快告知,我們將會(huì)在第一時(shí)間刪除。文章觀點(diǎn)不代表本網(wǎng)站立場(chǎng),如需處理請(qǐng)聯(lián)系客服。電話:028-86922220;郵箱:631063699@qq.com。內(nèi)容未經(jīng)允許不得轉(zhuǎn)載,或轉(zhuǎn)載時(shí)需注明來(lái)源: 創(chuàng)新互聯(lián)