summaryrefslogtreecommitdiff
path: root/chesshelpers.c
blob: b64a0f420ae8cbef04574ab11971d5a0613ffcdd (plain)
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
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include "vector.h"
#include "chesshelpers.h"

board_t init_board(int** pieces) {
	board_t board;
	board.pieces = pieces;
	board.whiteCanCastleKingside = 1;
	board.whiteCanCastleQueenside = 1;
	board.blackCanCastleKingside = 1;
	board.blackCanCastleQueenside = 1;
	board.lastPawnMove = -1;
	return board;
}
//function applies side effects to board values like king move state
board_t make_move(board_t board, vector_t origin, vector_t end) {
	int piece = board.pieces[origin.mx][origin.my];
	int captured = board.pieces[end.mx][end.my];
	board.pieces[origin.mx][origin.my] = 0;
	board.pieces[end.mx][end.my] = piece;
	//white king moved
	if(piece == king) {
		board.whiteCanCastleQueenside = 0;
		board.whiteCanCastleKingside = 0;
		//if the king moved farther than it normally could, move must have been castling. move the rook as well
		if(origin.mx == 4 && end.mx == 6) {
			board = make_move(board, init_vector(7, 7), init_vector(5, 7));
		}
		else if(origin.mx == 4 && end.mx == 2) {
			board = make_move(board, init_vector(0, 7), init_vector(3, 7));
		}
	}
	//white kingside rook moved
	else if(origin.mx == 7 && origin.my == 7) {
		board.whiteCanCastleKingside = 0;
	}
	//white queenside rook moved
	else if(origin.mx == 0 && origin.my == 7) {
		board.whiteCanCastleQueenside = 0;
	}
	//black king moved
	else if(piece == king + 6) {
		board.blackCanCastleQueenside = 0;
		board.blackCanCastleKingside = 0;
		//if the king moved farther than it normally could, move must have been castling. move the rook as well
		if(origin.mx == 4 && end.mx == 6) {
			board = make_move(board, init_vector(7, 0), init_vector(5, 0));
		}
		else if(origin.mx == 4 && end.mx == 2) {
			board = make_move(board, init_vector(0, 0), init_vector(3, 0));
		}
	}
	//black kingside rook moved
	else if(origin.mx == 7 && origin.my == 0) {
		board.blackCanCastleKingside = 0;
	}
	//black queenside rook moved
	else if(origin.mx == 0 && origin.my == 0) {
		board.blackCanCastleQueenside = 0;
	}
	//this is not an else if! lastPawnMove must be reset
	if(piece == pawn || piece == pawn + 6) {
		board.lastPawnMove = origin.mx;
		//check if move was an en passant capture
		if(captured == 0 && origin.mx != end.mx) {
			//kill the enemy pawn
			board.pieces[end.mx][origin.my] = 0;
		}
	}
	else {
		//en passant no longer possible
		board.lastPawnMove = -1;
	}
	return board;
}
board_t clone_board(board_t board) {
	board_t newBoard = board;
	int** pieces = malloc(8 * sizeof(int*));
	for(int r = 0; r < 8; r++) {
		pieces[r] = malloc(8 * sizeof(int));
		for(int c = 0; c < 8; c++) {
			pieces[r][c] = board.pieces[r][c];
		}
	}
	newBoard.pieces = pieces;
	return newBoard;
}
int in_board(vector_t position) {
	return position.mx < 8 && position.mx >= 0 && position.my < 8 && position.my >= 0;
}
int is_empty(board_t board, vector_t position) {
	return board.pieces[position.mx][position.my] == 0;
}
int is_color(board_t board, vector_t position, int color) {
	if(color == 0) {
		return board.pieces[position.mx][position.my] >= 1 && board.pieces[position.mx][position.my] <= 6;
	}	
	else {
		return board.pieces[position.mx][position.my] >= 7;
	}
}
//returns true if a pawn that moved two squares would have been here if it moved one square
int would_have_been_pawn(board_t board, vector_t position, int color) {
	if(board.lastPawnMove == position.mx) {
		if((position.my == 6 && color == 0) || (position.my == 2 && color == 1)) {
			return 1;
		}
	}
	return 0;
}
//converts board coordinates into algebraic notation
char* get_readable_coords(vector_t position) {
	char* output = malloc(3 * sizeof(char));
	output[0] = 'a' + position.mx;
	output[1] = '8' - position.my;
	output[2] = '\0';
	return output;
}
//gets the proper algebraic notation for the move
char* get_move_name(board_t board, vector_t origin, vector_t end) {
	int piece = board.pieces[origin.mx][origin.my];
	if(piece > 6) {
		piece -= 6;
	}
	if(piece != 1) {
		char cPiece = piece == pawn ? 'P' : piece == knight ? 'N' : piece == bishop ? 'B' : piece == rook ? 'R' : piece == queen ? 'Q' : 'K';
		int isCapture = board.pieces[end.mx][end.my] != 0;
		char* output = calloc(isCapture ? 5 : 4, sizeof(char));
		output[0] = cPiece;
		if(isCapture) {
			output[1] = 'x';
		}
		char* rEnd = get_readable_coords(end);
		strcat(output, rEnd);
		free(rEnd);
		output[isCapture ? 4 : 3] = '\0';
		return output;
	}
	else {
		int isCapture = board.pieces[end.mx][end.my] != 0;
		char* output = calloc(isCapture ? 5 : 3, sizeof(char));
		if(isCapture) {
			output[0] = 'a' + origin.mx;
			output[1] = 'x';
		}
		char* rEnd = get_readable_coords(end);
		strcat(output, rEnd);
		free(rEnd);
		output[isCapture ? 4 : 2] = '\0';
		return output;
	}
}