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
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
|
/* portability-macros header prefix */
#if !defined(_MSC_VER)
#define LONGLONG long long
#endif
/* Windows requires a __declspec(dllexport) tag, etc */
#if defined(_WIN32)
# define DLLEXPORT __declspec(dllexport)
# define STDCALL __stdcall
/*# define INT8 __int8*/
#else
# define DLLEXPORT
# define STDCALL
# define INT8 char
#endif
#ifdef __cplusplus
# define EXTERN_C extern "C"
#else
# define EXTERN_C
#endif
#if defined(_WIN32)
# include <windows.h>
# include <process.h>
#endif
/* end of portability-macros section */
/*#define BENCH*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
/*#define STAT*/ /* Define STAT to generate a statistics log, stat.txt */
/*#define TTDEBUG*/ /* Define TTDEBUG to generate transposition table debug information */
/*#define CANCEL*/ /* Define CANCEL to get support for cancelling ongoing search */
#ifdef TTDEBUG
#define SEARCHSIZE 20000
#else
#define SEARCHSIZE 1
#endif
#define CANCELCHECK 200000
#if defined(INFINITY)
# undef INFINITY
#endif
#define INFINITY 32000
#define MAXNODE 1
#define MINNODE 0
#define TRUE 1
#define FALSE 0
#define MOVESVALID 1
#define MOVESLOCKED 2
#define NSIZE 100000
#define WSIZE 100000
#define LSIZE 20000
#define NINIT 250000/*400000*/
#define WINIT 700000/*1000000*/
#define LINIT 50000
#define Max(x, y) (((x) >= (y)) ? (x) : (y))
#define Min(x, y) (((x) <= (y)) ? (x) : (y))
/* "hand" is leading hand, "relative" is hand relative leading
hand.
The handId macro implementation follows a solution
by Thomas Andrews.
All hand identities are given as
0=NORTH, 1=EAST, 2=SOUTH, 3=WEST. */
#define handId(hand, relative) (hand + relative) & 3
struct gameInfo { /* All info of a particular deal */
/*int vulnerable;*/
int declarer;
/*int contract;*/
int leadHand;
int leadSuit;
int leadRank;
int first;
int noOfCards;
unsigned short int suit[4][4];
/* 1st index is hand id, 2nd index is suit id */
};
struct dealType {
unsigned short int deal[4][4];
};
struct moveType {
unsigned char suit;
unsigned char rank;
unsigned short int sequence; /* Whether or not this move is
the first in a sequence */
short int weight; /* Weight used at sorting */
};
struct movePlyType {
struct moveType move[14];
int current;
int last;
};
struct highCardType {
int rank;
int hand;
};
struct futureTricks {
int nodes;
#ifdef BENCH
int totalNodes;
#endif
int cards;
int suit[13];
int rank[13];
int equals[13];
int score[13];
};
struct deal {
int trump;
int first;
int currentTrickSuit[3];
int currentTrickRank[3];
unsigned int remainCards[4][4];
};
struct makeType {
unsigned short int winRanks[4];
};
struct pos {
unsigned short int rankInSuit[4][4]; /* 1st index is hand, 2nd index is
suit id */
int orderSet[4];
int winOrderSet[4];
int winMask[4];
int leastWin[4];
unsigned short int removedRanks[4]; /* Ranks removed from board,
index is suit */
unsigned short int winRanks[50][4]; /* Cards that win by rank,
indices are depth and suit */
unsigned char length[4][4];
char ubound;
char lbound;
char bestMoveSuit;
char bestMoveRank;
int first[50]; /* Hand that leads the trick for each ply*/
int high[50]; /* Hand that is presently winning the trick */
struct moveType move[50]; /* Presently winning move */
int handRelFirst; /* The current hand, relative first hand */
int tricksMAX; /* Aggregated tricks won by MAX */
struct highCardType winner[4]; /* Winning rank of the trick,
index is suit id. */
struct highCardType secondBest[4]; /* Second best rank, index is suit id. */
};
struct posSearchType {
struct winCardType * posSearchPoint;
LONGLONG suitLengths;
struct posSearchType * left;
struct posSearchType * right;
};
struct nodeCardsType {
char ubound; /* ubound and
lbound for the N-S side */
char lbound;
char bestMoveSuit;
char bestMoveRank;
char leastWin[4];
};
struct winCardType {
int orderSet;
int winMask;
struct nodeCardsType * first;
struct winCardType * prevWin;
struct winCardType * nextWin;
struct winCardType * next;
};
struct evalType {
int tricks;
unsigned short int winRanks[4];
};
struct relRanksType {
int aggrRanks[4];
int winMask[4];
};
struct adaptWinRanksType {
unsigned short int winRanks[14];
};
struct ttStoreType {
struct nodeCardsType * cardsP;
char tricksLeft;
char target;
char ubound;
char lbound;
unsigned char first;
unsigned short int suit[4][4];
};
extern struct gameInfo game;
extern int newDeal;
extern struct gameInfo * gameStore;
extern struct ttStoreType * ttStore;
extern struct nodeCardsType * nodeCards;
extern struct winCardType * winCards;
extern struct pos position, iniPosition, lookAheadPos;
extern struct moveType move[13];
extern struct movePlyType movePly[50];
extern struct posSearchType * posSearch;
extern struct searchType searchData;
extern struct moveType forbiddenMoves[14]; /* Initial depth moves that will be
excluded from the search */
extern struct moveType initialMoves[4];
extern struct moveType highMove;
extern struct moveType * bestMove;
extern struct relRanksType * rel;
extern struct winCardType **pw;
extern struct nodeCardsType **pn;
extern struct posSearchType **pl;
extern int * highestRank;
extern int * counttable;
extern struct adaptWinRanksType * adaptWins;
extern unsigned short int bitMapRank[16];
extern unsigned short int iniRemovedRanks[4];
extern unsigned short int relRankInSuit[4][4];
extern int sum;
extern int score1Counts[50], score0Counts[50];
extern int c1[50], c2[50], c3[50], c4[50], c5[50], c6[50], c7[50],
c8[50], c9[50];
extern int nodeTypeStore[4]; /* Look-up table for determining if
node is MAXNODE or MINNODE */
extern int lho[4], rho[4], partner[4];
extern int trumpContract;
extern int trump;
extern int nodes; /* Number of nodes searched */
extern int no[50]; /* Number of nodes searched on each
depth level */
extern int payOff;
extern int iniDepth;
extern int treeDepth;
extern int tricksTarget; /* No of tricks for MAX in order to
meet the game goal, e.g. to make the
contract */
extern int tricksTargetOpp; /* Target no of tricks for MAX
opponent */
extern int targetNS;
extern int targetEW;
extern int handToPlay;
extern int nodeSetSize;
extern int winSetSize;
extern int lenSetSize;
extern int lastTTstore;
extern int searchTraceFlag;
extern int countMax;
extern int depthCount;
extern int highHand;
extern int nodeSetSizeLimit;
extern int winSetSizeLimit;
extern int lenSetSizeLimit;
extern int estTricks[4];
extern int recInd;
extern int suppressTTlog;
extern unsigned char suitChar[4];
extern unsigned char rankChar[15];
extern unsigned char handChar[4];
extern int cancelOrdered;
extern int cancelStarted;
extern int threshold;
extern unsigned char cardRank[15], cardSuit[5], cardHand[4];
extern FILE * fp2, *fp7, *fp11;
/* Pointers to logs */
EXTERN_C DLLEXPORT int STDCALL SolveBoard(struct deal dl,
int target, int solutions, int mode, struct futureTricks *futp);
void InitStart(void);
void InitGame(int gameNo, int moveTreeFlag, int first, int handRelFirst);
void InitSearch(struct pos * posPoint, int depth,
struct moveType startMoves[], int first, int mtd);
int ABsearch(struct pos * posPoint, int target, int depth);
struct makeType Make(struct pos * posPoint, int depth);
int MoveGen(struct pos * posPoint, int depth);
void InsertSort(int n, int depth);
void UpdateWinner(struct pos * posPoint, int suit);
void UpdateSecondBest(struct pos * posPoint, int suit);
int WinningMove(struct moveType * mvp1, struct moveType * mvp2);
int AdjustMoveList(void);
int QuickTricks(struct pos * posPoint, int hand,
int depth, int target, int *result);
int LaterTricksMIN(struct pos *posPoint, int hand, int depth, int target);
int LaterTricksMAX(struct pos *posPoint, int hand, int depth, int target);
struct nodeCardsType * CheckSOP(struct pos * posPoint, struct nodeCardsType
* nodep, int target, int tricks, int * result, int *value);
struct nodeCardsType * UpdateSOP(struct pos * posPoint, struct nodeCardsType
* nodep);
struct nodeCardsType * FindSOP(struct pos * posPoint,
struct winCardType * nodeP, int firstHand,
int target, int tricks, int * valp);
struct cardType NextCard(struct cardType card);
struct nodeCardsType * BuildPath(struct pos * posPoint,
struct posSearchType *nodep, int * result);
void BuildSOP(struct pos * posPoint, int tricks, int firstHand, int target,
int depth, int scoreFlag, int score);
struct posSearchType * SearchLenAndInsert(struct posSearchType
* rootp, LONGLONG key, int insertNode, int *result);
void Undo(struct pos * posPoint, int depth);
int CheckDeal(struct moveType * cardp);
int InvBitMapRank(unsigned short bitMap);
int InvWinMask(int mask);
void ReceiveTTstore(struct pos *posPoint, struct nodeCardsType * cardsP, int target, int depth);
int NextMove(struct pos *posPoint, int depth);
int DumpInput(int errCode, struct deal dl, int target, int solutions, int mode);
void Wipe(void);
void AddNodeSet(void);
void AddLenSet(void);
void AddWinSet(void);
|