-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSChess.c
1692 lines (1418 loc) · 42.2 KB
/
SChess.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
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* Copyright (C) 2016 Luca Sciullo
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#include <stdio.h>
#include <time.h>
#include <stdlib.h>
#include <unistd.h>
#include <string.h>
#include "SChess.h"
/*depth has to be an even value for considering opponent move, since decisionMinMax already makes a move*/
#define WHITE_DEPTH 2
#define BLACK_DEPTH 2
struct piece *board[ROWS][COLUMNS];
struct piece *last_move_board[ROWS][COLUMNS];
struct piece *tmp_last_move_board[ROWS][COLUMNS];
struct piece w_chess[CHESS_NUMBER];
struct piece b_chess[CHESS_NUMBER];
struct piece *last_moved = NULL;
struct timespec start, stop;
int human_moves_counter = 0;
/*variables for different game modes*/
int START_COLOR = WHITE_CHESS;
int HUMAN_PLAYER = 1;
int PRESS_ENTER = 0;
/*take time when move starts and ends*/
void
set_time(int what) {
long BILLION = 1000000000L;
int accum;
/*move starts*/
if(what == 0) {
if( clock_gettime( CLOCK_REALTIME, &start) == -1 ) {
perror( "clock gettime" );
exit( EXIT_FAILURE );
}
} else {
/*move ends*/
if( clock_gettime( CLOCK_REALTIME, &stop) == -1 ) {
perror( "clock gettime" );
exit( EXIT_FAILURE );
}
accum = ( stop.tv_sec - start.tv_sec )
+ ( stop.tv_nsec - start.tv_nsec )
/ BILLION;
printf( "Move required %ds\n", accum );
}
}
/*read a file where a previous match has been stored and resume the game*/
void
resume_match(char *match, FILE *report) {
FILE *f = NULL;
char * line = NULL;
size_t len = 0;
ssize_t read;
char * split_line;
char input_move[4];
int int_input_move[4];
int allowed_move = 0;
int pos[2];
f = fopen(match, "r");
if (f == NULL) {
printf("File %s not found\n", match);
exit(0);
}
while ((read = getline(&line, &len, f)) != -1) {
fprintf(report, "%s", line);
fflush(report);
split_line = strtok (line,":\t");
while (split_line!= NULL)
{
if(strlen(split_line ) == 5 && strcmp(split_line, "WHITE") != 0 && strcmp(split_line, "BLACK") != 0) {
memset(int_input_move, 0, 4);
strncpy(input_move, split_line, 4);
printf ("%s\n", input_move);
int_input_move[0] = input_move[0]%65;
int_input_move[1] = (int)strtol(&input_move[1], NULL, 10)-1;
int_input_move[2] = input_move[2]%65;
int_input_move[3] = (int)strtol(&input_move[3], NULL, 10)-1;
pos[0] = int_input_move[3];
pos[1] = int_input_move[2];
allowed_move = is_legal_human_move(int_input_move);
if(!allowed_move) {
printf("Found %s illegal move in the file %s\n", input_move, match);
exit(0);
} else {
make_move(board[int_input_move[1]][int_input_move[0]], pos);
}
printf ("%s\n", input_move);
}
split_line= strtok (NULL, ":\t");
}
}
fclose(f);
}
/*print the board or the fake board with colors*/
void
print_board(struct piece *fake_board[][COLUMNS]) {
int i = 0;
int j = 0;
if(fake_board == NULL) {
for(i = 7; i >= 0; i--) {
printf(YELLOW"%d\t"WHITE, i+1);
for(j = 0; j < 8; j++) {
if(board[i][j] == NULL) {
printf("%s\t", "-");
} else if(board[i][j]->color == WHITE_CHESS) {
printf(VIOLET"%d\t"WHITE, board[i][j]->type);
} else if(board[i][j]->color == BLACK_CHESS) {
printf(BLUE"%d\t"WHITE, board[i][j]->type);
}
}
printf("\n");
}
printf("\n");
for(j = -1; j < 8; j++) {
if(j == -1)
printf("\t");
else
printf(YELLOW"%s\t"WHITE, LETTERS[j]);
}
printf("\n");
} else {
for(i = 7; i >= 0; i--) {
for(j = 0; j < 8; j++) {
if(fake_board[i][j] == NULL) {
printf("%s\t", "-");
} else if(fake_board[i][j]->color == WHITE_CHESS) {
printf(VIOLET"%d\t"WHITE, fake_board[i][j]->type);
} else if(fake_board[i][j]->color == BLACK_CHESS) {
printf(BLUE"%d\t"WHITE, fake_board[i][j]->type);
}
}
printf("\n");
}
}
fflush(stdout);
}
/*create chess*/
void
create_chess() {
int i = 0;
for(i = 0; i < CHESS_NUMBER; i++) {
w_chess[i].color = WHITE_CHESS;
w_chess[i].n_moves = 0;
w_chess[i].n_fake_moves = 0;
w_chess[i].type = PAWN;
w_chess[i].pos[0] = -1;
w_chess[i].pos[1] = -1;
w_chess[i].dead = 0;
b_chess[i].color = BLACK_CHESS;
b_chess[i].n_moves = 0;
b_chess[i].n_fake_moves = 0;
b_chess[i].type = PAWN;
b_chess[i].pos[0] = -1;
b_chess[i].pos[1] = -1;
b_chess[i].dead = 0;
}
w_chess[CHESS_KNIGHT].type = KNIGHT;
b_chess[CHESS_KNIGHT].type = KNIGHT;
w_chess[CHESS_KING].type = KING;
b_chess[CHESS_KING].type = KING;
}
/*set the initial positions of all pieces*/
void
initialize_board() {
int i = 0;
int j = 0;
for(i = 0; i < ROWS; i++) {
for(j = 0; j < COLUMNS; j++) {
board[i][j] = NULL;
}
}
for(i = 0; i < 10; i++) {
w_chess[i].dead = 1;
b_chess[i].dead = 1;
}
for(i = 0; i < 8; i++) {
w_chess[i].pos[0] = 1;
w_chess[i].pos[1] = i;
w_chess[i].dead = 0;
b_chess[i].pos[0] = 6;
b_chess[i].pos[1] = i;
b_chess[i].dead = 0;
board[1][i] = &(w_chess[i]);
board[6][i] = &(b_chess[i]);
}
w_chess[CHESS_KING].pos[0] = 0;
w_chess[CHESS_KING].pos[1] = E;
w_chess[CHESS_KING].dead = 0;
b_chess[CHESS_KING].pos[0] = 7;
b_chess[CHESS_KING].pos[1] = E;
b_chess[CHESS_KING].dead = 0;
w_chess[CHESS_KNIGHT].pos[0] = 0;
w_chess[CHESS_KNIGHT].pos[1] = G;
w_chess[CHESS_KNIGHT].dead = 0;
b_chess[CHESS_KNIGHT].pos[0] = 7;
b_chess[CHESS_KNIGHT].pos[1] = G;
b_chess[CHESS_KNIGHT].dead = 0;
board[0][E] = &(w_chess[CHESS_KING]);
board[7][E] = &(b_chess[CHESS_KING]);
board[0][G] = &(w_chess[CHESS_KNIGHT]);
board[7][G] = &(b_chess[CHESS_KNIGHT]);
}
/*return legal moves for a piece basing on its color, its starting position and its type*/
void
return_legal_moves(struct piece *fake_board[][COLUMNS], int *all_moves, int *from, int type, int color){
const int *moves_array;
int move_max = -1;
int move = -1;
int tmp_pos[2];
memset(all_moves, -1, sizeof(int)*TOTAL_MOVES_NUMBER);
/*set the pointer to the right array of moves in the header*/
switch(type) {
case PAWN:
moves_array = &(PAWN_MOVES[0]);
move_max = PAWN_N_MOVES;
break;
case KNIGHT:
moves_array = &(KNIGHT_MOVES[0]);
move_max = KNIGHT_N_MOVES;
break;
case KING:
moves_array = &(KING_MOVES[0]);
move_max = KING_N_MOVES;
break;
default:
break;
}
for(move = 0; move < move_max; move++) {
tmp_pos[0] = from[0];
tmp_pos[1] = from[1];
moves(tmp_pos, type, color, *(moves_array+move));
/*for each move just check if it is a legal one*/
if(is_legal_fake_move(fake_board, from, tmp_pos, type, color, *(moves_array+move))) {
all_moves[move] = *(moves_array+move);
}
}
}
/*put coordinates of move requested in pos*/
void
moves(int *pos, int type, int color, int what) {
switch(type){
case PAWN:
switch(what) {
case FORWARD:
pos[0] = pos[0]-2*(color)+1;
break;
case PAWN_FORWARD:
pos[0] = pos[0]-4*(color)+2;
break;
case LEFT_FORWARD:
pos[0] = pos[0]-2*(color)+1;
pos[1] = pos[1]+2*(color)-1;
break;
case RIGHT_FORWARD:
pos[0] = pos[0]-2*(color)+1;
pos[1] = pos[1]-2*(color)+1;
break;
default:
break;
}
break;
case KNIGHT:
switch(what) {
case LEFT_FORWARD:
pos[0] = pos[0]-4*(color)+2;
pos[1] = pos[1]+2*(color)-1;
break;
case RIGHT_FORWARD:
pos[0] = pos[0]-4*(color)+2;
pos[1] = pos[1]-2*(color)+1;
break;
case LEFT_BACKWARD:
pos[0] = pos[0]+4*(color)-2;
pos[1] = pos[1]+2*(color)-1;
break;
case RIGHT_BACKWARD:
pos[0] = pos[0]+4*(color)-2;
pos[1] = pos[1]-2*(color)+1;
break;
case KNIGHT_LEFT_FORWARD:
pos[0] = pos[0]-2*(color)+1;
pos[1] = pos[1]+4*(color)-2;
break;
case KNIGHT_RIGHT_FORWARD:
pos[0] = pos[0]-2*(color)+1;
pos[1] = pos[1]-4*(color)+2;
break;
case KNIGHT_LEFT_BACKWARD:
pos[0] = pos[0]+2*(color)-1;
pos[1] = pos[1]+4*(color)-2;
break;
case KNIGHT_RIGHT_BACKWARD:
pos[0] = pos[0]+2*(color)-1;
pos[1] = pos[1]-4*(color)+2;
break;
default:
break;
}
break;
case KING:
switch(what) {
case LEFT:
pos[1] = pos[1]+2*(color)-1;
break;
case RIGHT:
pos[1] = pos[1]-2*(color)+1;
break;
case FORWARD:
pos[0] = pos[0]-2*(color)+1;
break;
case BACKWARD:
pos[0] = pos[0]+2*(color)-1;
break;
case LEFT_FORWARD:
pos[0] = pos[0]-2*(color)+1;
pos[1] = pos[1]+2*(color)-1;
break;
case RIGHT_FORWARD:
pos[0] = pos[0]-2*(color)+1;
pos[1] = pos[1]-2*(color)+1;
break;
case LEFT_BACKWARD:
pos[0] = pos[0]+2*(color)-1;
pos[1] = pos[1]+2*(color)-1;
break;
case RIGHT_BACKWARD:
pos[0] = pos[0]+2*(color)-1;
pos[1] = pos[1]-2*(color)+1;
break;
default:
break;
}
break;
default:
break;
}
}
/*check if a move is legal, basing on the position of a piece, its type and its color*/
int
is_legal_fake_move(struct piece *fake_board[][COLUMNS], int *from, int *to, int type, int color, int what) {
int ret = 1;
int row = to[0];
int col = to[1];
int tmp_row = -1;
/*for all moves check if they are inside the board and if destination is free or containing an opponent piece to be eaten*/
if(to[0] > ROWS-1 || to[1] > COLUMNS-1 || to[0] < 0 || to[1] < 0) {
ret = 0;
} else if(to[0] == from[0] && to[1] == from[1]) {
ret = 0; //no real move
} else {
switch(type) {
case PAWN:
switch(what) {
case FORWARD:
if(fake_board[row][col] != NULL)
ret = 0;
break;
case PAWN_FORWARD:
/*check if pawn starts moving from its original position*/
if(fake_board[row][col] != NULL || from[0] != color*5+1) {
ret = 0;
/*check if there is a piece on the next row*/
} else if(fake_board[from[0]-2*color+1][from[1]] != NULL ) {
ret = 0;
}
break;
case LEFT_FORWARD:
case RIGHT_FORWARD:
tmp_row = row+2*color-1;
/*check if the move is an en passant capture*/
if((fake_board[row][col] == NULL || fake_board[row][col]->color == color) && (tmp_row < 0 || tmp_row > ROWS-1 || row != (-2*color+5) || fake_board[tmp_row][col] == NULL || fake_board[tmp_row][col]->color == color || fake_board[tmp_row][col]->type != PAWN || fake_board[tmp_row][col]->n_fake_moves != 1|| last_moved != fake_board[tmp_row][col])) {
ret = 0;
}
break;
default:
break;
}
break;
case KNIGHT:
case KING:
if((fake_board[row][col] != NULL && fake_board[row][col]->color == color)/* || is_under_attack(fake_board, row, col, color)*/) {
ret = 0;
}
break;
default:
break;
}
}
return ret;
}
int
is_legal_human_move(int *int_input_move) {
int allowed_move = 0;
int from[2];
int to[2];
int tmp_to[2];
int i = 0;
int type;
int color;
int legal_moves[TOTAL_MOVES_NUMBER];
from[0] = int_input_move[1];
from[1] = int_input_move[0];
to[0] = int_input_move[3];
to[1] = int_input_move[2];
if(int_input_move[0] < 0 || int_input_move[0] > COLUMNS-1 || int_input_move[1] < 0 || int_input_move[1] > ROWS-1 || board[int_input_move[1]][int_input_move[0]] == NULL) {
return 0;
}
else if(int_input_move[2] < 0 || int_input_move[2] > COLUMNS-1 || int_input_move[3] < 0 || int_input_move[3] > ROWS-1) {
return 0;
}
type = board[from[0]][from[1]]->type;
color = board[from[0]][from[1]]->color;
return_legal_moves(board, legal_moves, from, type, color);
for(i = 0; i < TOTAL_MOVES_NUMBER; i++) {
tmp_to[0] = from[0];
tmp_to[1] = from[1];
if(legal_moves[i] != -1) {
moves(tmp_to, type , color, legal_moves[i]);
if(to[0] == tmp_to[0] && to[1] == tmp_to[1]) {
allowed_move = 1;
break;
}
}
}
return allowed_move;
}
/*return if a piece is under attack*/
int
is_under_attack(struct piece *fake_board[][COLUMNS], int row, int col, int color) {
int move;
int ret = 0;
int pos[2];
struct piece *tmp_fake_piece = NULL;
const int *moves_array;
const int tmp_pawn_moves[] = {LEFT_FORWARD, RIGHT_FORWARD};
/*pawn's attacks*/
moves_array = &(tmp_pawn_moves[0]);
for(move = 0; move < 2; move++) {
pos[0] = row;
pos[1] = col;
moves(pos, PAWN, color, *(moves_array+move));
if(pos[0] < ROWS && pos[0] >= 0 && pos[1] < COLUMNS && pos[1] >= 0) {
if(fake_board[pos[0]][pos[1]] != NULL) {
tmp_fake_piece = fake_board[pos[0]][pos[1]];
if(tmp_fake_piece->type == PAWN && tmp_fake_piece->color == !color)
return 1;
}
}
}
/*knight's attacks*/
moves_array = &(KNIGHT_MOVES[0]);
for(move = 0; move < KNIGHT_N_MOVES; move++) {
pos[0] = row;
pos[1] = col;
moves(pos, KNIGHT, color, *(moves_array+move));
if(pos[0] < ROWS && pos[0] >= 0 && pos[1] < COLUMNS && pos[1] >= 0) {
if(fake_board[pos[0]][pos[1]] != NULL) {
tmp_fake_piece = fake_board[pos[0]][pos[1]];
if(tmp_fake_piece->type == KNIGHT && tmp_fake_piece->color == !color)
return 1;
}
}
}
/*king's attacks*/
moves_array = &(KING_MOVES[0]);
for(move = 0; move < KING_N_MOVES; move++) {
pos[0] = row;
pos[1] = col;
moves(pos, KING, color, *(moves_array+move));
if(pos[0] < ROWS && pos[0] >= 0 && pos[1] < COLUMNS && pos[1] >= 0) {
if(fake_board[pos[0]][pos[1]] != NULL) {
tmp_fake_piece = fake_board[pos[0]][pos[1]];
if(tmp_fake_piece->type == KING && tmp_fake_piece->color == !color)
return 1;
}
}
}
return ret;
}
/*return in which particular state the board is*/
int
return_board_status(struct piece *fake_board[][COLUMNS], int color) {
int check = 0;
int ret = 1;
int i, j;
struct piece *tmp_fake_board[ROWS][COLUMNS];
struct piece *tmp_fake_piece = NULL;
struct piece *not_tmp_fake_piece = NULL;
int legal_moves[TOTAL_MOVES_NUMBER];
int from[2];
int not_from[2];
int to[2];
reset_fake_board(fake_board, tmp_fake_board);
/*find kings*/
for(i = 0; i < ROWS; i++) {
if(tmp_fake_piece != NULL && not_tmp_fake_piece != NULL)
break;
for(j = 0; j < COLUMNS; j++) {
if(tmp_fake_board[i][j] != NULL && tmp_fake_board[i][j]->color == !color && tmp_fake_board[i][j]->type == KING) {
not_tmp_fake_piece = tmp_fake_board[i][j];
not_from[0] = i;
not_from[1] = j;
}
if(tmp_fake_board[i][j] != NULL && tmp_fake_board[i][j]->color == color && tmp_fake_board[i][j]->type == KING) {
tmp_fake_piece = tmp_fake_board[i][j];
from[0] = i;
from[1] = j;
}
}
}
if(not_tmp_fake_piece == NULL || tmp_fake_piece == NULL) {
return NOTHING;
}
/*check if opponent king is under check*/
if(is_under_attack(tmp_fake_board, not_from[0], not_from[1], !color))
check = 1;
/*check if opponent king is under chackmate*/
if(check) {
return_legal_moves(tmp_fake_board, legal_moves, not_from, not_tmp_fake_piece->type, not_tmp_fake_piece->color);
for(i = 0; i < TOTAL_MOVES_NUMBER; i++) {
reset_fake_board(fake_board, tmp_fake_board);
if(legal_moves[i] != -1) {
to[0] = not_from[0];
to[1] = not_from[1];
moves(to, not_tmp_fake_piece->type, not_tmp_fake_piece->color, legal_moves[i]);
make_fake_move(tmp_fake_board, not_tmp_fake_piece, not_from, to);
if(!is_under_attack(tmp_fake_board, to[0], to[1], !color) ) {
ret = 0;
break;
}
}
}
} else {
ret = 0;
}
reset_fake_board(fake_board, tmp_fake_board);
if(ret == 1 && check) {
ret = CHECKMATE;
} else if(check) {
return CHECK;
} else {
check = 0;
ret = 1;
/*check if king is under chackmate*/
if(is_under_attack(tmp_fake_board, from[0], from[1], color)) {
check = 1;
}
/*check if there is a stalemate situation*/
return_legal_moves(tmp_fake_board, legal_moves, from, tmp_fake_piece->type, tmp_fake_piece->color);
for(i = 0; i < TOTAL_MOVES_NUMBER; i++) {
//reset_fake_board(tmp_fake_board, fake_board);
reset_fake_board(fake_board, tmp_fake_board);
if(legal_moves[i] != -1) {
to[0] = from[0];
to[1] = from[1];
moves(to, tmp_fake_piece->type, tmp_fake_piece->color, legal_moves[i]);
make_fake_move(tmp_fake_board, tmp_fake_piece, from, to);
if(!is_under_attack(tmp_fake_board, to[0], to[1], color) ) {
ret = 0;
break;
}
}
}
if(ret == 1 && !check) {
ret = STALEMATE;
} else if(ret == 1 && check) {
ret = NOT_CHECKMATE;
} else {
ret = NOTHING;
}
}
return ret;
}
/*basing on what return_board_status returns, return a value meaning the end of the game*/
int
is_the_end(struct piece *fake_board[][COLUMNS], int color) {
int ret = PLAYING;
int tmp = -1;
int i = 0;
/*fake_board case*/
if(fake_board != NULL) {
tmp = return_board_status(fake_board, color);
if(tmp == STALEMATE) {
ret = DRAW;
} else if(tmp == CHECKMATE) {
if(color == START_COLOR)
ret = COLOR_WIN;
else
ret = NOT_COLOR_WIN;
} else if(tmp == NOT_CHECKMATE) {
if(color != START_COLOR)
ret = COLOR_WIN;
else
ret = NOT_COLOR_WIN;
} else {
for(i = 0; i < COLUMNS; i++) {
/*white promotion case*/
if(fake_board[ROWS-1][i] != NULL && fake_board[ROWS-1][i]->type == PAWN && fake_board[ROWS-1][i]->color == WHITE_CHESS && !is_under_attack(fake_board, ROWS-1, i, WHITE_CHESS)) {
if(START_COLOR == WHITE_CHESS)
ret = COLOR_WIN;
else
ret = NOT_COLOR_WIN;
break;
}
/*black promotion case*/
if(fake_board[0][i] != NULL && fake_board[0][i]->type == PAWN && fake_board[0][i]->color == BLACK_CHESS && !is_under_attack(fake_board, 0, i, BLACK_CHESS)) {
if(START_COLOR == BLACK_CHESS)
ret = COLOR_WIN;
else
ret = NOT_COLOR_WIN;
break;
}
}
}
/*board case*/
} else {
tmp = return_board_status(board, color);
if(tmp == CHECK) {
printf(RED"CHECK\n"WHITE);
} else if(tmp == STALEMATE) {
printf(RED"STALEMATE\n"WHITE);
ret = DRAW;
} else if(tmp == CHECKMATE) {
printf(RED"CHECKMATE\n"WHITE);
if(color == START_COLOR)
ret = COLOR_WIN;
else
ret = NOT_COLOR_WIN;
} else if(tmp == NOT_CHECKMATE) {
printf(RED"CHECKMATE\n"WHITE);
if(color == START_COLOR)
ret = NOT_COLOR_WIN;
else
ret = COLOR_WIN;
} else {
for(i = 0; i < COLUMNS; i++) {
/*white promotion case*/
if(board[ROWS-1][i] != NULL && board[ROWS-1][i]->type == PAWN && board[ROWS-1][i]->color == WHITE_CHESS && !is_under_attack(board, ROWS-1, i, WHITE_CHESS)) {
if(START_COLOR == WHITE_CHESS)
ret = COLOR_WIN;
else
ret = NOT_COLOR_WIN;
break;
}
/*black promotion case*/
if(board[0][i] != NULL && board[0][i]->type == PAWN && board[0][i]->color == BLACK_CHESS && !is_under_attack(board, 0, i, BLACK_CHESS)) {
if(START_COLOR == BLACK_CHESS)
ret = COLOR_WIN;
else
ret = NOT_COLOR_WIN;
break;
}
}
/*case ends detected by evaluate function*/
if(ret == PLAYING) {
tmp = evaluate(board);
if(tmp == EVALUATED_DRAW)
ret = DRAW;
else if(tmp == PLUS_INFINITY) {
if(color == START_COLOR)
ret = COLOR_WIN;
else
ret = NOT_COLOR_WIN;
} else if(tmp == MINUS_INFINITY) {
if(color == START_COLOR)
ret = NOT_COLOR_WIN;
else
ret = COLOR_WIN;
}
}
}
}
return ret;
}
/*reset the fake board*/
void
reset_fake_board(struct piece *original_fake_board[][COLUMNS], struct piece *fake_board[][COLUMNS]) {
memcpy(fake_board, original_fake_board, sizeof(struct piece*)*ROWS*COLUMNS);
}
void
undo_last_move(struct piece *original_board[][COLUMNS], struct piece *fake_board[][COLUMNS]) {
int i = 0;
int j = 0;
int color;
for(i = 0; i < ROWS; i++) {
for(j = 0; j < COLUMNS; j++) {
if(original_board[i][j] == NULL) {
fake_board[i][j] = NULL;
} else {
color = original_board[i][j]->color;
fake_board[i][j] = original_board[i][j];
fake_board[i][j]->dead = 0;
fake_board[i][j]->pos[0]= i;
fake_board[i][j]->pos[1]= j;
/*if the piece was at the beginning, reset its number of moves*/
if(i == 5*color+1) {
fake_board[i][j]->n_moves = 0;
fake_board[i][j]->n_fake_moves = 0;
}
}
}
}
}
/*kill a piece on the board*/
void
kill(struct piece *p) {
board[p->pos[0]][p->pos[1]] = NULL;
p->dead = 1;
p->pos[0] = -1;
p->pos[1] = -1;
}
/*make a real move on the board*/
void
make_move(struct piece *p, int *to){
int x_old_pos = p->pos[0];
int y_old_pos = p->pos[1];
int color = p->color;
/*update last_move_board with the previous board accepted*/
if(color != START_COLOR && HUMAN_PLAYER) {
reset_fake_board(tmp_last_move_board, last_move_board);
}
if(board[to[0]][to[1]] != NULL) {
kill(board[to[0]][to[1]]);
/*detect en passant captures*/
} else if(p->type == PAWN && board[to[0]+2*color-1][to[1]] != NULL && to[1]-2*color+1 == y_old_pos && to[0] == x_old_pos-2*color+1) { /*LEFT en passant*/
kill(board[to[0]+2*color-1][to[1]]);
} else if(p->type == PAWN && board[to[0]+2*color-1][to[1]] != NULL && to[1]+2*color-1 == y_old_pos && to[0] == x_old_pos-2*color+1) {/*RIGHT en passant*/
kill(board[to[0]+2*color-1][to[1]]);
}
board[x_old_pos][y_old_pos] = NULL;
/*set p as last piece moved*/
last_moved = p;
p->pos[0] = to[0];
p->pos[1] = to[1];
p->n_moves++;
p->n_fake_moves = p->n_moves;
board[to[0]][to[1]] = p;
/*store board for being restored*/
if(color == START_COLOR && HUMAN_PLAYER) {
reset_fake_board(board, tmp_last_move_board);
}
}
/*make a fake move on a fake board, i.e., simulate a move*/
void
make_fake_move(struct piece *fake_board[][COLUMNS], struct piece *p, int *from, int *to){
int x_old_pos = from[0];
int y_old_pos = from[1];
int color = p->color;
if(fake_board[to[0]][to[1]] != NULL) {
fake_board[to[0]][to[1]] = NULL;
/*detect en passant captures*/
} else if(p->type == PAWN && fake_board[to[0]+2*color-1][to[1]] != NULL && to[1]-2*color+1 == from[1] && to[0] == from[0]-2*color+1) { /*LEFT en passant*/
fake_board[to[0]+2*color-1][to[1]] = NULL;
} else if(p->type == PAWN && fake_board[to[0]+2*color-1][to[1]] != NULL && to[1]+2*color-1 == from[1] && to[0] == from[0]-2*color+1) { /*RIGHT en passant*/
fake_board[to[0]+2*color-1][to[1]] = NULL;
}
/*set p as last piece moved*/
last_moved = p;
fake_board[x_old_pos][y_old_pos] = NULL;
fake_board[to[0]][to[1]] = p;
p->n_fake_moves++;
}
void
make_random_move(int color, char *input_move) {
printf("Random move\n");
int index_p = rand()%10;
struct piece *p = NULL;
int pos[2];
int move;
const int *moves_array = NULL;
do {
do{
index_p = rand()%CHESS_NUMBER;
if(color == WHITE_CHESS) {
p = &(w_chess[index_p]);
} else {
p = &(b_chess[index_p]);
}
} while(p->dead == 1); /*it cannot take dead pieces*/
switch(p->type) {
case PAWN:
move = rand()%PAWN_N_MOVES;
moves_array = &(PAWN_MOVES[0]);
//printf("move from array: %s\n", PAWN_MOVES_STRINGS[move]);
break;
case KNIGHT:
move = rand()%KNIGHT_N_MOVES;
moves_array = &(KNIGHT_MOVES[0]);
//printf("move from array: %s\n", KNIGHT_MOVES_STRINGS[move]);
break;
case KING:
move = rand()%KING_N_MOVES;
moves_array = &(KING_MOVES[0]);
//printf("move from array: %s\n", KING_MOVES_STRINGS[move]);
break;
default:
break;
}
pos[0] = p->pos[0];
pos[1] = p->pos[1];
input_move[0] = pos[1]+65;
sprintf(&input_move[1], "%d", pos[0]+1);
moves(pos, p->type, p->color, *(moves_array+move));
input_move[2] = pos[1]+65;
sprintf(&input_move[3], "%d", pos[0]+1);
} while(!is_legal_fake_move(board, p->pos, pos, p->type, p->color, *(moves_array+move)));
make_move(p, pos);
}
/*make an evaluation of the fake board basing on EVAL formula in the header*/
int
evaluate(struct piece *fake_board[][COLUMNS]) {
int k, k1, n, n1, p, p1, d, d1, s, s1, i, i1, m, m1;
int tmp[COLUMNS];
int tmp1[COLUMNS];
int legal_moves[TOTAL_MOVES_NUMBER];
k = 0; k1 = 0; /*king*/
n = 0; n1 = 0; /*knights*/
p = 0; p1 = 0; /*pawns*/
d = 0; d1 = 0; /*doubled pawns*/
s = 0; s1 = 0; /*backward pawns*/
i = 0; i1 = 0; /*isolated pawns*/
m = 0; m1 = 0; /*mobility*/
int col = 0;
int t = 0;
int row = 0;
int move = -1;
int move_max = -1;
int res = NOT_ALLOWED;
struct piece *tmp_fake_piece = NULL;
int tmp_n_paws = -1;
int is_there_pawn = -1;
int from[2];