-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathChessBoard.c
2117 lines (1690 loc) · 55.9 KB
/
ChessBoard.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
#include <stdio.h>
#include <stdlib.h>
#include<stdbool.h>
#include <string.h>
#include <windows.h>
#include <conio.h>
#include <time.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <unistd.h>
#include <dirent.h>
#define GCOLUMNS 49
#define GROWS 33
#define XPIECE 0
#define YPIECE 1
#define XDESTINATION 2
#define YDESTINATION 3
#define DATA_SIZE 1000
#define MAXGAMES 20
#define MAXLENPERGAME 35
#define MAXLENPERWRITTENMOVE 10
#define BishopSwitch switch(rcdChecked){ \
case 0: xAdder=1; yAdder=1; break; /*giu destra*/\
case 1: xAdder=-1; yAdder=1; break; /*su destra*/\
case 2: xAdder=1; yAdder=-1; break; /*giu sinistra*/\
case 3: xAdder=-1; yAdder=-1; break; /*su sinistra*/\
}
#define RookSwitch switch(rcdChecked){ \
case 0: xAdder=1; yAdder=0; break; /*giu*/\
case 1: xAdder=-1; yAdder=0; break; /*su*/\
case 2: xAdder=0; yAdder=-1; break; /*sinistra*/\
case 3: xAdder=0; yAdder=1; break; /*destra*/\
}
#define KnightSwitch switch(rcdChecked){ \
case 0: xAdder=2; yAdder=1; break; /*su destra*/\
case 1: xAdder=2; yAdder=-1; break; /*su sinistra*/\
case 2: xAdder=-2; yAdder=1; break; /*giu destra*/\
case 3: xAdder=-2; yAdder=-1; break; /*giu sinistra*/\
case 4: xAdder=1; yAdder=2; break; /*destra giu*/\
case 5: xAdder=-1; yAdder=2; break; /*destra su*/\
case 6: xAdder=1; yAdder=-2; break; /*sinistra giu*/\
case 7: xAdder=-1; yAdder=-2; break; /*sinistra su*/\
}
#define KingQueenSwitch switch(rcdChecked){ \
case 0: xAdder=1; yAdder=0; break; /*giu*/\
case 1: xAdder=-1; yAdder=0; break; /*su*/\
case 2: xAdder=0; yAdder=-1; break; /*sinistra*/\
case 3: xAdder=0; yAdder=1; break; /*destra*/\
case 4: xAdder=1; yAdder=1; break; /*giu destra*/\
case 5: xAdder=-1; yAdder=1; break; /*su destra*/\
case 6: xAdder=1; yAdder=-1; break; /*giu sinistra*/\
case 7: xAdder=-1; yAdder=-1; break; /*su sinistra*/\
}
#pragma GCC diagnostic ignored "-Wwrite-strings"
typedef enum{
EMPTY = 0, //0
KING, //1
QUEEN, //2
ROOK, //3
BISHOP, //4
KNIGHT, //5
PAWN, //6
}PIECES;
typedef enum{
BLACK = 0,
WHITE = 1,
}COLOURS;
typedef struct{
int row;
int column;
PIECES pezzo;
COLOURS colore;
int pieceColor;
}Square;
typedef struct{
Square squares[8][8];
}Board;
//Prototypes related to the chess engine
void reset();
void red();
void yellow();
int getGraphicX(int x);
int getGraphicY(int y);
void updatePieces(char graphicBoard[GROWS][GCOLUMNS]);
void showGraphicBoard(char graphicBoard[GROWS][GCOLUMNS]);
void showDebugBoards(int x, int y);
void initializeGraphicBoard(char graphicBoard[GROWS][GCOLUMNS]);
void initializeBoard();
void inputInterface(bool whiteTurn, bool drawRequest[]);
void showInvalidMoveWarning(int index);
int convertCharCoords(char ch);
int convertIntCoords(int n);
void deleteStoredPossibleMoves();
void deleteStoredCheckMoves();
int getNumberOfMoves();
int getNumberOfCheckMoves();
void addPossibleMove(int x, int y);
void addPossibleCheckMove(int x, int y);
bool isUnderCheckAt(int x, int y, int pieceColor, bool recalculate);
void findKing(int*x, int*y, int pieceColor);
bool isKingUnderCheck(int pieceColor);
bool isKingUnderCheckAfterMove(int moveCoordsData[], PIECES pieceToBeMovedTemp, int playerColorTurn);
void pawnCalculator(int x, int y, int pieceColor);
void pieceCalculator(int x, int y, int pieceNeeded, int pieceColor, bool check);
void calculateCheckSquares(int pieceColor);
int pieceReverseFinder(int pieceColor, int pieceNeeded, int moveCoordsData[]);
int pieceFinder(int pattern, char currentPosition[], char nextMove[], int moveCoordsData[], PIECES pieceToBeMoved, int playerColorTurn);
int pieceMover(int moveCoordsData[], int playerColorTurn, PIECES pieceToBeMoved);
bool castlingChecker(bool castlingCheck[], char castlingType, int playerColorTurn);
int castlingMover(bool castlingCheck[], char castlingType, int playerColorTurn);
void castlingHandler(int yPiece, PIECES pieceToBeMoved, int pieceColor, bool castlingCheck[]);
void promotionHandler(int x, int y, char move[], char pieceToPromove, int pieceColor);
bool acceptableChar(char value);
int isMoveValid(char move[]);
void getInput(char *inputBuffer, int bufferLength);
void getFirstPart(char *firstPart, char move[]);
void getSecondPart(char *secondPart, char move[]);
int analyzeInput(char move[], bool castlingCheck[], int playerColorTurn, PIECES *pieceToBeMoved, char *pieceToPromove, char *playerInteraction, int moveCoordsData[]);
bool noPieceCanPreventCheckmate(int pieceColor);
int checkEndOfGame(int pieceColor);
int playerInteractionHandler(bool drawRequest[], char playerInteraction, bool whiteTurn);
void chessEngine();
//*** Prototypes related to file writing ***
void fileNameGenerator(char fileName[]);
void writeMove(char fileName[], char move[]);
//Prototypes related to the game viewer
void printGameViewerInterface(char gameMoves[][MAXLENPERWRITTENMOVE], int moveNumber, bool whiteTurn, int endOfGame);
int loadGame(FILE *file, Board gameStates[], char gameMoves[][MAXLENPERWRITTENMOVE], int* endOfGame);
void gameViewer(char gamesList[][MAXLENPERGAME], int index);
int getNumberOfGames(char gamesList[][MAXLENPERGAME]);
void initializeGamesList(char gamesList[][MAXLENPERGAME]);
void cloneArray(char clone[][35], char original[][MAXLENPERGAME]);
void getFilesInGamesFolder(char gamesList[][MAXLENPERGAME]);
void printInterfaceGameViewer(int choice, char gamesList[][MAXLENPERGAME], char gamesListClone[][MAXLENPERGAME]);
void handleInputGameViewer();
void handleInput();
//Prototypes related to thje starting interface
void printInterface(int choice);
void handleInput();
Board board;
int possibleMoves[32][2];
int possibleCheckMoves[64][2];
void reset () {
printf("\033[0m");
}
void red () {
printf("\033[1;31m");
}
void yellow () {
printf("\033[2;33m");
}
int getGraphicX(int x){
int i, k = 0;
for(i=2; i<GROWS; i+=4)
{
if(k==x)
return i;
k++;
}
}
int getGraphicY(int y){
int j, l = 0;
for(j=3; j<GCOLUMNS; j+=6)
{
if(l==y)
return j;
l++;
}
}
void updatePieces(char graphicBoard[GROWS][GCOLUMNS]){
int i, j;
char pieceColor;
for(i=0; i<8; i++){
for(j=0; j<8; j++){
if(board.squares[i][j].pieceColor == WHITE)
pieceColor = 'w';
else
pieceColor = 'b';
switch(board.squares[i][j].pezzo){
case PAWN: graphicBoard[getGraphicX(i)][getGraphicY(j)] = 'P'; graphicBoard[getGraphicX(i)][getGraphicY(j)+1] = pieceColor;
break;
case BISHOP: graphicBoard[getGraphicX(i)][getGraphicY(j)] = 'B'; graphicBoard[getGraphicX(i)][getGraphicY(j)+1] = pieceColor;
break;
case KNIGHT: graphicBoard[getGraphicX(i)][getGraphicY(j)] = 'N'; graphicBoard[getGraphicX(i)][getGraphicY(j)+1] = pieceColor;
break;
case ROOK: graphicBoard[getGraphicX(i)][getGraphicY(j)] = 'R'; graphicBoard[getGraphicX(i)][getGraphicY(j)+1] = pieceColor;
break;
case QUEEN: graphicBoard[getGraphicX(i)][getGraphicY(j)] = 'Q'; graphicBoard[getGraphicX(i)][getGraphicY(j)+1] = pieceColor;
break;
case KING: graphicBoard[getGraphicX(i)][getGraphicY(j)] = 'K'; graphicBoard[getGraphicX(i)][getGraphicY(j)+1] = pieceColor;
break;
case EMPTY:
if(board.squares[i][j].colore == BLACK){
graphicBoard[getGraphicX(i)][getGraphicY(j)] = ' ';
graphicBoard[getGraphicX(i)][getGraphicY(j)+1] = ' ';
}
else{
graphicBoard[getGraphicX(i)][getGraphicY(j)] = 178; //white rectangle
graphicBoard[getGraphicX(i)][getGraphicY(j)+1] = 178; //white rectangle
}
}
}
}
}
void showGraphicBoard(char graphicBoard[GROWS][GCOLUMNS]){
int i, j;
updatePieces(graphicBoard);
for(i=0; i<GROWS; i++){
for(j=0; j<GCOLUMNS; j++){
printf("%c", graphicBoard[i][j]);
}
printf("\n");
}
}
void showDebugBoards(int x, int y){
bool occupato, pezzo;
int i,j,k;
for(i = 0; i < 8; i++){
for(j = 0; j < 8; j++){
occupato = false;
pezzo = false;
for(k = 0; k<getNumberOfMoves()+1; k++)
{
if(i == possibleMoves[k][0] && j == possibleMoves[k][1]){
occupato = true;
}
if(x == i && y == j){
pezzo = true;
}
}
if(occupato){
printf("[*]");
}else{
if(pezzo){
printf("[x]");
}else{
printf("[ ]");
}
}
}
printf("\t");
for(j = 0; j < 8; j++){
occupato = false;
pezzo = false;
for(k = 0; k<getNumberOfCheckMoves()+1; k++)
{
if(i == possibleCheckMoves[k][0] && j == possibleCheckMoves[k][1]){
occupato = true;
}
if(x == i && y == j){
pezzo = true;
}
}
if(occupato){
printf("[*]");
}else{
if(pezzo){
printf("[x]");
}else{
printf("[ ]");
}
}
}
printf("\n");
}
}
void initializeGraphicBoard(char graphicBoard[GROWS][GCOLUMNS]){
int i, j, k, l, countColumns=0, rowsCounter = 0, intValue;
char charValue;
bool white = true;
//initialization
for(i=0; i<GROWS; i++)
{
for(j=0; j<GCOLUMNS; j++)
{
graphicBoard[i][j] = ' ';
}
}
//sides
for(i=0; i<GCOLUMNS; i++)
graphicBoard[0][i] = 196; //horiz
for(i=0; i<GCOLUMNS; i++)
graphicBoard[GROWS-1][i] = 196; //horiz
for(i=0; i<GROWS; i++)
graphicBoard[i][0] = 179; //vert
for(i=0; i<GROWS; i++)
graphicBoard[i][GCOLUMNS-1] = 179; //vert
//corners
graphicBoard[0][0] = 218;
graphicBoard[GROWS-1][0] = 192;
graphicBoard[0][GCOLUMNS-1] = 191;
graphicBoard[GROWS-1][GCOLUMNS-1] = 217;
//intersections
for(i=6; i<GCOLUMNS-1; i+=6) //up and down sides
{
graphicBoard[0][i] = 194;
graphicBoard[GROWS-1][i] = 193;
for(j=1; j<GROWS-1; j++)
graphicBoard[j][i] = 179;
}
for(i=4; i<GROWS-1; i+=4) //left and right sides
{
graphicBoard[i][0] = 195;
graphicBoard[i][GCOLUMNS-1] = 180;
for(j=1; j<GCOLUMNS-1; j++)
graphicBoard[i][j] = 196;
}
for(i=4; i<GROWS-1; i+=4) //left and right sides
{
for(j=6; j<GCOLUMNS-1; j+=6)
graphicBoard[i][j] = 197;
}
//paint white squares
for(i=1; i<GROWS; i++)
{
rowsCounter++;
for(j=0; j<GCOLUMNS; j++)
{
if(graphicBoard[i][j] == ' '){
if(countColumns <= 4){
graphicBoard[i][j] = 178;
}
countColumns++;
if(countColumns > 9)
countColumns=0;
}
}
if(rowsCounter == 4){
white = !white;
rowsCounter = 0;
countColumns = 0;
}
if(white == false){
countColumns=5;
}
}
//Initialize identifiers for rows and columns
charValue = 'a';
intValue = 1;
for(i = 1; i<GCOLUMNS; i+=6){
graphicBoard[31][i] = charValue;
charValue += 1;
}
for(i = 29; i>0; i-=4){
graphicBoard[i][47] = intValue + '0';
intValue += 1;
}
}
void initializeBoard(){
int i, j, k, l, pawnIndex = 0;
bool changeColor = true;
//Identify colours in squares
changeColor = false;
k=0;
for(i=2; i<GROWS; i+=4)
{
l=0;
for(j=3; j<GCOLUMNS; j+=6)
{
board.squares[k][l].row = i;
board.squares[k][l].column = j;
if(changeColor){
if(l%2 == 0){
board.squares[k][l].colore = BLACK;
}else{
board.squares[k][l].colore = WHITE;
}
}else{
if(l%2 != 0){
board.squares[k][l].colore = BLACK;
}else{
board.squares[k][l].colore = WHITE;
}
}
l++;
}
k++;
if(changeColor)
changeColor = false;
else
changeColor = true;
}
for(i = 0; i<8; i++){
for(j=0; j<8; j++){
board.squares[i][j].pezzo = EMPTY;
}
}
//PIECES initialization
//PAWNS
for(i = 0; i<8; i++){
board.squares[1][pawnIndex].pezzo = PAWN;
board.squares[1][pawnIndex].pieceColor = BLACK;
board.squares[6][pawnIndex].pezzo = PAWN;
board.squares[6][pawnIndex].pieceColor = WHITE;
pawnIndex += 1;
}
//ROOKS
board.squares[0][0].pezzo = ROOK;
board.squares[0][0].pieceColor = BLACK;
board.squares[0][7].pezzo = ROOK;
board.squares[0][7].pieceColor = BLACK;
board.squares[7][0].pezzo = ROOK;
board.squares[7][0].pieceColor = WHITE;
board.squares[7][7].pezzo = ROOK;
board.squares[7][7].pieceColor = WHITE;
//KNIGHTS
board.squares[0][1].pezzo = KNIGHT;
board.squares[0][1].pieceColor = BLACK;
board.squares[0][6].pezzo = KNIGHT;
board.squares[0][6].pieceColor = BLACK;
board.squares[7][1].pezzo = KNIGHT;
board.squares[7][1].pieceColor = WHITE;
board.squares[7][6].pezzo = KNIGHT;
board.squares[7][6].pieceColor = WHITE;
//BISHOPS
board.squares[0][2].pezzo = BISHOP;
board.squares[0][2].pieceColor = BLACK;
board.squares[0][5].pezzo = BISHOP;
board.squares[0][5].pieceColor = BLACK;
board.squares[7][2].pezzo = BISHOP;
board.squares[7][2].pieceColor = WHITE;
board.squares[7][5].pezzo = BISHOP;
board.squares[7][5].pieceColor = WHITE;
//QUEENS
board.squares[0][3].pezzo = QUEEN;
board.squares[0][3].pieceColor = BLACK;
board.squares[7][3].pezzo = QUEEN;
board.squares[7][3].pieceColor = WHITE;
//KINGS
board.squares[0][4].pezzo = KING;
board.squares[0][4].pieceColor = BLACK;
board.squares[7][4].pezzo = KING;
board.squares[7][4].pieceColor = WHITE;
}
void inputInterface(bool whiteTurn, bool drawRequest[]){
if(whiteTurn == WHITE){
yellow();
if(drawRequest[0]){
printf("\nBlack player has offered a draw, digit [accept] or [deny]");
printf("\nwhenever you want for accepting or denying.\n");
}else{
if(drawRequest[1])
printf("\nDraw offer pending.");
}
reset();
printf("\nIt's WHITE turn, digit your move --> ");
}else{
yellow();
if(drawRequest[1]){
printf("\nBLACK player has offered a draw, digit [accept] or [deny]");
printf("\nwhenever you want for accepting or denying.\n");
}else{
if(drawRequest[0])
printf("\nDraw offer pending.");
}
reset();
printf("\nIt's BLACK turn, digit your move --> ");
}
}
void showInvalidMoveWarning(int index){
red();
switch(index){
case 0: printf("Invalid move!\n"); break;
case 1: printf("Castling is not possible!\n"); break;
case 2: printf("The wanted piece cannot reach that position! [pieceFinder] \n"); break;
case 3: printf("The wanted piece cannot reach that position! [pieceMover] \n"); break;
case 4: printf("The king would be under check after this move!\n"); break;
case 5: printf("The king is under check!\n"); break;
case 6: printf("Many pieces of the same type can reach that position, please specify which one you want!\n");
case 7: printf("The wanted piece cannot reach that position!! []pieceReverseFinder \n"); break;
default: break;
}
reset();
}
int convertCharCoords(char ch){
switch(ch){
case 'a': return 0;
case 'b': return 1;
case 'c': return 2;
case 'd': return 3;
case 'e': return 4;
case 'f': return 5;
case 'g': return 6;
case 'h': return 7;
}
}
int convertIntCoords(int n){
switch(n){
case 1: return 7;
case 2: return 6;
case 3: return 5;
case 4: return 4;
case 5: return 3;
case 6: return 2;
case 7: return 1;
case 8: return 0;
}
}
void deleteStoredPossibleMoves(){
int i, j;
for(i = 0; i<32; i++)
{
for(j=0; j<2; j++)
possibleMoves[i][j]= -1;
}
}
void deleteStoredCheckMoves(){
int i, j;
for(i = 0; i<64; i++)
{
for(j=0; j<2; j++)
possibleCheckMoves[i][j]= -1;
}
}
int getNumberOfMoves(){
int i, j, count = 0;
for(i=0; i<32; i++){
if(possibleMoves[i][0] != -1)
count++;
}
return count;
}
int getNumberOfCheckMoves(){
int i, j, count = 0;
for(i=0; i<64; i++){
if(possibleCheckMoves[i][0] != -1)
count++;
}
return count;
}
void addPossibleMove(int x, int y){
int count = getNumberOfMoves();
possibleMoves[count][0] = x;
possibleMoves[count][1] = y;
}
void addPossibleCheckMove(int x, int y){
int i, count = getNumberOfCheckMoves();
bool found = false;
for(i = 0; i<getNumberOfCheckMoves()+1; i++){ //Check if coords are already stored
if(x == possibleCheckMoves[i][0]){
if(y == possibleCheckMoves[i][1]){
found = true;
}
}
}
if(!found){
possibleCheckMoves[count][0] = x;
possibleCheckMoves[count][1] = y;
}
}
bool isUnderCheckAt(int x, int y, int pieceColor, bool recalculate){
int i;
if(recalculate){ //Recalculation of positions where the pieceColor king cannot go
deleteStoredCheckMoves();
calculateCheckSquares(!pieceColor); //The colour is inverted, so i can check if enemy pieces can check the pieceColor king
}
for(i = 0; i<getNumberOfCheckMoves()+1; i++){
if(x == possibleCheckMoves[i][0]){
if(y == possibleCheckMoves[i][1]){
return true;
}
}
}
return false;
}
void findKing(int*x, int*y, int pieceColor){
bool found = false;
int i = 0, j = 0;
while(!found){
j=0;
while(!found && j<8){
if(board.squares[i][j].pezzo == KING && board.squares[i][j].pieceColor == pieceColor){
found = true;
*x = i;
*y = j;
}
j++;
}
i++;
}
}
bool isKingUnderCheck(int pieceColor){
int x, y;
findKing(&x, &y, pieceColor);
return isUnderCheckAt(x, y, pieceColor, true);
}
bool isKingUnderCheckAfterMove(int moveCoordsData[], PIECES pieceToBeMovedTemp, int playerColorTurn){
Square tempBoard[8][8];
bool underCheck = false;
memcpy(tempBoard, board.squares, 8*8*sizeof(Square));
pieceMover(moveCoordsData, playerColorTurn, pieceToBeMovedTemp);
if(isKingUnderCheck(playerColorTurn))
underCheck = true;
memcpy(board.squares, tempBoard, 8*8*sizeof(Square));
return underCheck;
}
void pawnCalculator(int x, int y, int pieceColor){
deleteStoredPossibleMoves();
if(pieceColor == WHITE){ //If white is playing
if(board.squares[x-1][y].pezzo == EMPTY && x != 0){ //I check if the pawn can go forward
if(x == 6 && pieceColor == WHITE){ //I check if its starting position hasn't changed since initialization
addPossibleMove(x-1, y);
addPossibleMove(x-2, y);
}else{
addPossibleMove(x-1, y);
}
}
if(y != 0){ //I check if the pawn is located adjacent to the left side
if(x != 0){ //I check if the pawn is located adjacent to the upper side
addPossibleCheckMove(x-1, y-1);
if(board.squares[x-1][y-1].pezzo != EMPTY && board.squares[x-1][y-1].pieceColor == BLACK) //I check if the pawn can eat another piece diagonally
addPossibleMove(x-1, y-1);
}
}
if(y != 7){ //I check if the pawn is located adjacent to the right side
if(x != 0){ //I check if the pawn is located adjacent to the lower side
addPossibleCheckMove(x-1, y+1);
if(board.squares[x-1][y+1].pezzo != EMPTY && board.squares[x-1][y+1].pieceColor == BLACK) //I check if the pawn can eat another piece diagonally
addPossibleMove(x-1, y+1);
}
}
}else{ //If black is playing, checks are the same but mirrored
if(board.squares[x+1][y].pezzo == EMPTY && x != 7){
if(x == 1 && pieceColor == BLACK){
addPossibleMove(x+1, y);
addPossibleMove(x+2, y);
}else{
addPossibleMove(x+1, y);
}
}
if(y != 0){
if(x != 7){
addPossibleCheckMove(x+1, y-1);
if(board.squares[x+1][y-1].pezzo != EMPTY && board.squares[x+1][y-1].pieceColor == WHITE)
addPossibleMove(x+1, y-1);
}
}
if(y != 7){
if(x != 7){
addPossibleCheckMove(x+1, y+1);
if(board.squares[x+1][y+1].pezzo != EMPTY && board.squares[x+1][y+1].pieceColor == WHITE)
addPossibleMove(x+1, y+1);
}
}
}
}
void pieceCalculator(int x, int y, int pieceNeeded, int pieceColor, bool check){
int rcdChecked = 0, maxrcdChecked = 4, startX, startY, xAdder, yAdder;
bool border, piece, skip;
deleteStoredPossibleMoves();
if(check){ //if the king is being moved
deleteStoredCheckMoves();
calculateCheckSquares(!pieceColor);
}
while(rcdChecked != maxrcdChecked){
border = false;
piece = false;
startX = x;
startY = y;
switch(pieceNeeded){
case BISHOP: BishopSwitch; break;
case KNIGHT: maxrcdChecked = 8; KnightSwitch; break;
case ROOK: RookSwitch; break;
case QUEEN:
case KING: KingQueenSwitch; maxrcdChecked = 8; break;
}
while(!border && !piece){
startX+=xAdder;
startY+=yAdder;
if((startX > -1 && startX < 8) && (startY > -1 && startY < 8)){ // If i don't find borders
if(board.squares[startX][startY].pezzo == EMPTY){ //If i don't find PIECES
if(pieceNeeded == KING){
if(!isUnderCheckAt(startX, startY, pieceColor, false))
addPossibleMove(startX, startY);
}else
addPossibleMove(startX, startY);
}else{
if(board.squares[startX][startY].pieceColor != pieceColor){//If i'm checking for check moves, the even this piece is added cause it's protected
if(pieceNeeded == KING){
if(!isUnderCheckAt(startX, startY, pieceColor, false))
addPossibleMove(startX, startY);
}else
addPossibleMove(startX, startY);
}else{
if(!check) //this check avoids that the pieceColor king is taken in consideration
addPossibleCheckMove(startX, startY);
}
if(pieceNeeded != KNIGHT){ //this prevents the pieceColor king from going under check if moving backward on a row/diagonal/column which is entirely controlled by an enemy piece
if(board.squares[startX][startY].pezzo != KING){
piece = true;
}else{
if(board.squares[startX][startY].pieceColor == pieceColor)
piece = true;
}
}
}
if(pieceNeeded == KNIGHT || pieceNeeded == KING)//this is needed for stopping kings and knights from looping over unneeded squares
break;
}else{
border = true;
}
}
rcdChecked++;
}
}
void calculateCheckSquares(int pieceColor){
int i, j, k, possibleMovesClone[32][2];
memcpy(possibleMovesClone, possibleMoves, 32*2*sizeof(int)); //This is needed in order to preserve the stored moves, look at line 887
for(i = 0; i < 8; i++){
for(j = 0; j < 8; j++){
if(board.squares[i][j].pezzo != EMPTY && board.squares[i][j].pieceColor == pieceColor){
if(board.squares[i][j].pezzo == PAWN)
pawnCalculator(i, j, board.squares[i][j].pieceColor);
else{
pieceCalculator(i, j, board.squares[i][j].pezzo, board.squares[i][j].pieceColor, false);
for(k=0; k<getNumberOfMoves()+1; k++){
if(possibleMoves[k][0] != -1){
addPossibleCheckMove(possibleMoves[k][0], possibleMoves[k][1]);
}
}
}
}
}
}
memcpy(possibleMoves, possibleMovesClone, 32*2*sizeof(int));
}
int pieceReverseFinder(int pieceColor, int pieceNeeded, int moveCoordsData[]){
int i = 0, rcdChecked = 0, startX, startY, xAdder, yAdder, foundX, foundY, piecesFound = 0, maxrcdChecked = 4;
bool skip, found;
deleteStoredPossibleMoves();
while(rcdChecked != maxrcdChecked){
skip = false;
found = false;
startX = moveCoordsData[XDESTINATION];
startY = moveCoordsData[YDESTINATION];
switch(pieceNeeded){
case BISHOP: BishopSwitch; break;
case KNIGHT: maxrcdChecked = 8; KnightSwitch; break;
case ROOK: RookSwitch; break;
case QUEEN:
case KING: KingQueenSwitch; maxrcdChecked = 8; break;
}
while(!skip && !found){
startX+=xAdder;
startY+=yAdder;
if((startX > -1 && startX < 8) && (startY > -1 && startY < 8)){ //If i don't find borders
if(board.squares[startX][startY].pezzo == EMPTY){ //If i don't find PIECES
if(pieceNeeded == KNIGHT || pieceNeeded == KING)
skip = true;
}else{
if(board.squares[startX][startY].pezzo == pieceNeeded && board.squares[startX][startY].pieceColor == pieceColor){ //se mi trovo su un pezzo giusto
foundX = startX;
foundY = startY;
found = true;
piecesFound++;
}else{
skip = true;
}
}
}else{
skip = true;
}
}
rcdChecked++;
}
switch(piecesFound){
case 0: return 7;
case 1: moveCoordsData[XPIECE] = foundX;
moveCoordsData[YPIECE] = foundY;
return -1;
default: if(moveCoordsData[YPIECE] == -2) //if the move doesn't specify which piece, then i return an error
return 6;
while(i<8){ //I look for pawns on moveCoordsData[YPIECE] and i select the first one i find
if(board.squares[i][moveCoordsData[YPIECE]].pezzo == pieceNeeded && board.squares[i][moveCoordsData[YPIECE]].pieceColor == pieceColor){ //se trovo il pezzo
moveCoordsData[XPIECE] = i;
return -1;
}
i++;
}
}
}
int pieceFinder(int pattern, char currentPosition[], char nextMove[], int moveCoordsData[], PIECES pieceToBeMoved, int playerColorTurn){
int letterIndex, i=0, j;
switch(pattern){
case 3: moveCoordsData[YDESTINATION] = convertCharCoords(currentPosition[0]); //[e4]
moveCoordsData[XDESTINATION] = convertIntCoords(currentPosition[1] - '0');
break;
case 4: moveCoordsData[YDESTINATION] = convertCharCoords(currentPosition[1]); //[Bb4]
moveCoordsData[XDESTINATION] = convertIntCoords(currentPosition[2] - '0');
break;
case 5:
moveCoordsData[YDESTINATION] = convertCharCoords(nextMove[0]); //[Bxd4]
moveCoordsData[XDESTINATION] = convertIntCoords(nextMove[1] - '0');
break;
case 6: //[e4xd5]
case 7: moveCoordsData[XPIECE] = convertIntCoords(currentPosition[2] - '0'); //[Be4xd5]
moveCoordsData[YPIECE] = convertCharCoords(currentPosition[1]);
if(board.squares[moveCoordsData[XPIECE]][moveCoordsData[YPIECE]].pezzo == pieceToBeMoved && board.squares[moveCoordsData[XPIECE]][moveCoordsData[YPIECE]].pieceColor == playerColorTurn){
moveCoordsData[YDESTINATION] = convertCharCoords(nextMove[0]);
moveCoordsData[XDESTINATION] = convertIntCoords(nextMove[1] - '0');
return -1;
}
break;
case 8: moveCoordsData[YDESTINATION] = convertCharCoords(nextMove[0]); //[Rac1]
moveCoordsData[XDESTINATION] = convertIntCoords(nextMove[1] - '0');
moveCoordsData[YPIECE] = convertCharCoords(currentPosition[1]);
break;
}
if(pattern <= 5 || pattern == 8){ //In case of patterns 1,2,3,8 i only have destination coords, i need to find the starting coords.
if(pieceToBeMoved != PAWN)
return pieceReverseFinder(playerColorTurn, pieceToBeMoved, moveCoordsData);
else{
letterIndex = convertCharCoords(currentPosition[0]);
while(i<8){ //I look for the pawn on the letterIndex column