terminal-chess: src/chess/rules.h@824c9522ce66

     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 POS_UNSPECIFIED UINT8_MAX

    99 #define mdst(b,m) b[(m)->torow][(m)->tofile]

   100 #define msrc(b,m) b[(m)->fromrow][(m)->fromfile]

   102 #define isidx(idx) ((uint8_t)idx < 8)

   104 #define isfile(file) (file >= 'a' && file <= 'h')

   105 #define isrow(row) (row >= '1' && row <= '8')

   107 #define rowidx(row) (row-'1')

   108 #define fileidx(file) (file-'a')

   110 #define rowchr(row) (row+'1')

   111 #define filechr(file) (file+'a')

   113 #define chkidx(move) (isidx((move)->fromfile) && isidx((move)->fromrow) && \

   114         isidx((move)->tofile) && isidx((move)->torow))

   116 /* secure versions - use, if index is not checked with isidx() */

   117 #define fileidx_s(c) (isfile(c)?fileidx(c):POS_UNSPECIFIED)

   118 #define rowidx_s(c) (isrow(c)?rowidx(c):POS_UNSPECIFIED)

   120 void gamestate_cleanup(GameState *gamestate);

   122 /**

   123  * Maps a character to a piece.

   124  *

   125  * Does not work for pawns, since they don't have a character.

   126  *

   127  * @param c one of R,N,B,Q,K

   128  * @return numeric value for the specified piece

   129  */

   130 uint8_t getpiece(char c);

   132 /**

   133  * Maps a piece to a character.

   134  *

   135  * Does not work for pawns, scince they don't have a character.

   136  *

   137  * @param piece one of ROOK, KNIGHT, BISHOP, QUEEN, KING

   138  * @return character value for the specified piece

   139  */

   140 char getpiecechr(uint8_t piece);

   142 /**

   143  * Evaluates a move syntactically and stores the move data in the specified

   144  * object.

   145  *

   146  * @param gamestate the current game state

   147  * @param mstr the input string to parse

   148  * @param move a pointer to object where the move data shall be stored

   149  * @return status code (see rules/rules.h for the list of codes)

   150  */

   151 int eval_move(GameState *gamestate, char *mstr, Move *move);

   153 /**

   154  * Validates move by applying chess rules.

   155  * @param gamestate the current game state

   156  * @param move the move to validate

   157  * @return TRUE, if the move complies to chess rules, FALSE otherwise

   158  */

   159 _Bool validate_move(GameState *gamestate, Move *move);

   161 /**

   162  * Applies a move and deletes captured pieces.

   163  *

   164  * @param gamestate the current game state

   165  * @param move the move to apply

   166  */

   167 void apply_move(GameState *gamestate, Move *move);

   169 #endif	/* RULES_H */

Mercurial > hg > terminal-chess / file revision