-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlead.cpp
More file actions
399 lines (296 loc) · 10.3 KB
/
lead.cpp
File metadata and controls
399 lines (296 loc) · 10.3 KB
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
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
/***************************************************************************/
/** Microsoft Windows **/
/** Copyright(c) Microsoft Corp., 1991, 1992 **/
/***************************************************************************/
/****************************************************************************
lead.cpp -- wxWidgets port
Aug 92, JimH
May 93, JimH chico port
Logic to select lead card is here
****************************************************************************/
#include "hearts.h"
#include "main.h"
#include "resource.h"
#include "debug.h" // undef _DEBUG instead to remove messages
/****************************************************************************
computer::SelectLeadCard
****************************************************************************/
SLOT computer::SelectLeadCard(handinfotype &h)
{
SLOT s;
TRACE0("leading. ");
// count cards left and check for two of clubs
SLOT s2Clubs = EMPTY;
int cTricksLeft = 0;
for (s = 0; s < MAXSLOT; s++)
{
if (cd[s].IsValid())
{
cTricksLeft++;
if (cd[s].ID() == TWOCLUBS)
s2Clubs = s;
}
}
if (s2Clubs != EMPTY)
{
TRACE0("lead 2 of clubs. ");
return s2Clubs;
}
// If the Queen of Spades has not yet been played, try to force it out.
// See if we are "spade safe" -- i.e., if we have no spades that are
// queen or higher. If we are safe, lead the lowest spade.
if (!h.bQSPlayed) // this is only interesting if queen not yet played
{
bool bHaveSpades = (sLowCard[SPADES] != EMPTY);
bool bSpadeSafe = (nHighVal[SPADES] < QUEEN);
if (bHaveSpades && bSpadeSafe)
{
TRACE0("try to force out spades, ");
PLAY(sLowCard[SPADES]);
return sLowCard[SPADES];
}
}
// Now we just want to lead the lowest card of the best suit
int suit = SureLossSuit(h.bHeartsBroken);
if (suit == EMPTY)
suit = BestSuitToLose(h.bHeartsBroken);
// Be brave early on and lead a card near the midpoint of the suit
// (if the queen of spades has been played already.)
// Later on, just lead the lowest card of that suit.
if (cTricksLeft > 8 && suit != HEARTS && h.bQSPlayed)
{
TRACE0("try midslot. ");
s = MidSlot(suit);
}
else
{
s = sLowCard[suit];
}
PLAY(s);
return s;
}
/****************************************************************************
computer::NotifyNewRound
Each player gets this call immediately after cards are passed.
It is a chance to initialize tables, etc.
****************************************************************************/
void computer::NotifyNewRound()
{
// assume all cards are available
for (int suit = 0; suit < MAXSUIT; suit++)
for (int i = 0; i < (KING+2); i++)
nAvailable[suit][i] = true;
// mark cards in hand as unavailable
for (SLOT s = 0; s < MAXSLOT; s++)
nAvailable[cd[s].Suit()][cd[s].Value2()] = false;
}
/****************************************************************************
computer::NotifyEndHand
Each player gets this call immediately after the hand is completed.
The computer player here looks through the handplayed and marks
those cards are no longer available.
****************************************************************************/
void computer::NotifyEndHand(handinfotype &h)
{
for (int i = 0; i < 4; i++)
nAvailable[h.cardplayed[i]->Suit()][h.cardplayed[i]->Value2()] = false;
}
/****************************************************************************
computer::CardsAboveLow(int suit)
Returns number of available (not yet played) cards that can beat the
low card held for the given suit.
****************************************************************************/
int computer::CardsAboveLow(int suit)
{
int count = 0;
for (int i = nLowVal[suit]+1; i < (KING+2); i++)
if (nAvailable[suit][i])
{
int j = i+1; // zero offset
count++;
}
return count;
}
/****************************************************************************
computer::CardsBelowLow(int suit)
Returns number of available (not yet played) cards that are less than the
low card held for the given suit.
****************************************************************************/
int computer::CardsBelowLow(int suit)
{
int count = 0;
for (int i = ACE+1; i < nLowVal[suit]; i++)
if (nAvailable[suit][i])
{
int j = i+1; // zero offset
count++;
}
return count;
}
/****************************************************************************
computer::BestSuitToLose
Returns the suit with the most CardsAboveLow()
bIncludeHearts defaults to true. Use false if hearts not
yet broken and you're looking for a card to lead.
****************************************************************************/
int computer::BestSuitToLose(bool bIncludeHearts)
{
int best = -1;
int bestsuit = EMPTY;
for (int suit = 0; suit < MAXSUIT; suit++)
{
if (sLowCard[suit] != EMPTY) // if we have a card of this suit
{
if (suit != HEARTS || bIncludeHearts)
{
int count = CardsAboveLow(suit);
#ifdef _DEBUG
TRACE2("%c=%d ", suitid[suit], count);
#endif
if (count == best) // if they're the same, pick lower card
{
if (nLowVal[suit] < nLowVal[bestsuit])
{
bestsuit = suit;
best = count;
}
}
else if (count > best)
{
bestsuit = suit;
best = count;
}
}
}
}
if (bestsuit == EMPTY) // only if all we have are unbroken hearts
return HEARTS;
else
return bestsuit;
}
/****************************************************************************
computer::BestSuitToDump
Returns the suit with the most CardsBelowLow()
This is the most-vulnerable suit.
bIncludeHearts defaults to true.
****************************************************************************/
int computer::BestSuitToDump(bool bIncludeHearts)
{
int best = -1;
int bestsuit = EMPTY;
for (int suit = 0; suit < MAXSUIT; suit++)
{
if (sLowCard[suit] != EMPTY) // if we have a card of this suit
{
if (suit != HEARTS || bIncludeHearts)
{
int count = CardsBelowLow(suit);
#ifdef _DEBUG
TRACE2("%c=%d ", suitid[suit], count);
#endif
if (count == best) // if they're the same, pick lower card
{
if (nLowVal[suit] > nLowVal[bestsuit])
{
bestsuit = suit;
best = count;
}
}
else if (count > best)
{
bestsuit = suit;
best = count;
}
}
}
}
if (bestsuit == EMPTY) // only if all we have are unbroken hearts
return HEARTS;
else
return bestsuit;
}
/****************************************************************************
computer::MidSlot
Instead of choosing the high or low card from a given suit, this function
can be used to pick something in the middle, where middle is defined as
the card with about the same number of available cards above and below it.
****************************************************************************/
SLOT computer::MidSlot(int suit)
{
SLOT midslot = sLowCard[suit];
int maxtricks = CardsAbove(sLowCard[suit]);
int tricks = maxtricks;
for (SLOT s = 0; s < MAXSLOT; s++)
{
if ((cd[s].IsValid()) && (cd[s].Suit()==suit) && (s!=sLowCard[suit]))
{
int above = CardsAbove(s);
if ((above < tricks) && (above > (maxtricks / 2)))
{
midslot = s;
tricks = above;
}
}
}
return midslot;
}
/****************************************************************************
computer::CardsAbove
Similar to CardsAboveLow except that it finds number of cards in the same
suit available from an arbitrary card.
****************************************************************************/
int computer::CardsAbove(SLOT s)
{
int suit = cd[s].Suit();
int count = 0;
for (int i = cd[s].Value2()+1; i < (KING+2); i++)
if (nAvailable[suit][i])
count++;
return count;
}
/****************************************************************************
computer::CardBelow
returns the slot of the next highest card of the same suit, or EMPTY
****************************************************************************/
SLOT computer::CardBelow(SLOT slot)
{
SLOT sBelow = EMPTY;
int suit = cd[slot].Suit();
int value = cd[slot].Value2();
int best = -1;
for (SLOT s = 0; s < MAXSLOT; s++)
{
if ((cd[s].IsValid()) && (cd[s].Suit()==suit) && (cd[s].Value2()<value))
{
if (cd[s].Value2() > best)
{
best = cd[s].Value2();
sBelow = s;
}
}
}
return sBelow;
}
/****************************************************************************
computer::SureLossSuit
Returns a suit that can be led which guarantees a loss of
lead, or EMPTY if none is found.
****************************************************************************/
int computer::SureLossSuit(bool bIncludeHearts)
{
for (int suit = (MAXSUIT-1); suit >= 0; --suit)
{
if (sLowCard[suit] != EMPTY) // if we have a card of this suit
{
if (suit != HEARTS || bIncludeHearts)
{
if (CardsAboveLow(suit) > 0 && CardsBelowLow(suit) == 0)
{
TRACE0("can lose this trick. ");
return suit;
}
}
}
}
return EMPTY;
}