-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfunctions.c
More file actions
355 lines (213 loc) · 5.48 KB
/
Copy pathfunctions.c
File metadata and controls
355 lines (213 loc) · 5.48 KB
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
#include "l_header.h"
#include "f_header.h"
char *subStr(char *str1, char *str2, int part) { /* subStr is a function that copies the part
substring of str1 to str2 and returns str2's
address - "parts" are strings seperated by spaces */
int i = 0, j = 0;
while(part > 1) {
while(str1[i] != ' ') /* cycle through parts */
i++;
i++;
part--;
}
/* here we have reached the part we want to copy */
while(!(str1[i] == ' ' || str1[i] == '\0')) { //copy chars until we find a space or end of char
str2[j] = str1[i];
i++;
j++;
}
str2[j] = '\0';
return str2;
}
int partCount(char *str) { /* partCount function just counts how many parts str has (counts spaces) */
int parts = 1, i = 0;
while(str[i] != '\0') {
if(str[i] == ' ')
parts++;
i++;
}
return parts;
}
void boardDisp(char **board, int size) { /* Displays the current state of the board */
int i, j;
//white
for(i = 0 ; i < size / 2 ; i++)
printf(" ");
printf(" W H I T E\n ");
//upper letters
for(i = 0 ; i < size ; i++)
printf("%c ", i + 65);
printf("\n ");
//_ _ _ _
for(i = 0 ; i < size ; i++)
printf("_ ");
printf("\n /");
// \_/ \_/
for(i = 0 ; i < size - 1 ; i++)
printf(" \\_/");
printf(" \\\n");
//Looping cells
for(i = 0 ; i < size ; i++) {
for(j = 0 ; j < i ; j++)
printf(" ");
for(j = 0 ; j < i ; j++)
printf(" ");
printf("%d", j + 1);
if(i < 9)
printf(" ");
printf("|");
for(j = 0 ; j < size ; j++) {
printf(" ");
if(board[i][j] != 'n')
printf("%c", board[i][j]);
else
printf(" ");
printf(" |");
}
printf(" %d", i + 1);
if (i == (size / 2 - 1))
printf(" B");
if (i == (size / 2))
printf(" A");
if (i == (size / 2 + 1))
printf(" K");
printf("\n");
for(j = 0 ; j < i ; j++)
printf(" ");
printf(" ");
for(j = 0 ; j < i ; j++)
printf(" ");
for(j = 0 ; j < size ; j++)
printf("\\_/ ");
if(i != size - 1)
printf("\\");
if (i == (size / 2 - 1))
printf(" L");
if (i == (size / 2))
printf(" C");
printf("\n");
}
printf("\n");
}
void next(int nextPlayer, int user) { /* Message for next Player */
if(!nextPlayer)
printf("White player ");
else
printf("Black player ");
if(nextPlayer == user)
printf("(human) ");
printf("plays now.\n");
}
int win(char **board, int size, int player) { /* Determines whether someone has won */
int i, *won;
*won = 0;
for(i = 0 ; i < size ; i++) {
if(board[i][0] == 'b') {
board[i][0] = 'n';
seq(board, size, i, 0, won, 'b');
board[i][0] = 'b';
if(*won) {
printf("\n");
break;
}
} else if(board[0][i] == 'w') {
board[0][i] = 'n';
seq(board, size, 0, i, won, 'w');
board[0][i] = 'w';
if(*won) {
printf("\n");
break;
}
}
}
if(*won) {
if(player)
printf("Black");
else
printf("White");
printf(" player wins!\n");
return 1;
} else { return 0; }
}
int seq(char **board, int size, int i, int j, int *won, char player) {
if((((i == size - 1) && (player == 'w')) || (j == size - 1) && (player == 'b'))) { /* Win Condition */
*won = 1;
printf("Win with path: %c%d", j+65, i+1);
return 0;
}
/* Board Copy */
char **copy;
copy = malloc(size * sizeof(char *));
for(int z = 0 ; z < size ; z++)
copy[z] = malloc(size * sizeof(char));
for(int z = 0 ; z < size ; z++)
for(int k = 0 ; k < size ; k++)
copy[z][k] = board[z][k];
/* Check "neighbour-cells" */
if((i - 1 >= 0) && !(*won)) {
if (board[i-1][j] == player) {
board[i-1][j] = 'n';
seq(board, size, i-1, j, won, player);
board[i-1][j] = player;
if(*won)
printf(" - %c%d", j+65, i+1);
}
}
if((i + 1 < size) && !(*won)) {
if(board[i+1][j] == player) {
board[i+1][j] = 'n';
seq(board, size, i+1, j, won, player);
board[i+1][j] = player;
if(*won)
printf(" - %c%d", j+65, i+1);
}
}
if((j - 1 >= 0) && !(*won)) {
if(board[i][j-1] == player) {
board[i][j-1] = 'n';
seq(board, size, i, j-1, won, player);
board[i][j-1] = player;
if(*won)
printf(" - %c%d", j+65, i+1);
}
}
if((j < size) && !(*won)) {
if(board[i][j+1] == player) {
board[i][j+1] = 'n';
seq(board, size, i, j+1, won, player);
board[i][j+1] = player;
if(*won)
printf(" - %c%d", j+65, i+1);
}
}
if((j + 1 < size) && (i - 1 >= 0) && !(*won)) {
if((board[i-1][j+1] == player)) {
board[i-1][j+1] = 'n';
seq(board, size, i-1, j+1, won, player);
board[i-1][j+1] = player;
if(*won)
printf(" - %c%d", j+65, i+1);
}
}
if((j - 1 >= 0) && (i + 1 < size) && !(*won)) {
if(board[i+1][j-1] == player) {
board[i+1][j-1] = 'n';
seq(board, size, i+1, j-1, won, player);
board[i+1][j-1] = player;
if(*won)
printf(" - %c%d", j+65, i+1);
}
}
}
int max(int var1, int var2) { /* Returns bigger int */
if(var1 >= var2)
return var1;
else
return var2;
}
int min(int var1, int var2) { /* Returns smaller int */
if(var1 <= var2)
return var1;
else
return var2;
}