Key psq[PIECE_NB][SQUARE_NB];
Key enpassant[FILE_NB];
Key castling[CASTLING_RIGHT_NB];
- Key side;
+ Key side, noPawns;
}
namespace {
/// operator<<(Position) returns an ASCII representation of the position
-std::ostream& operator<<(std::ostream& os, Position& pos) {
+std::ostream& operator<<(std::ostream& os, const Position& pos) {
os << "\n +---+---+---+---+---+---+---+---+\n";
if ( int(Tablebases::MaxCardinality) >= popcount(pos.pieces())
&& !pos.can_castle(ANY_CASTLING))
{
+ StateInfo st;
+ Position p;
+ p.set(pos.fen(), pos.is_chess960(), &st, pos.this_thread());
Tablebases::ProbeState s1, s2;
- Tablebases::WDLScore wdl = Tablebases::probe_wdl(pos, &s1);
- int dtz = Tablebases::probe_dtz(pos, &s2);
+ Tablebases::WDLScore wdl = Tablebases::probe_wdl(p, &s1);
+ int dtz = Tablebases::probe_dtz(p, &s2);
os << "\nTablebases WDL: " << std::setw(4) << wdl << " (" << s1 << ")"
<< "\nTablebases DTZ: " << std::setw(4) << dtz << " (" << s2 << ")";
}
}
Zobrist::side = rng.rand<Key>();
+ Zobrist::noPawns = rng.rand<Key>();
}
void Position::set_state(StateInfo* si) const {
- si->key = si->pawnKey = si->materialKey = 0;
+ si->key = si->materialKey = 0;
+ si->pawnKey = Zobrist::noPawns;
si->nonPawnMaterial[WHITE] = si->nonPawnMaterial[BLACK] = VALUE_ZERO;
si->psq = SCORE_ZERO;
si->checkersBB = attackers_to(square<KING>(sideToMove)) & pieces(~sideToMove);
if (st->rule50 > 99 && (!checkers() || MoveList<LEGAL>(*this).size()))
return true;
- StateInfo* stp = st;
- for (int i = 2, e = std::min(st->rule50, st->pliesFromNull); i <= e; i += 2)
- {
+ int e = std::min(st->rule50, st->pliesFromNull);
+
+ if (e < 4)
+ return false;
+
+ StateInfo* stp = st->previous->previous;
+
+ do {
stp = stp->previous->previous;
if (stp->key == st->key)
return true; // Draw at first repetition
- }
+
+ } while ((e -= 2) >= 4);
return false;
}