src/chess/rules.h

Thu, 10 Apr 2014 11:44:55 +0200

author
Mike Becker <universe@uap-core.de>
date
Thu, 10 Apr 2014 11:44:55 +0200
changeset 36
ebe0c961e9a6
parent 33
866025982aa9
child 40
47162a7621da
permissions
-rw-r--r--

reduced awesome great nanosecond precision so we can compile on OS X

     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>
    34 #include <sys/time.h>
    36 #define VALID_MOVE_SYNTAX   0
    37 #define INVALID_MOVE_SYNTAX 1
    38 #define INVALID_POSITION    2
    39 #define AMBIGUOUS_MOVE      3
    40 #define NEED_PROMOTION      4
    43 #define PIECE_MASK       0x0F
    44 #define COLOR_MASK       0x30
    45 #define ENPASSANT_THREAT 0x40
    47 #define WHITE 0x10
    48 #define BLACK 0x20
    50 #define PAWN   0x01
    51 #define ROOK   0x02
    52 #define KNIGHT 0x03
    53 #define BISHOP 0x04
    54 #define QUEEN  0x05
    55 #define KING   0x06
    57 #define WPAWN   (WHITE|PAWN)
    58 #define WROOK   (WHITE|ROOK)
    59 #define WKNIGHT (WHITE|KNIGHT)
    60 #define WBISHOP (WHITE|BISHOP)
    61 #define WQUEEN  (WHITE|QUEEN)
    62 #define WKING   (WHITE|KING)
    63 #define BPAWN   (BLACK|PAWN)
    64 #define BROOK   (BLACK|ROOK)
    65 #define BKNIGHT (BLACK|KNIGHT)
    66 #define BBISHOP (BLACK|BISHOP)
    67 #define BQUEEN  (BLACK|QUEEN)
    68 #define BKING   (BLACK|KING)
    70 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     struct timeval timestamp;
    80     struct timeval movetime;
    81     _Bool check;
    82     _Bool capture;
    83 } Move;
    85 typedef struct MoveList MoveList;
    87 struct MoveList {
    88     Move move;
    89     MoveList* next;
    90 };
    93 typedef struct {
    94     uint8_t servercolor;
    95     _Bool timecontrol;
    96     uint16_t time;
    97     uint16_t addtime;
    98 } GameInfo;
   100 typedef struct {
   101     Board board;
   102     uint8_t mycolor;
   103     MoveList* movelist;
   104     MoveList* lastmove;
   105     _Bool checkmate;
   106     _Bool stalemate;
   107 } GameState;
   109 #define opponent_color(color) ((color)==WHITE?BLACK:WHITE)
   111 #define POS_UNSPECIFIED UINT8_MAX
   112 #define mdst(b,m) b[(m)->torow][(m)->tofile]
   113 #define msrc(b,m) b[(m)->fromrow][(m)->fromfile]
   115 #define isidx(idx) ((uint8_t)(idx) < 8)
   117 #define isfile(file) (file >= 'a' && file <= 'h')
   118 #define isrow(row) (row >= '1' && row <= '8')
   120 #define rowidx(row) (row-'1')
   121 #define fileidx(file) (file-'a')
   123 #define rowchr(row) (row+'1')
   124 #define filechr(file) (file+'a')
   126 #define chkidx(move) (isidx((move)->fromfile) && isidx((move)->fromrow) && \
   127         isidx((move)->tofile) && isidx((move)->torow))
   129 /* secure versions - use, if index is not checked with isidx() */
   130 #define fileidx_s(c) (isfile(c)?fileidx(c):POS_UNSPECIFIED)
   131 #define rowidx_s(c) (isrow(c)?rowidx(c):POS_UNSPECIFIED)
   133 void gamestate_cleanup(GameState *gamestate);
   135 /**
   136  * Maps a character to a piece.
   137  * 
   138  * Does not work for pawns, since they don't have a character.
   139  * 
   140  * @param c one of R,N,B,Q,K
   141  * @return numeric value for the specified piece
   142  */
   143 uint8_t getpiece(char c);
   145 /**
   146  * Maps a piece to a character.
   147  * 
   148  * Does not work for pawns, scince they don't have a character.
   149  * 
   150  * @param piece one of ROOK, KNIGHT, BISHOP, QUEEN, KING
   151  * @return character value for the specified piece
   152  */
   153 char getpiecechr(uint8_t piece);
   155 /**
   156  * Checks, if a specified field is covered by a piece of a certain color.
   157  * 
   158  * The out-parameters may both be NULL, but if any of them is set, the other
   159  * must be set, too.
   160  * 
   161  * @param gamestate the current game state
   162  * @param row row of the field to check
   163  * @param file file of the field to check
   164  * @param color the color of the piece that should threaten the field
   165  * @param threats the array where to store the threats (should be able to the
   166  * rare maximum of 16 elements)
   167  * @param threatcount a pointer to an uint8_t where to store the amount of threats
   168  * @return TRUE, if any piece of the specified color threatens the specified
   169  * field (i.e. could capture an opponent piece)
   170  */
   171 _Bool get_threats(GameState *gamestate, uint8_t row, uint8_t file,
   172         uint8_t color, Move* threats, uint8_t* threatcount);
   174 /**
   175  * Checks, if a specified field is covered by a piece of a certain color AND
   176  * if this piece is not pinned and therefore able to perform the move.
   177  * 
   178  * The out-parameters may both be NULL, but if any of them is set, the other
   179  * must be set, too.
   180  * 
   181  * @param gamestate the current game state
   182  * @param row row of the field to check
   183  * @param file file of the field to check
   184  * @param color the color of the piece that should threaten the field
   185  * @param threats the array where to store the threats (should be able to the
   186  * rare maximum of 16 elements)
   187  * @param threatcount a pointer to an uint8_t where to store the amount of threats
   188  * @return TRUE, if any piece of the specified color threatens the specified
   189  * field (i.e. could capture an opponent piece)
   190  */
   191 _Bool get_real_threats(GameState *gamestate, uint8_t row, uint8_t file,
   192         uint8_t color, Move* threats, uint8_t* threatcount);
   194 /**
   195  * Checks, if a specified field is covered by a piece of a certain color.
   196  * 
   197  * @param gamestate the current game state
   198  * @param row row of the field to check
   199  * @param file file of the field to check
   200  * @param color the color of the piece that should cover the field
   201  * @return TRUE, if any piece of the specified color threatens the specified
   202  * field
   203  */
   204 #define is_covered(gamestate, row, file, color) \
   205     get_threats(gamestate, row, file, color, NULL, NULL)
   207 /**
   208  * Checks, if a specified field is attacked by a piece of a certain color.
   209  * 
   210  * I.e. the field is covered by a piece AND this piece is not pinned and
   211  * therefore able to perform the move.
   212  * 
   213  * @param gamestate the current game state
   214  * @param row row of the field to check
   215  * @param file file of the field to check
   216  * @param color the color of the piece that should cover the field
   217  * @return TRUE, if any piece of the specified color threatens the specified
   218  * field and could capture an opponent piece
   219  */
   220 #define is_attacked(gamestate, row, file, color) \
   221     get_threats(gamestate, row, file, color, NULL, NULL)
   223 /**
   224  * Checks, if a specified field is protected by a piece of a certain color.
   225  * 
   226  * I.e. the field is covered by a piece that is NOT the king AND this piece is
   227  * not pinned and therefore able to perform the move.
   228  * 
   229  * @param gamestate the current game state
   230  * @param row row of the field to check
   231  * @param file file of the field to check
   232  * @param color the color of the piece that should cover the field
   233  * @return TRUE, if any piece (excluding the king) of the specified color
   234  * threatens the specified field and could capture an opponent piece
   235  */
   236 _Bool is_protected(GameState *gamestate, uint8_t row, uint8_t file,
   237         uint8_t color);
   239 /**
   240  * Evaluates a move syntactically and stores the move data in the specified
   241  * object.
   242  * 
   243  * @param gamestate the current game state
   244  * @param mstr the input string to parse
   245  * @param move a pointer to object where the move data shall be stored
   246  * @return status code (see rules/rules.h for the list of codes)
   247  */
   248 int eval_move(GameState *gamestate, char *mstr, Move *move);
   250 /**
   251  * Validates move by applying chess rules.
   252  * @param gamestate the current game state
   253  * @param move the move to validate
   254  * @return TRUE, if the move complies to chess rules, FALSE otherwise
   255  */
   256 _Bool validate_move(GameState *gamestate, Move *move);
   258 /**
   259  * Applies a move and deletes captured pieces.
   260  * 
   261  * @param gamestate the current game state
   262  * @param move the move to apply
   263  */
   264 void apply_move(GameState *gamestate, Move *move);
   267 /**
   268  * Returns the remaining time on the clock for the specified player.
   269  *
   270  * @param gameinfo the information about the game
   271  * @param gamestate the current game state
   272  * @param color either BLACK or WHITE
   273  * @return the remaining time - if time control is disabled, this function
   274  * always returns zero
   275  */
   276 uint16_t remaining_movetime(GameInfo *gameinfo, GameState *gamestate,
   277         uint8_t color);
   279 #endif	/* RULES_H */

mercurial