X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fbitbase.cpp;h=0eb3b983c7835821b2644aec108f499ef451596e;hp=ebf3c59a02355d780e31d79b48d8e70c36ee7d6c;hb=ed72a1e9ba37a9fa2674da8f46bb0597a1721c2d;hpb=40548c9153ea89c0b27b198efb443c5bb9b9c490 diff --git a/src/bitbase.cpp b/src/bitbase.cpp index ebf3c59a..0eb3b983 100644 --- a/src/bitbase.cpp +++ b/src/bitbase.cpp @@ -53,7 +53,7 @@ namespace { WIN = 4 }; - inline Result& operator|=(Result& r, Result v) { return r = Result(r | v); } + Result& operator|=(Result& r, Result v) { return r = Result(r | v); } struct KPKPosition { KPKPosition() = default; @@ -64,7 +64,6 @@ namespace { template Result classify(const std::vector& db); - unsigned id; Color us; Square ksq[COLOR_NB], psq; Result result; @@ -85,19 +84,22 @@ bool Bitbases::probe(Square wksq, Square wpsq, Square bksq, Color us) { void Bitbases::init() { std::vector db(MAX_INDEX); + unsigned idx, repeat = 1; // Initialize db with known win / draw positions - std::generate(db.begin(), db.end(), [](){ static unsigned id; return KPKPosition(id++); }); + for (idx = 0; idx < MAX_INDEX; ++idx) + db[idx] = KPKPosition(idx); // Iterate through the positions until none of the unknown positions can be // changed to either wins or draws (15 cycles needed). - while (std::accumulate(db.begin(), db.end(), false, [&](bool repeat, KPKPosition& pos) - { return (pos == UNKNOWN && pos.classify(db) != UNKNOWN) || repeat; })){} + while (repeat) + for (repeat = idx = 0; idx < MAX_INDEX; ++idx) + repeat |= (db[idx] == UNKNOWN && db[idx].classify(db) != UNKNOWN); // Map 32 results into one KPKBitbase[] entry - for (auto& pos : db) - if (pos == WIN) - KPKBitbase[pos.id / 32] |= 1 << (pos.id & 0x1F); + for (idx = 0; idx < MAX_INDEX; ++idx) + if (db[idx] == WIN) + KPKBitbase[idx / 32] |= 1 << (idx & 0x1F); } @@ -105,7 +107,6 @@ namespace { KPKPosition::KPKPosition(unsigned idx) { - id = idx; ksq[WHITE] = Square((idx >> 0) & 0x3F); ksq[BLACK] = Square((idx >> 6) & 0x3F); us = Color ((idx >> 12) & 0x01);