-
Notifications
You must be signed in to change notification settings - Fork 0
/
Lab7Part1.c
436 lines (382 loc) · 12.9 KB
/
Lab7Part1.c
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
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
#include <stdio.h>
#include <stdbool.h>
//print board
void printBoard(char board[][26], int n);
//checks whether the specified (row, col) lies within the board dimensions
bool isAvaliableMove(char board[][26], int n, char player);
void chessMove(char* gridPoint, char player);
void newChessMove(char board[][26], int n, int row, int col, char player);
void updateChessInDirection(char board[][26], int n, char row, char col, char player, int deltaRow, int deltaCol);
bool positionInBounds(int n, char row, char col);
bool checkLegalInDirection(char board[][26], int n, char row, char col, char colour, int deltaRow, int deltaCol);
bool checkMove(char board[][26], int n, int row, int col, char player);
void printAvaliableMove(char board[][26], int n, char player);
void AIMove(char board[][26], int n, char color);
int getScore(char board[][26], int n, int row, int col, char color);
int getFinalScore(char board[][26], int n, char player);
int flipInDirection(char board[][26], int n, char row, char col, char color, int deltaRow, int deltaCol);
// basic helper functions
int letterToNumber(char letter);
char numberToLetter(int number);
int main(int argc, char **argv){
char winner = 'U';
int dimension, row, col;
char userInput[2];
char computer;
int rowenter, colenter;
char movecolor = 'B';
// intialize the board
printf("Enter the board dimension: ");
scanf("%d", &dimension);
char board[26][26];
for(row = 0; row < dimension; row ++){
for(col = 0; col < dimension; col ++){
if (row == dimension / 2 - 1){
if (col == dimension / 2 - 1){
board[row][col] = 'W';
}else if (col == dimension / 2){
board[row][col] = 'B';
}else{
board[row][col] = 'U';
}
}else if (row == dimension / 2){
if (col == dimension / 2 - 1){
board[row][col] = 'B';
}else if (col == dimension / 2){
board[row][col] = 'W';
}else{
board[row][col] = 'U';
}
}else{
board[row][col] = 'U';
}
}
}
// request for the color of AI
printf("Computer plays (B/W) : ");
scanf(" %c", &computer);
// print board before the game starts
printBoard(board, dimension);
// start game
// Enter the loop. If no avalible move then exit
while(winner == 'U' && (isAvaliableMove(board, dimension, 'W') || isAvaliableMove(board, dimension, 'B'))){
// if avaliablemove for movecolor
if (isAvaliableMove(board, dimension, movecolor)){
if (computer == movecolor){
AIMove(board, dimension, movecolor);
}else{
// Request enter a move
printf("Enter move for colour %c (RowCol): ", movecolor);
scanf("%s", userInput);
// analyze the input of user
rowenter = letterToNumber(userInput[0]);
colenter = letterToNumber(userInput[1]);
// legal than continue, else exit
if(checkMove(board, dimension, rowenter, colenter, movecolor)){
newChessMove(board, dimension, rowenter, colenter, movecolor);
}else{
printf("Invalid move.\n");
winner = computer;
}
}
// print board if board changed
if (winner == 'U'){
printBoard(board, dimension);
}
} else {
printf("%c player has no valid move.\n", movecolor);
}
// change movecolor every time
if (movecolor == 'B'){
movecolor = 'W';
}else{
movecolor = 'B';
}
}
if (winner == 'U'){
int score1 = getFinalScore(board, dimension, 'B');
int score2 = getFinalScore(board, dimension, 'W');
if (score1 > score2){
printf("B player wins.\n");
}else if (score1 == score2){
printf("Draw!\n");
}else if (score1 < score2){
printf("W player wins.\n");
}
}else{
printf("%c player wins.\n",winner);
}
return 0;
}
// AI: where to put the chess
void AIMove(char board[][26], int n, char color){
char score[26][26];
int row, col;
int finalrow, finalcol;
int maxscore = 0;
// calculate score for every grid
for (row = 0; row < n; row ++){
for (col = 0; col < n; col ++){
score[row][col] = getScore(board, n, row, col, color);
if (score[row][col] > maxscore){
maxscore = score[row][col];
finalrow = row;
finalcol = col;
}
}
}
// if Valid, then move
if(checkMove(board, n, finalrow, finalcol, color)){
printf("Computer places %c at %c%c.\n", color, numberToLetter(finalrow), numberToLetter(finalcol));
newChessMove(board, n, finalrow, finalcol, color);
}else{
printf("%c player has no valid move.\n", color);
}
}
// AI: get score for a single grid
int getScore(char board[][26], int n, int row, int col, char color){
int score = 0;
bool occupied = false;
int rowCheckDir, colCheckDir;
//printf("check: row=%d, col=%d, grid=%c\n",row, col, board[row][col]);
if(board[row][col] != 'U'){
occupied = true;
score = -1;
}
// if the grid is unoccupied, cal the socre
if (!occupied){
for(rowCheckDir = -1; rowCheckDir <= 1; rowCheckDir++){
for(colCheckDir = -1; colCheckDir <= 1; colCheckDir++){
if (!(rowCheckDir==0 && colCheckDir==0) && checkLegalInDirection(board, n, numberToLetter(row), numberToLetter(col), color, rowCheckDir, colCheckDir)){
score += flipInDirection(board, n, numberToLetter(row), numberToLetter(col), color, rowCheckDir, colCheckDir);
}
}
}
}
return score;
}
// analyze the board, return the number of chesses on board of player
int getFinalScore(char board[][26], int n, char player){
int score = 0;
int row, col;
// increment score when detect player's chess
for (row = 0; row < n; row ++){
for (col = 0; col < n; col ++){
if (board[row][col] == player){
score++;
}
}
}
return score;
}
// print the board
void printBoard(char board[][26], int n){
int row = 0; int col = 0;
for(row = -1; row < n; row ++){
for(col = -2; col < n; col ++){
// if the first row or first colomn
if(row == -1){
if(col != -1 && col != -2){
printf("%c", col + 97);
}else{
printf(" ");
}
}else if (col == -2){
printf("%c", row + 97);
}else if (col == -1){
printf(" ");
}else{
printf("%c", board[row][col]);
}
// determine whether to start a new line
if (col == n - 1) {
printf("\n");
}
}
}
}
// row and col starts from 0
bool positionInBounds(int n, char row, char col){
if (row >= n || col >= n){
return false;
}else{
return true;
}
}
// Move single chess
void chessMove(char* gridPoint, char player){
*gridPoint = player;
}
// If valid, the outcome of new chess
void newChessMove(char board[][26], int n, int row, int col, char player){
int rowCheckDir, colCheckDir;
// in case of invalid move, check first
if (checkMove(board, n, row, col, player)){
//################# UPDATE IN EIGHT DIRECTIONS####################//
for(rowCheckDir = -1; rowCheckDir <= 1; rowCheckDir++){
for(colCheckDir = -1; colCheckDir <= 1; colCheckDir++){
if (!(rowCheckDir==0 && colCheckDir==0)){
updateChessInDirection(board, n, numberToLetter(row), numberToLetter(col), player, rowCheckDir, colCheckDir);
}
}
}
chessMove(&board[row][col], player);
}
}
// change the color of in one direction
void updateChessInDirection(char board[][26], int n, char row, char col, char player, int deltaRow, int deltaCol){
int originalRow = letterToNumber(row);
int originalCol = letterToNumber(col);
int checkCol = originalCol + deltaCol;
int checkRow = originalRow + deltaRow;
bool changeColor = true;
char opponent;
// determine the color of opponent
if (player == 'W'){
opponent = 'B';
}else if (player == 'B'){
opponent = 'W';
}
// If valid then change the color
//
//printf("checkrow=%d checkcol=%d\n", row, col);
if (checkLegalInDirection(board, n, row, col, player, deltaRow, deltaCol)){
while (checkCol < n && checkRow < n && checkCol >= 0 && checkRow >= 0){
//printf("checkrow=%d checkcol=%d colour=%c\n", checkRow, checkCol, board[checkRow][checkCol]);
if(board[checkRow][checkCol] == 'U' || board[checkRow][checkCol] == player){
changeColor = false;
}
if (changeColor == true) {
chessMove(&board[checkRow][checkCol], player);
}
checkRow += deltaRow;
checkCol += deltaCol;
}
}
}
// return whether a legal move
bool checkLegalInDirection(char board[][26], int n, char row, char col, char color, int deltaRow, int deltaCol){
// convert letter expression to number expression
int originalRow = letterToNumber(row);
int originalCol = letterToNumber(col);
int number = 0;
// printf("row=%d, col=%d, deltaRow=%d, deltaCol=%d\n", originalRow, originalCol, deltaRow, deltaCol);
// the first encountered grid is opponent's chess or not
bool opponentflag = false;
int checkCol = originalCol + deltaCol;
int checkRow = originalRow + deltaRow;
char opponent;
// determine the color of opponent
if (color == 'W'){
opponent = 'B';
}else if (color == 'B'){
opponent = 'W';
}
if((originalRow + deltaRow < n) && (originalRow + deltaRow >= 0) && (originalCol + deltaCol < n)
&& (originalCol + deltaCol >= 0) && (board[originalRow + deltaRow][originalCol + deltaCol] == opponent)){
opponentflag = true;
}
while (opponentflag && checkCol < n && checkRow < n && checkCol >= 0 && checkRow >= 0){
//printf("check: row=%d, col=%d, grid=%c\n",checkRow, checkCol, board[checkRow][checkCol]);
if(board[checkRow][checkCol] == 'U'){
return false;
}
if(board[checkRow][checkCol] == color){
return true;
}
checkRow += deltaRow;
checkCol += deltaCol;
number++;
}
return false;
}
// return whether a move for player is avaliable
bool checkMove(char board[][26], int n, int row, int col, char player){
bool avaliable = false;
bool occupied = false;
int rowCheckDir, colCheckDir;
//printf("check: row=%d, col=%d, grid=%c\n",row, col, board[row][col]);
if(board[row][col] != 'U'){
occupied = true;
}
if (!occupied){
for(rowCheckDir = -1; rowCheckDir <= 1; rowCheckDir++){
for(colCheckDir = -1; colCheckDir <= 1; colCheckDir++){
if ( !avaliable && !(rowCheckDir==0 && colCheckDir==0) && checkLegalInDirection(board, n, numberToLetter(row), numberToLetter(col), player, rowCheckDir, colCheckDir)){
avaliable = true;
}
}
}
}
return avaliable;
}
// print all avaliable moves for player
void printAvaliableMove(char board[][26], int n, char player){
int row, col;
printf("Available moves for %c:\n", player);
for (row = 0; row < n; row ++){
for (col = 0; col < n; col ++){
if (checkMove(board, n, row, col, player)){
printf("%c%c\n",numberToLetter(row), numberToLetter(col));
}
}
}
}
// return whether avaliable moves for player
bool isAvaliableMove(char board[][26], int n, char player){
int row, col;
for (row = 0; row < n; row ++){
for (col = 0; col < n; col ++){
if (checkMove(board, n, row, col, player)){
return true;
}
}
}
return false;
}
// return letter expression to number
int letterToNumber(char letter){
return letter - 97;
}
// return number expression to letter
char numberToLetter(int number){
return number + 97;
}
// return the chess can be fliped in one direction
int flipInDirection(char board[][26], int n, char row, char col, char color, int deltaRow, int deltaCol){
// convert letter expression to number expression
int originalRow = letterToNumber(row);
int originalCol = letterToNumber(col);
int number = 0;
// printf("row=%d, col=%d, deltaRow=%d, deltaCol=%d\n", originalRow, originalCol, deltaRow, deltaCol);
// the first encountered grid is opponent's chess or not
bool opponentflag = false;
int checkCol = originalCol + deltaCol;
int checkRow = originalRow + deltaRow;
char opponent;
// determine the color of opponent
if (color == 'W'){
opponent = 'B';
} else if (color == 'B'){
opponent = 'W';
}
// if in bound, and the first chess is opponent, then continue
if((originalRow + deltaRow < n) && (originalRow + deltaRow >= 0) && (originalCol + deltaCol < n)
&& (originalCol + deltaCol >= 0) && (board[originalRow + deltaRow][originalCol + deltaCol] == opponent)){
opponentflag = true;
}
// increment number, until detect player
while (opponentflag && checkCol < n && checkRow < n && checkCol >= 0 && checkRow >= 0){
if(board[checkRow][checkCol] == 'U'){
return 0;
}
if(board[checkRow][checkCol] == color){
return number;
}else{
number++;
}
checkRow += deltaRow;
checkCol += deltaCol;
}
return number;
}