一区二区三区在线-一区二区三区亚洲视频-一区二区三区亚洲-一区二区三区午夜-一区二区三区四区在线视频-一区二区三区四区在线免费观看

服務器之家:專注于服務器技術及軟件下載分享
分類導航

PHP教程|ASP.NET教程|Java教程|ASP教程|編程技術|正則表達式|C/C++|IOS|C#|Swift|Android|VB|R語言|JavaScript|易語言|vb.net|

服務器之家 - 編程語言 - Java教程 - Java編程實現五子棋人人對戰代碼示例

Java編程實現五子棋人人對戰代碼示例

2021-02-23 11:05在成為巨擘的路上 Java教程

這篇文章主要介紹了Java編程實現五子棋人人對戰代碼示例,具有一定借鑒價值,需要的朋友可以參考下。

利用java,在控制臺操作下,編寫的五子棋,作為復習二維數組,面向對象等基礎知識。w表示白棋,b表示黑棋

Java編程實現五子棋人人對戰代碼示例

?
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
import java.util.scanner;
 
public class mainmethod {
 
    public static char[][] c = new char[10][10];
 
    public static void main(string[] args) {
        mainmethod mainmethod = new mainmethod();
        mainmethod.init();
        int i;
        boolean color;
        int[] point = new int[2];
        scanner scanner = new scanner(system.in);
 
        for (i = 1; i < 100; i++) {
            mainmethod.draw();// 繪制棋盤
            system.out.println("請輸入坐標,范圍為(0,0)到(9,9)");
            int x = scanner.nextint();
            int y = scanner.nextint();
            if (i % 2 == 1)
                color = true;
            else
                color = false;
            point[0] = x;
            point[1] = y;
            if (mainmethod.paint(point, color) == false) {//
                system.out.println("下的位置不合理,請重新開始");
                break;
            }
            if (mainmethod.win() == 1) {
                mainmethod.draw();
                system.out.println("恭喜白棋贏!!");
                break;
            } else if (mainmethod.win() == -1) {
                mainmethod.draw();
                system.out.println("恭喜黑棋贏!!");
                break;
            }
 
        }
 
        if (i == 100)
            system.out.println("平局");
 
    }
 
    public char[][] init() {// 初始化棋盤
        for (int i = 0; i < c.length; i++) {
            for (int j = 0; j < c.length; j++) {
                c[i][j] = '+';
            }
        }
        return c;
    }
 
    public boolean paint(int[] point, boolean colr) {// 判斷下的位置是否正確,若正確改變棋盤
        boolean b = true;
        int x = point[0];
        int y = point[1];
 
        if (inboard(point) == false || c[x][y] == 'w' || c[x][y] == 'b' || x < 0) {
            b = false;
            return b;
        }
 
        else if (colr == true) {// 白棋下
            if (c[x][y] == '+') {
                c[x][y] = 'w';
            }
        }
 
        else if (colr == false) {// 黑棋下
            if (c[x][y] == '+') {
                c[x][y] = 'b';
            }
        }
        return b;
    }
 
    public boolean inboard(int[] point) {// 判斷point是否在棋盤上
        int x = point[0];
        int y = point[1];
        if (x < 0 || y < 0 || x >= c.length || y >= c.length)
            return false;
        else
            return true;
 
    }
 
    public int win() {// 判斷輸贏,1表示白的贏,-1黑的贏,0暫無輸贏
        int whowin = 0;
 
        int[] point = new int[2];
        outer: while (true) {
            for (int i = 0; i < c.length; i++) {
                for (int j = 0; j < c.length; j++) {
 
                    if (c[i][j] == 'w') {// 遍歷數組,找到的第一個白棋
                        point[0] = i;
                        point[1] = j + 4;
 
                        if (inboard(point)) {// 如果存在向右數4個的棋盤
                            if (c[i][j + 1] == 'w' && c[i][j + 2] == 'w' && c[i][j + 3] == 'w' && c[i][j + 4] == 'w') {
                                whowin = 1;
                                break outer;
                            }
                        }
 
                        point[0] = i + 4;
                        point[1] = j + 4;
 
                        if (inboard(point)) {// 如果存在向右,向下數4個的棋盤
                            if (c[i + 1][j + 1] == 'w' && c[i + 2][j + 2] == 'w' && c[i + 3][j + 3] == 'w'
                                    && c[i + 4][j + 4] == 'w') {
                                whowin = 1;
                                break outer;
                            }
                        }
 
                        point[0] = i + 4;
                        point[1] = j;
 
                        if (inboard(point)) {// 如果存在向下數4個的棋盤
                            if (c[i + 1][j] == 'w' && c[i + 2][j] == 'w' && c[i + 3][j] == 'w' && c[i + 4][j] == 'w') {
                                whowin = 1;
                                break outer;
                            }
                        }
 
                        point[0] = i - 4;
                        point[1] = j + 4;
 
                        if (inboard(point)) {// 如果存在向左,向下數4個的棋盤
                            if (c[i - 1][j + 1] == 'w' && c[i - 2][j + 2] == 'w' && c[i - 3][j + 3] == 'w'
                                    && c[i - 4][j + 4] == 'w') {
                                whowin = 1;
                                break outer;
                            }
                        }
 
                    } else if (c[i][j] == 'b') {
                        point[0] = i;
                        point[1] = j + 4;
 
                        if (inboard(point)) {// 如果存在向右數4個的棋盤
                            if (c[i][j + 1] == 'b' && c[i][j + 2] == 'b' && c[i][j + 3] == 'b' && c[i][j + 4] == 'b') {
                                whowin = -1;
                                break outer;
                            }
                        }
 
                        point[0] = i + 4;
                        point[1] = j + 4;
 
                        if (inboard(point)) {// 如果存在向右,向下數4個的棋盤
                            if (c[i + 1][j + 1] == 'b' && c[i + 2][j + 2] == 'b' && c[i + 3][j + 3] == 'b'
                                    && c[i + 4][j + 4] == 'b') {
                                whowin = -1;
                                break outer;
                            }
                        }
 
                        point[0] = i + 4;
                        point[1] = j;
 
                        if (inboard(point)) {// 如果存在向下數4個的棋盤
                            if (c[i + 1][j] == 'b' && c[i + 2][j] == 'b' && c[i + 3][j] == 'b' && c[i + 4][j] == 'b') {
                                whowin = -1;
                                break outer;
                            }
                        }
 
                        point[0] = i - 4;
                        point[1] = j + 4;
 
                        if (inboard(point)) {// 如果存在向左,向下數4個的棋盤
                            if (c[i - 1][j + 1] == 'b' && c[i - 2][j + 2] == 'b' && c[i - 3][j + 3] == 'b'
                                    && c[i - 4][j + 4] == 'b') {
                                whowin = -1;
                                break outer;
                            }
                        }
 
                    }
 
                }
            }
            whowin = 0;
            break outer;
 
        }
        return whowin;
    }
 
    public void draw() {// 繪制棋盤
        for (int i = 0; i < c.length; i++) {
            for (int j = 0; j < c.length; j++) {
                system.out.print(c[i][j] + " ");
            }
            system.out.println();
        }
    }
 
}

運行結果:

?
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
+ + + + + + + + + + 
+ + + + + + + + + + 
+ + + + + + + + + + 
+ + + + + + + + + + 
+ + + + + + + + + + 
+ + + + + + + + + + 
+ + + + + + + + + + 
+ + + + + + + + + + 
+ + + + + + + + + + 
+ + + + + + + + + + 
請輸入坐標,范圍為(0,0)到(9,9
4
6
+ + + + + + + + + + 
+ + + + + + + + + + 
+ + + + + + + + + + 
+ + + + + + + + + + 
+ + + + + + w + + + 
+ + + + + + + + + + 
+ + + + + + + + + + 
+ + + + + + + + + + 
+ + + + + + + + + + 
+ + + + + + + + + + 
請輸入坐標,范圍為(0,0)到(9,9
6
5
+ + + + + + + + + + 
+ + + + + + + + + + 
+ + + + + + + + + + 
+ + + + + + + + + + 
+ + + + + + w + + + 
+ + + + + + + + + + 
+ + + + + b + + + + 
+ + + + + + + + + + 
+ + + + + + + + + + 
+ + + + + + + + + + 
請輸入坐標,范圍為(0,0)到(9,9

誰輸誰贏我就不弄出來了,太長,占地。。

總結

以上就是本文關于java編程實現五子棋人人對戰代碼示例的全部內容,希望對大家有所幫助。感興趣的朋友可以繼續參閱本站其他相關專題,如有不足之處,歡迎留言指出。感謝朋友們對本站的支持!

原文鏈接:http://blog.csdn.net/qq_24065713/article/details/71509200

延伸 · 閱讀

精彩推薦
主站蜘蛛池模板: 国产亚洲福利精品一区 | 99视频九九精品视频在线观看 | 四影虎库最新2021 | 99久久er这里只有精品17 | 午夜毛片在线观看 | 四虎精品成人a在线观看 | 亚洲视频在线看 | 亚洲久操 | 国内会所按摩推拿国产 | 吻戏辣妞范1000免费体验 | 36美女厕所撒尿全过程 | 91精品国产高清久久久久久 | 草逼视频免费看 | 91精品国产91久久久久久 | 日本大片网 | 嫩草视频在线观看免费 | 3d动漫h在线观看网站蜜芽 | 国产精品视频网 | 厨房play黄瓜进去小说h | asianfemdom冷柔女王 | 欧美男女爱爱视频 | 2021最新国产成人精品视频 | 久草在线福利资站免费视频 | 欧式午夜理伦三级在线观看 | 香蕉久久一区二区不卡无毒影院 | www.大逼色| 古装一级无遮挡毛片免费观看 | 精品无码国产污污污免费网站2 | 国产毛片在线观看 | 日本不卡视频免费的 | 国产精品国产高清国产专区 | 成人影院免费在线观看 | 娇妻被健身教练挺进小说阅读 | 韩国女主播在线大尺无遮挡 | 亚洲日日操 | 天天做天天玩天天爽天天 | 乌克兰黄色录像 | 三级无删减高清在线影院 | 99国产精品免费观看视频 | 国产高清视频免费最新在线 | 女烈受刑重口小说 |