This repository has been archived by the owner on Jan 29, 2025. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathboard.h
74 lines (58 loc) · 1.6 KB
/
board.h
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
/*
* Danican version 0.5.2
* Copyright (C) 2002 Christian Obrecht
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#define MAX_CAPTURES 16
typedef struct {
char start;
char end;
char capture [MAX_CAPTURES];
char numCaptures;
} _ply;
#define MAX_PLIES 127
typedef struct {
_ply ply [MAX_PLIES];
char index;
char maxCaptures;
} _plyList;
#define EMPTY 0
#define MAN_BLACK 1
#define KING_BLACK 2
#define MAN_WHITE 4
#define KING_WHITE 8
#define STOP 16
#define BLACK 3
#define WHITE 12
#define NORTH_EAST 0
#define NORTH_WEST 1
#define SOUTH_EAST 2
#define SOUTH_WEST 3
typedef struct {
char place [51];
char opponent;
char man;
char king;
char right;
char left;
} _board;
_board* initBoard (void);
_board* createBoard (void);
_board* copyBoard (const _board* source);
int testCapture (_board*);
_plyList* makePlyList (_board*);
void doPly (_board*, _plyList*, int);
int findPly (_plyList*, char, char);