2 Stockfish, a UCI chess playing engine derived from Glaurung 2.1
3 Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
4 Copyright (C) 2008-2013 Marco Costalba, Joona Kiiski, Tord Romstad
6 Stockfish is free software: you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation, either version 3 of the License, or
9 (at your option) any later version.
11 Stockfish is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program. If not, see <http://www.gnu.org/licenses/>.
32 // Table used to drive the king towards the edge of the board
33 // in KX vs K and KQ vs KR endgames.
34 const int PushToEdges[SQUARE_NB] = {
35 100, 90, 80, 70, 70, 80, 90, 100,
36 90, 70, 60, 50, 50, 60, 70, 90,
37 80, 60, 40, 30, 30, 40, 60, 80,
38 70, 50, 30, 20, 20, 30, 50, 70,
39 70, 50, 30, 20, 20, 30, 50, 70,
40 80, 60, 40, 30, 30, 40, 60, 80,
41 90, 70, 60, 50, 50, 60, 70, 90,
42 100, 90, 80, 70, 70, 80, 90, 100,
45 // Table used to drive the king towards a corner square of the
46 // right color in KBN vs K endgames.
47 const int PushToCorners[SQUARE_NB] = {
48 200, 190, 180, 170, 160, 150, 140, 130,
49 190, 180, 170, 160, 150, 140, 130, 140,
50 180, 170, 155, 140, 140, 125, 140, 150,
51 170, 160, 140, 120, 110, 140, 150, 160,
52 160, 150, 140, 110, 120, 140, 160, 170,
53 150, 140, 125, 140, 140, 155, 170, 180,
54 140, 130, 140, 150, 160, 170, 180, 190,
55 130, 140, 150, 160, 170, 180, 190, 200
58 // Tables used to drive a piece towards or away from another piece
59 const int PushClose[8] = { 0, 0, 100, 80, 60, 40, 20, 10 };
60 const int PushAway [8] = { 0, 5, 20, 40, 60, 80, 90, 100 };
63 bool verify_material(const Position& pos, Color c, Value npm, int num_pawns) {
64 return pos.non_pawn_material(c) == npm && pos.count<PAWN>(c) == num_pawns;
68 // Get the material key of a Position out of the given endgame key code
69 // like "KBPKN". The trick here is to first forge an ad-hoc fen string
70 // and then let a Position object to do the work for us. Note that the
71 // fen string could correspond to an illegal position.
72 Key key(const string& code, Color c) {
74 assert(code.length() > 0 && code.length() < 8);
75 assert(code[0] == 'K');
77 string sides[] = { code.substr(code.find('K', 1)), // Weaker
78 code.substr(0, code.find('K', 1)) }; // Stronger
80 std::transform(sides[c].begin(), sides[c].end(), sides[c].begin(), tolower);
82 string fen = sides[0] + char('0' + int(8 - code.length()))
83 + sides[1] + "/8/8/8/8/8/8/8 w - - 0 10";
85 return Position(fen, false, NULL).material_key();
89 void delete_endgame(const typename M::value_type& p) { delete p.second; }
94 /// Endgames members definitions
96 Endgames::Endgames() {
114 add<KBPPKB>("KBPPKB");
115 add<KRPPKRP>("KRPPKRP");
118 Endgames::~Endgames() {
120 for_each(m1.begin(), m1.end(), delete_endgame<M1>);
121 for_each(m2.begin(), m2.end(), delete_endgame<M2>);
124 template<EndgameType E>
125 void Endgames::add(const string& code) {
127 map((Endgame<E>*)0)[key(code, WHITE)] = new Endgame<E>(WHITE);
128 map((Endgame<E>*)0)[key(code, BLACK)] = new Endgame<E>(BLACK);
132 /// Mate with KX vs K. This function is used to evaluate positions with
133 /// King and plenty of material vs a lone king. It simply gives the
134 /// attacking side a bonus for driving the defending king towards the edge
135 /// of the board, and for keeping the distance between the two kings small.
137 Value Endgame<KXK>::operator()(const Position& pos) const {
139 assert(verify_material(pos, weakerSide, VALUE_ZERO, 0));
140 assert(!pos.checkers()); // Eval is never called when in check
142 // Stalemate detection with lone king
143 if (pos.side_to_move() == weakerSide && !MoveList<LEGAL>(pos).size())
146 Square winnerKSq = pos.king_square(strongerSide);
147 Square loserKSq = pos.king_square(weakerSide);
149 Value result = pos.non_pawn_material(strongerSide)
150 + pos.count<PAWN>(strongerSide) * PawnValueEg
151 + PushToEdges[loserKSq]
152 + PushClose[square_distance(winnerKSq, loserKSq)];
154 if ( pos.count<QUEEN>(strongerSide)
155 || pos.count<ROOK>(strongerSide)
156 || pos.bishop_pair(strongerSide))
157 result += VALUE_KNOWN_WIN;
159 return strongerSide == pos.side_to_move() ? result : -result;
163 /// Mate with KBN vs K. This is similar to KX vs K, but we have to drive the
164 /// defending king towards a corner square of the right color.
166 Value Endgame<KBNK>::operator()(const Position& pos) const {
168 assert(verify_material(pos, strongerSide, KnightValueMg + BishopValueMg, 0));
169 assert(verify_material(pos, weakerSide, VALUE_ZERO, 0));
171 Square winnerKSq = pos.king_square(strongerSide);
172 Square loserKSq = pos.king_square(weakerSide);
173 Square bishopSq = pos.list<BISHOP>(strongerSide)[0];
175 // kbnk_mate_table() tries to drive toward corners A1 or H8,
176 // if we have a bishop that cannot reach the above squares we
177 // mirror the kings so to drive enemy toward corners A8 or H1.
178 if (opposite_colors(bishopSq, SQ_A1))
180 winnerKSq = mirror(winnerKSq);
181 loserKSq = mirror(loserKSq);
184 Value result = VALUE_KNOWN_WIN
185 + PushClose[square_distance(winnerKSq, loserKSq)]
186 + PushToCorners[loserKSq];
188 return strongerSide == pos.side_to_move() ? result : -result;
192 /// KP vs K. This endgame is evaluated with the help of a bitbase.
194 Value Endgame<KPK>::operator()(const Position& pos) const {
196 assert(verify_material(pos, strongerSide, VALUE_ZERO, 1));
197 assert(verify_material(pos, weakerSide, VALUE_ZERO, 0));
199 Square wksq = pos.king_square(strongerSide);
200 Square bksq = pos.king_square(weakerSide);
201 Square psq = pos.list<PAWN>(strongerSide)[0];
202 Color us = pos.side_to_move();
204 if (strongerSide == BLACK)
212 if (file_of(psq) >= FILE_E)
219 if (!Bitbases::probe_kpk(wksq, psq, bksq, us))
222 Value result = VALUE_KNOWN_WIN + PawnValueEg + Value(rank_of(psq));
224 return strongerSide == pos.side_to_move() ? result : -result;
228 /// KR vs KP. This is a somewhat tricky endgame to evaluate precisely without
229 /// a bitbase. The function below returns drawish scores when the pawn is
230 /// far advanced with support of the king, while the attacking king is far
233 Value Endgame<KRKP>::operator()(const Position& pos) const {
235 assert(verify_material(pos, strongerSide, RookValueMg, 0));
236 assert(verify_material(pos, weakerSide, VALUE_ZERO, 1));
238 Square wksq = pos.king_square(strongerSide);
239 Square bksq = pos.king_square(weakerSide);
240 Square rsq = pos.list<ROOK>(strongerSide)[0];
241 Square psq = pos.list<PAWN>(weakerSide)[0];
243 if (strongerSide == BLACK)
251 Square queeningSq = file_of(psq) | RANK_1;
254 // If the stronger side's king is in front of the pawn, it's a win
255 if (wksq < psq && file_of(wksq) == file_of(psq))
256 result = RookValueEg - Value(square_distance(wksq, psq));
258 // If the weaker side's king is too far from the pawn and the rook,
260 else if ( square_distance(bksq, psq) >= 3 + (pos.side_to_move() == weakerSide)
261 && square_distance(bksq, rsq) >= 3)
262 result = RookValueEg - Value(square_distance(wksq, psq));
264 // If the pawn is far advanced and supported by the defending king,
265 // the position is drawish
266 else if ( rank_of(bksq) <= RANK_3
267 && square_distance(bksq, psq) == 1
268 && rank_of(wksq) >= RANK_4
269 && square_distance(wksq, psq) > 2 + (pos.side_to_move() == strongerSide))
270 result = Value(80 - square_distance(wksq, psq) * 8);
274 - Value(square_distance(wksq, psq + DELTA_S) * 8)
275 + Value(square_distance(bksq, psq + DELTA_S) * 8)
276 + Value(square_distance(psq, queeningSq) * 8);
278 return strongerSide == pos.side_to_move() ? result : -result;
282 /// KR vs KB. This is very simple, and always returns drawish scores. The
283 /// score is slightly bigger when the defending king is close to the edge.
285 Value Endgame<KRKB>::operator()(const Position& pos) const {
287 assert(verify_material(pos, strongerSide, RookValueMg, 0));
288 assert(verify_material(pos, weakerSide, BishopValueMg, 0));
290 Value result = Value(PushToEdges[pos.king_square(weakerSide)]);
291 return strongerSide == pos.side_to_move() ? result : -result;
295 /// KR vs KN. The attacking side has slightly better winning chances than
296 /// in KR vs KB, particularly if the king and the knight are far apart.
298 Value Endgame<KRKN>::operator()(const Position& pos) const {
300 assert(verify_material(pos, strongerSide, RookValueMg, 0));
301 assert(verify_material(pos, weakerSide, KnightValueMg, 0));
303 Square bksq = pos.king_square(weakerSide);
304 Square bnsq = pos.list<KNIGHT>(weakerSide)[0];
305 Value result = Value(PushToEdges[bksq] + PushAway[square_distance(bksq, bnsq)]);
306 return strongerSide == pos.side_to_move() ? result : -result;
310 /// KQ vs KP. In general, a win for the stronger side, however, there are a few
311 /// important exceptions. Pawn on 7th rank, A,C,F or H file, with king next can
312 /// be a draw, so we scale down to distance between kings only.
314 Value Endgame<KQKP>::operator()(const Position& pos) const {
316 assert(verify_material(pos, strongerSide, QueenValueMg, 0));
317 assert(verify_material(pos, weakerSide, VALUE_ZERO, 1));
319 Square winnerKSq = pos.king_square(strongerSide);
320 Square loserKSq = pos.king_square(weakerSide);
321 Square pawnSq = pos.list<PAWN>(weakerSide)[0];
323 Value result = Value(PushClose[square_distance(winnerKSq, loserKSq)]);
325 if ( relative_rank(weakerSide, pawnSq) != RANK_7
326 || square_distance(loserKSq, pawnSq) != 1
327 || !((FileABB | FileCBB | FileFBB | FileHBB) & pawnSq))
328 result += QueenValueEg - PawnValueEg;
330 return strongerSide == pos.side_to_move() ? result : -result;
334 /// KQ vs KR. This is almost identical to KX vs K: We give the attacking
335 /// king a bonus for having the kings close together, and for forcing the
336 /// defending king towards the edge. If we also take care to avoid null move
337 /// for the defending side in the search, this is usually sufficient to be
338 /// able to win KQ vs KR.
340 Value Endgame<KQKR>::operator()(const Position& pos) const {
342 assert(verify_material(pos, strongerSide, QueenValueMg, 0));
343 assert(verify_material(pos, weakerSide, RookValueMg, 0));
345 Square winnerKSq = pos.king_square(strongerSide);
346 Square loserKSq = pos.king_square(weakerSide);
348 Value result = QueenValueEg
350 + PushToEdges[loserKSq]
351 + PushClose[square_distance(winnerKSq, loserKSq)];
353 return strongerSide == pos.side_to_move() ? result : -result;
357 /// KBB vs KN. This is almost always a win. We try to push enemy king to a corner
358 /// and away from his knight. For a reference of this difficult endgame see:
359 /// en.wikipedia.org/wiki/Chess_endgame#Effect_of_tablebases_on_endgame_theory
362 Value Endgame<KBBKN>::operator()(const Position& pos) const {
364 assert(verify_material(pos, strongerSide, 2 * BishopValueMg, 0));
365 assert(verify_material(pos, weakerSide, KnightValueMg, 0));
367 Square winnerKSq = pos.king_square(strongerSide);
368 Square loserKSq = pos.king_square(weakerSide);
369 Square knightSq = pos.list<KNIGHT>(weakerSide)[0];
371 Value result = VALUE_KNOWN_WIN
372 + PushToCorners[loserKSq]
373 + PushClose[square_distance(winnerKSq, loserKSq)]
374 + PushAway[square_distance(loserKSq, knightSq)];
376 return strongerSide == pos.side_to_move() ? result : -result;
380 /// Some cases of trivial draws
381 template<> Value Endgame<KNNK>::operator()(const Position&) const { return VALUE_DRAW; }
382 template<> Value Endgame<KmmKm>::operator()(const Position&) const { return VALUE_DRAW; }
385 /// K, bishop and one or more pawns vs K. It checks for draws with rook pawns and
386 /// a bishop of the wrong color. If such a draw is detected, SCALE_FACTOR_DRAW
387 /// is returned. If not, the return value is SCALE_FACTOR_NONE, i.e. no scaling
390 ScaleFactor Endgame<KBPsK>::operator()(const Position& pos) const {
392 assert(pos.non_pawn_material(strongerSide) == BishopValueMg);
393 assert(pos.count<PAWN>(strongerSide) >= 1);
395 // No assertions about the material of weakerSide, because we want draws to
396 // be detected even when the weaker side has some pawns.
398 Bitboard pawns = pos.pieces(strongerSide, PAWN);
399 File pawnFile = file_of(pos.list<PAWN>(strongerSide)[0]);
401 // All pawns are on a single rook file ?
402 if ( (pawnFile == FILE_A || pawnFile == FILE_H)
403 && !(pawns & ~file_bb(pawnFile)))
405 Square bishopSq = pos.list<BISHOP>(strongerSide)[0];
406 Square queeningSq = relative_square(strongerSide, pawnFile | RANK_8);
407 Square kingSq = pos.king_square(weakerSide);
409 if ( opposite_colors(queeningSq, bishopSq)
410 && abs(file_of(kingSq) - pawnFile) <= 1)
412 // The bishop has the wrong color, and the defending king is on the
413 // file of the pawn(s) or the adjacent file. Find the rank of the
415 Square pawnSq = frontmost_sq(strongerSide, pawns);
417 // If the defending king has distance 1 to the promotion square or
418 // is placed somewhere in front of the pawn, it's a draw.
419 if ( square_distance(kingSq, queeningSq) <= 1
420 || relative_rank(weakerSide, kingSq) <= relative_rank(weakerSide, pawnSq))
421 return SCALE_FACTOR_DRAW;
425 // All pawns on same B or G file? Then potential draw
426 if ( (pawnFile == FILE_B || pawnFile == FILE_G)
427 && !(pos.pieces(PAWN) & ~file_bb(pawnFile))
428 && pos.non_pawn_material(weakerSide) == 0
429 && pos.count<PAWN>(weakerSide) >= 1)
431 // Get weakerSide pawn that is closest to home rank
432 Square weakerPawnSq = backmost_sq(weakerSide, pos.pieces(weakerSide, PAWN));
434 Square strongerKingSq = pos.king_square(strongerSide);
435 Square weakerKingSq = pos.king_square(weakerSide);
436 Square bishopSq = pos.list<BISHOP>(strongerSide)[0];
438 // Potential for a draw if our pawn is blocked on the 7th rank
439 // the bishop cannot attack it or they only have one pawn left
440 if ( relative_rank(strongerSide, weakerPawnSq) == RANK_7
441 && (pos.pieces(strongerSide, PAWN) & (weakerPawnSq + pawn_push(weakerSide)))
442 && (opposite_colors(bishopSq, weakerPawnSq) || pos.count<PAWN>(strongerSide) == 1))
444 int strongerKingDist = square_distance(weakerPawnSq, strongerKingSq);
445 int weakerKingDist = square_distance(weakerPawnSq, weakerKingSq);
447 // Draw if the weak king is on it's back two ranks, within 2
448 // squares of the blocking pawn and the strong king is not
449 // closer. (I think this rule only fails in practically
450 // unreachable positions such as 5k1K/6p1/6P1/8/8/3B4/8/8 w
451 // and positions where qsearch will immediately correct the
452 // problem such as 8/4k1p1/6P1/1K6/3B4/8/8/8 w)
453 if ( relative_rank(strongerSide, weakerKingSq) >= RANK_7
454 && weakerKingDist <= 2
455 && weakerKingDist <= strongerKingDist)
456 return SCALE_FACTOR_DRAW;
460 return SCALE_FACTOR_NONE;
464 /// K and queen vs K, rook and one or more pawns. It tests for fortress draws with
465 /// a rook on the third rank defended by a pawn.
467 ScaleFactor Endgame<KQKRPs>::operator()(const Position& pos) const {
469 assert(verify_material(pos, strongerSide, QueenValueMg, 0));
470 assert(pos.count<ROOK>(weakerSide) == 1);
471 assert(pos.count<PAWN>(weakerSide) >= 1);
473 Square kingSq = pos.king_square(weakerSide);
474 Square rsq = pos.list<ROOK>(weakerSide)[0];
476 if ( relative_rank(weakerSide, kingSq) <= RANK_2
477 && relative_rank(weakerSide, pos.king_square(strongerSide)) >= RANK_4
478 && (pos.pieces(weakerSide, ROOK) & rank_bb(relative_rank(weakerSide, RANK_3)))
479 && (pos.pieces(weakerSide, PAWN) & rank_bb(relative_rank(weakerSide, RANK_2)))
480 && (pos.attacks_from<KING>(kingSq) & pos.pieces(weakerSide, PAWN))
481 && (pos.attacks_from<PAWN>(rsq, strongerSide) & pos.pieces(weakerSide, PAWN)))
482 return SCALE_FACTOR_DRAW;
484 return SCALE_FACTOR_NONE;
488 /// K, rook and one pawn vs K and a rook. This function knows a handful of the
489 /// most important classes of drawn positions, but is far from perfect. It would
490 /// probably be a good idea to add more knowledge in the future.
492 /// It would also be nice to rewrite the actual code for this function,
493 /// which is mostly copied from Glaurung 1.x, and not very pretty.
495 ScaleFactor Endgame<KRPKR>::operator()(const Position& pos) const {
497 assert(verify_material(pos, strongerSide, RookValueMg, 1));
498 assert(verify_material(pos, weakerSide, RookValueMg, 0));
500 Square wksq = pos.king_square(strongerSide);
501 Square bksq = pos.king_square(weakerSide);
502 Square wrsq = pos.list<ROOK>(strongerSide)[0];
503 Square wpsq = pos.list<PAWN>(strongerSide)[0];
504 Square brsq = pos.list<ROOK>(weakerSide)[0];
506 // Orient the board in such a way that the stronger side is white, and the
507 // pawn is on the left half of the board.
508 if (strongerSide == BLACK)
517 if (file_of(wpsq) > FILE_D)
526 File f = file_of(wpsq);
527 Rank r = rank_of(wpsq);
528 Square queeningSq = f | RANK_8;
529 int tempo = (pos.side_to_move() == strongerSide);
531 // If the pawn is not too far advanced and the defending king defends the
532 // queening square, use the third-rank defence.
534 && square_distance(bksq, queeningSq) <= 1
536 && (rank_of(brsq) == RANK_6 || (r <= RANK_3 && rank_of(wrsq) != RANK_6)))
537 return SCALE_FACTOR_DRAW;
539 // The defending side saves a draw by checking from behind in case the pawn
540 // has advanced to the 6th rank with the king behind.
542 && square_distance(bksq, queeningSq) <= 1
543 && rank_of(wksq) + tempo <= RANK_6
544 && (rank_of(brsq) == RANK_1 || (!tempo && abs(file_of(brsq) - f) >= 3)))
545 return SCALE_FACTOR_DRAW;
548 && bksq == queeningSq
549 && rank_of(brsq) == RANK_1
550 && (!tempo || square_distance(wksq, wpsq) >= 2))
551 return SCALE_FACTOR_DRAW;
553 // White pawn on a7 and rook on a8 is a draw if black's king is on g7 or h7
554 // and the black rook is behind the pawn.
557 && (bksq == SQ_H7 || bksq == SQ_G7)
558 && file_of(brsq) == FILE_A
559 && (rank_of(brsq) <= RANK_3 || file_of(wksq) >= FILE_D || rank_of(wksq) <= RANK_5))
560 return SCALE_FACTOR_DRAW;
562 // If the defending king blocks the pawn and the attacking king is too far
563 // away, it's a draw.
565 && bksq == wpsq + DELTA_N
566 && square_distance(wksq, wpsq) - tempo >= 2
567 && square_distance(wksq, brsq) - tempo >= 2)
568 return SCALE_FACTOR_DRAW;
570 // Pawn on the 7th rank supported by the rook from behind usually wins if the
571 // attacking king is closer to the queening square than the defending king,
572 // and the defending king cannot gain tempi by threatening the attacking rook.
575 && file_of(wrsq) == f
576 && wrsq != queeningSq
577 && (square_distance(wksq, queeningSq) < square_distance(bksq, queeningSq) - 2 + tempo)
578 && (square_distance(wksq, queeningSq) < square_distance(bksq, wrsq) + tempo))
579 return ScaleFactor(SCALE_FACTOR_MAX - 2 * square_distance(wksq, queeningSq));
581 // Similar to the above, but with the pawn further back
583 && file_of(wrsq) == f
585 && (square_distance(wksq, queeningSq) < square_distance(bksq, queeningSq) - 2 + tempo)
586 && (square_distance(wksq, wpsq + DELTA_N) < square_distance(bksq, wpsq + DELTA_N) - 2 + tempo)
587 && ( square_distance(bksq, wrsq) + tempo >= 3
588 || ( square_distance(wksq, queeningSq) < square_distance(bksq, wrsq) + tempo
589 && (square_distance(wksq, wpsq + DELTA_N) < square_distance(bksq, wrsq) + tempo))))
590 return ScaleFactor( SCALE_FACTOR_MAX
591 - 8 * square_distance(wpsq, queeningSq)
592 - 2 * square_distance(wksq, queeningSq));
594 // If the pawn is not far advanced, and the defending king is somewhere in
595 // the pawn's path, it's probably a draw.
596 if (r <= RANK_4 && bksq > wpsq)
598 if (file_of(bksq) == file_of(wpsq))
599 return ScaleFactor(10);
600 if ( abs(file_of(bksq) - file_of(wpsq)) == 1
601 && square_distance(wksq, bksq) > 2)
602 return ScaleFactor(24 - 2 * square_distance(wksq, bksq));
604 return SCALE_FACTOR_NONE;
608 ScaleFactor Endgame<KRPKB>::operator()(const Position& pos) const {
610 assert(verify_material(pos, strongerSide, RookValueMg, 1));
611 assert(verify_material(pos, weakerSide, BishopValueMg, 0));
613 // Test for a rook pawn
614 if (pos.pieces(PAWN) & (FileABB | FileHBB))
616 Square ksq = pos.king_square(weakerSide);
617 Square bsq = pos.list<BISHOP>(weakerSide)[0];
618 Square psq = pos.list<PAWN>(strongerSide)[0];
619 Rank rk = relative_rank(strongerSide, psq);
620 Square push = pawn_push(strongerSide);
622 // If the pawn is on the 5th rank and the pawn (currently) is on
623 // the same color square as the bishop then there is a chance of
624 // a fortress. Depending on the king position give a moderate
625 // reduction or a stronger one if the defending king is near the
626 // corner but not trapped there.
627 if (rk == RANK_5 && !opposite_colors(bsq, psq))
629 int d = square_distance(psq + 3 * push, ksq);
631 if (d <= 2 && !(d == 0 && ksq == pos.king_square(strongerSide) + 2 * push))
632 return ScaleFactor(24);
634 return ScaleFactor(48);
637 // When the pawn has moved to the 6th rank we can be fairly sure
638 // it's drawn if the bishop attacks the square in front of the
639 // pawn from a reasonable distance and the defending king is near
642 && square_distance(psq + 2 * push, ksq) <= 1
643 && (PseudoAttacks[BISHOP][bsq] & (psq + push))
644 && file_distance(bsq, psq) >= 2)
645 return ScaleFactor(8);
648 return SCALE_FACTOR_NONE;
651 /// K, rook and two pawns vs K, rook and one pawn. There is only a single
652 /// pattern: If the stronger side has no passed pawns and the defending king
653 /// is actively placed, the position is drawish.
655 ScaleFactor Endgame<KRPPKRP>::operator()(const Position& pos) const {
657 assert(verify_material(pos, strongerSide, RookValueMg, 2));
658 assert(verify_material(pos, weakerSide, RookValueMg, 1));
660 Square wpsq1 = pos.list<PAWN>(strongerSide)[0];
661 Square wpsq2 = pos.list<PAWN>(strongerSide)[1];
662 Square bksq = pos.king_square(weakerSide);
664 // Does the stronger side have a passed pawn?
665 if (pos.pawn_passed(strongerSide, wpsq1) || pos.pawn_passed(strongerSide, wpsq2))
666 return SCALE_FACTOR_NONE;
668 Rank r = std::max(relative_rank(strongerSide, wpsq1), relative_rank(strongerSide, wpsq2));
670 if ( file_distance(bksq, wpsq1) <= 1
671 && file_distance(bksq, wpsq2) <= 1
672 && relative_rank(strongerSide, bksq) > r)
675 case RANK_2: return ScaleFactor(10);
676 case RANK_3: return ScaleFactor(10);
677 case RANK_4: return ScaleFactor(15);
678 case RANK_5: return ScaleFactor(20);
679 case RANK_6: return ScaleFactor(40);
680 default: assert(false);
683 return SCALE_FACTOR_NONE;
687 /// K and two or more pawns vs K. There is just a single rule here: If all pawns
688 /// are on the same rook file and are blocked by the defending king, it's a draw.
690 ScaleFactor Endgame<KPsK>::operator()(const Position& pos) const {
692 assert(pos.non_pawn_material(strongerSide) == VALUE_ZERO);
693 assert(pos.count<PAWN>(strongerSide) >= 2);
694 assert(verify_material(pos, weakerSide, VALUE_ZERO, 0));
696 Square ksq = pos.king_square(weakerSide);
697 Bitboard pawns = pos.pieces(strongerSide, PAWN);
699 // Are all pawns on the 'a' file?
700 if (!(pawns & ~FileABB))
702 // Does the defending king block the pawns?
703 if ( square_distance(ksq, relative_square(strongerSide, SQ_A8)) <= 1
704 || ( file_of(ksq) == FILE_A
705 && !(in_front_bb(strongerSide, rank_of(ksq)) & pawns)))
706 return SCALE_FACTOR_DRAW;
708 // Are all pawns on the 'h' file?
709 else if (!(pawns & ~FileHBB))
711 // Does the defending king block the pawns?
712 if ( square_distance(ksq, relative_square(strongerSide, SQ_H8)) <= 1
713 || ( file_of(ksq) == FILE_H
714 && !(in_front_bb(strongerSide, rank_of(ksq)) & pawns)))
715 return SCALE_FACTOR_DRAW;
717 return SCALE_FACTOR_NONE;
721 /// K, bishop and a pawn vs K and a bishop. There are two rules: If the defending
722 /// king is somewhere along the path of the pawn, and the square of the king is
723 /// not of the same color as the stronger side's bishop, it's a draw. If the two
724 /// bishops have opposite color, it's almost always a draw.
726 ScaleFactor Endgame<KBPKB>::operator()(const Position& pos) const {
728 assert(verify_material(pos, strongerSide, BishopValueMg, 1));
729 assert(verify_material(pos, weakerSide, BishopValueMg, 0));
731 Square pawnSq = pos.list<PAWN>(strongerSide)[0];
732 Square strongerBishopSq = pos.list<BISHOP>(strongerSide)[0];
733 Square weakerBishopSq = pos.list<BISHOP>(weakerSide)[0];
734 Square weakerKingSq = pos.king_square(weakerSide);
736 // Case 1: Defending king blocks the pawn, and cannot be driven away
737 if ( file_of(weakerKingSq) == file_of(pawnSq)
738 && relative_rank(strongerSide, pawnSq) < relative_rank(strongerSide, weakerKingSq)
739 && ( opposite_colors(weakerKingSq, strongerBishopSq)
740 || relative_rank(strongerSide, weakerKingSq) <= RANK_6))
741 return SCALE_FACTOR_DRAW;
743 // Case 2: Opposite colored bishops
744 if (opposite_colors(strongerBishopSq, weakerBishopSq))
746 // We assume that the position is drawn in the following three situations:
748 // a. The pawn is on rank 5 or further back.
749 // b. The defending king is somewhere in the pawn's path.
750 // c. The defending bishop attacks some square along the pawn's path,
751 // and is at least three squares away from the pawn.
753 // These rules are probably not perfect, but in practice they work
756 if (relative_rank(strongerSide, pawnSq) <= RANK_5)
757 return SCALE_FACTOR_DRAW;
760 Bitboard path = forward_bb(strongerSide, pawnSq);
762 if (path & pos.pieces(weakerSide, KING))
763 return SCALE_FACTOR_DRAW;
765 if ( (pos.attacks_from<BISHOP>(weakerBishopSq) & path)
766 && square_distance(weakerBishopSq, pawnSq) >= 3)
767 return SCALE_FACTOR_DRAW;
770 return SCALE_FACTOR_NONE;
774 /// K, bishop and two pawns vs K and bishop. It detects a few basic draws with
775 /// opposite-colored bishops.
777 ScaleFactor Endgame<KBPPKB>::operator()(const Position& pos) const {
779 assert(verify_material(pos, strongerSide, BishopValueMg, 2));
780 assert(verify_material(pos, weakerSide, BishopValueMg, 0));
782 Square wbsq = pos.list<BISHOP>(strongerSide)[0];
783 Square bbsq = pos.list<BISHOP>(weakerSide)[0];
785 if (!opposite_colors(wbsq, bbsq))
786 return SCALE_FACTOR_NONE;
788 Square ksq = pos.king_square(weakerSide);
789 Square psq1 = pos.list<PAWN>(strongerSide)[0];
790 Square psq2 = pos.list<PAWN>(strongerSide)[1];
791 Rank r1 = rank_of(psq1);
792 Rank r2 = rank_of(psq2);
793 Square blockSq1, blockSq2;
795 if (relative_rank(strongerSide, psq1) > relative_rank(strongerSide, psq2))
797 blockSq1 = psq1 + pawn_push(strongerSide);
798 blockSq2 = file_of(psq2) | rank_of(psq1);
802 blockSq1 = psq2 + pawn_push(strongerSide);
803 blockSq2 = file_of(psq1) | rank_of(psq2);
806 switch (file_distance(psq1, psq2))
809 // Both pawns are on the same file. Easy draw if defender firmly controls
810 // some square in the frontmost pawn's path.
811 if ( file_of(ksq) == file_of(blockSq1)
812 && relative_rank(strongerSide, ksq) >= relative_rank(strongerSide, blockSq1)
813 && opposite_colors(ksq, wbsq))
814 return SCALE_FACTOR_DRAW;
816 return SCALE_FACTOR_NONE;
819 // Pawns on adjacent files. Draw if defender firmly controls the square
820 // in front of the frontmost pawn's path, and the square diagonally behind
821 // this square on the file of the other pawn.
823 && opposite_colors(ksq, wbsq)
824 && ( bbsq == blockSq2
825 || (pos.attacks_from<BISHOP>(blockSq2) & pos.pieces(weakerSide, BISHOP))
826 || abs(r1 - r2) >= 2))
827 return SCALE_FACTOR_DRAW;
829 else if ( ksq == blockSq2
830 && opposite_colors(ksq, wbsq)
831 && ( bbsq == blockSq1
832 || (pos.attacks_from<BISHOP>(blockSq1) & pos.pieces(weakerSide, BISHOP))))
833 return SCALE_FACTOR_DRAW;
835 return SCALE_FACTOR_NONE;
838 // The pawns are not on the same file or adjacent files. No scaling.
839 return SCALE_FACTOR_NONE;
844 /// K, bisop and a pawn vs K and knight. There is a single rule: If the defending
845 /// king is somewhere along the path of the pawn, and the square of the king is
846 /// not of the same color as the stronger side's bishop, it's a draw.
848 ScaleFactor Endgame<KBPKN>::operator()(const Position& pos) const {
850 assert(verify_material(pos, strongerSide, BishopValueMg, 1));
851 assert(verify_material(pos, weakerSide, KnightValueMg, 0));
853 Square pawnSq = pos.list<PAWN>(strongerSide)[0];
854 Square strongerBishopSq = pos.list<BISHOP>(strongerSide)[0];
855 Square weakerKingSq = pos.king_square(weakerSide);
857 if ( file_of(weakerKingSq) == file_of(pawnSq)
858 && relative_rank(strongerSide, pawnSq) < relative_rank(strongerSide, weakerKingSq)
859 && ( opposite_colors(weakerKingSq, strongerBishopSq)
860 || relative_rank(strongerSide, weakerKingSq) <= RANK_6))
861 return SCALE_FACTOR_DRAW;
863 return SCALE_FACTOR_NONE;
867 /// K, knight and a pawn vs K. There is a single rule: If the pawn is a rook pawn
868 /// on the 7th rank and the defending king prevents the pawn from advancing, the
869 /// position is drawn.
871 ScaleFactor Endgame<KNPK>::operator()(const Position& pos) const {
873 assert(verify_material(pos, strongerSide, KnightValueMg, 1));
874 assert(verify_material(pos, weakerSide, VALUE_ZERO, 0));
876 Square pawnSq = pos.list<PAWN>(strongerSide)[0];
877 Square weakerKingSq = pos.king_square(weakerSide);
879 if ( pawnSq == relative_square(strongerSide, SQ_A7)
880 && square_distance(weakerKingSq, relative_square(strongerSide, SQ_A8)) <= 1)
881 return SCALE_FACTOR_DRAW;
883 if ( pawnSq == relative_square(strongerSide, SQ_H7)
884 && square_distance(weakerKingSq, relative_square(strongerSide, SQ_H8)) <= 1)
885 return SCALE_FACTOR_DRAW;
887 return SCALE_FACTOR_NONE;
891 /// K, knight and a pawn vs K and bishop. If knight can block bishop from taking
892 /// pawn, it's a win. Otherwise, drawn.
894 ScaleFactor Endgame<KNPKB>::operator()(const Position& pos) const {
896 Square pawnSq = pos.list<PAWN>(strongerSide)[0];
897 Square bishopSq = pos.list<BISHOP>(weakerSide)[0];
898 Square weakerKingSq = pos.king_square(weakerSide);
900 // King needs to get close to promoting pawn to prevent knight from blocking.
901 // Rules for this are very tricky, so just approximate.
902 if (forward_bb(strongerSide, pawnSq) & pos.attacks_from<BISHOP>(bishopSq))
903 return ScaleFactor(square_distance(weakerKingSq, pawnSq));
905 return SCALE_FACTOR_NONE;
909 /// K and a pawn vs K and a pawn. This is done by removing the weakest side's
910 /// pawn and probing the KP vs K bitbase: If the weakest side has a draw without
911 /// the pawn, she probably has at least a draw with the pawn as well. The exception
912 /// is when the stronger side's pawn is far advanced and not on a rook file; in
913 /// this case it is often possible to win (e.g. 8/4k3/3p4/3P4/6K1/8/8/8 w - - 0 1).
915 ScaleFactor Endgame<KPKP>::operator()(const Position& pos) const {
917 assert(verify_material(pos, strongerSide, VALUE_ZERO, 1));
918 assert(verify_material(pos, weakerSide, VALUE_ZERO, 1));
920 Square wksq = pos.king_square(strongerSide);
921 Square bksq = pos.king_square(weakerSide);
922 Square psq = pos.list<PAWN>(strongerSide)[0];
923 Color us = pos.side_to_move();
925 if (strongerSide == BLACK)
933 if (file_of(psq) >= FILE_E)
940 // If the pawn has advanced to the fifth rank or further, and is not a
941 // rook pawn, it's too dangerous to assume that it's at least a draw.
942 if (rank_of(psq) >= RANK_5 && file_of(psq) != FILE_A)
943 return SCALE_FACTOR_NONE;
945 // Probe the KPK bitbase with the weakest side's pawn removed. If it's a draw,
946 // it's probably at least a draw even with the pawn.
947 return Bitbases::probe_kpk(wksq, psq, bksq, us) ? SCALE_FACTOR_NONE : SCALE_FACTOR_DRAW;