Tue, 01 Apr 2014 12:30:25 +0200
implemented king
1 /*
2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
3 *
4 * Copyright 2014 Mike Becker. All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions are met:
8 *
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 *
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
17 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
20 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
21 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
22 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
23 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
24 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
25 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
26 * POSSIBILITY OF SUCH DAMAGE.
27 *
28 */
30 #ifndef RULES_H
31 #define RULES_H
33 #include <stdint.h>
35 #define VALID_MOVE_SYNTAX 0
36 #define INVALID_MOVE_SYNTAX 1
37 #define INVALID_POSITION 2
38 #define AMBIGUOUS_MOVE 3
39 #define NEED_PROMOTION 4
42 #define PIECE_MASK 0x0F
43 #define COLOR_MASK 0x30
44 #define ENPASSANT_THREAT 0x40
46 #define WHITE 0x10
47 #define BLACK 0x20
49 #define PAWN 0x01
50 #define ROOK 0x02
51 #define KNIGHT 0x03
52 #define BISHOP 0x04
53 #define QUEEN 0x05
54 #define KING 0x06
56 #define WPAWN (WHITE|PAWN)
57 #define WROOK (WHITE|ROOK)
58 #define WKNIGHT (WHITE|KNIGHT)
59 #define WBISHOP (WHITE|BISHOP)
60 #define WQUEEN (WHITE|QUEEN)
61 #define WKING (WHITE|KING)
62 #define BPAWN (BLACK|PAWN)
63 #define BROOK (BLACK|ROOK)
64 #define BKNIGHT (BLACK|KNIGHT)
65 #define BBISHOP (BLACK|BISHOP)
66 #define BQUEEN (BLACK|QUEEN)
67 #define BKING (BLACK|KING)
69 typedef uint8_t Board[8][8];
72 typedef struct {
73 uint8_t piece;
74 uint8_t fromfile;
75 uint8_t fromrow;
76 uint8_t tofile;
77 uint8_t torow;
78 uint8_t promotion;
79 _Bool check;
80 _Bool checkmate;
81 _Bool capture;
82 } Move;
84 typedef struct MoveList MoveList;
86 struct MoveList {
87 Move move;
88 MoveList* next;
89 };
91 typedef struct {
92 Board board;
93 uint8_t mycolor;
94 MoveList* movelist;
95 MoveList* lastmove;
96 } GameState;
98 #define opponent_color(color) ((color)==WHITE?BLACK:WHITE)
100 #define POS_UNSPECIFIED UINT8_MAX
101 #define mdst(b,m) b[(m)->torow][(m)->tofile]
102 #define msrc(b,m) b[(m)->fromrow][(m)->fromfile]
104 #define isidx(idx) ((uint8_t)idx < 8)
106 #define isfile(file) (file >= 'a' && file <= 'h')
107 #define isrow(row) (row >= '1' && row <= '8')
109 #define rowidx(row) (row-'1')
110 #define fileidx(file) (file-'a')
112 #define rowchr(row) (row+'1')
113 #define filechr(file) (file+'a')
115 #define chkidx(move) (isidx((move)->fromfile) && isidx((move)->fromrow) && \
116 isidx((move)->tofile) && isidx((move)->torow))
118 /* secure versions - use, if index is not checked with isidx() */
119 #define fileidx_s(c) (isfile(c)?fileidx(c):POS_UNSPECIFIED)
120 #define rowidx_s(c) (isrow(c)?rowidx(c):POS_UNSPECIFIED)
122 void gamestate_cleanup(GameState *gamestate);
124 /**
125 * Maps a character to a piece.
126 *
127 * Does not work for pawns, since they don't have a character.
128 *
129 * @param c one of R,N,B,Q,K
130 * @return numeric value for the specified piece
131 */
132 uint8_t getpiece(char c);
134 /**
135 * Maps a piece to a character.
136 *
137 * Does not work for pawns, scince they don't have a character.
138 *
139 * @param piece one of ROOK, KNIGHT, BISHOP, QUEEN, KING
140 * @return character value for the specified piece
141 */
142 char getpiecechr(uint8_t piece);
144 /**
145 * Checks, if a specified field is covered by a piece of a certain color.
146 *
147 * @param gamestate the current game state
148 * @param row row of the field to check
149 * @param file file of the field to check
150 * @param color the color of the piece that should cover the field
151 * @return TRUE, if any piece of the specified color threatens the specified
152 * field (i.e. could capture an opponent piece)
153 */
154 _Bool is_covered(GameState *gamestate,uint8_t row,uint8_t file,uint8_t color);
156 /**
157 * Evaluates a move syntactically and stores the move data in the specified
158 * object.
159 *
160 * @param gamestate the current game state
161 * @param mstr the input string to parse
162 * @param move a pointer to object where the move data shall be stored
163 * @return status code (see rules/rules.h for the list of codes)
164 */
165 int eval_move(GameState *gamestate, char *mstr, Move *move);
167 /**
168 * Validates move by applying chess rules.
169 * @param gamestate the current game state
170 * @param move the move to validate
171 * @return TRUE, if the move complies to chess rules, FALSE otherwise
172 */
173 _Bool validate_move(GameState *gamestate, Move *move);
175 /**
176 * Applies a move and deletes captured pieces.
177 *
178 * @param gamestate the current game state
179 * @param move the move to apply
180 */
181 void apply_move(GameState *gamestate, Move *move);
183 #endif /* RULES_H */