mirror of
https://github.com/HChaZZY/Stockfish.git
synced 2025-12-17 23:56:23 +08:00
Better document bitbase loop
Thanks to Lucas to spot the weak comment and to Jundery to suggest a better one. No functional change.
This commit is contained in:
@@ -89,7 +89,8 @@ void Bitbases::init_kpk() {
|
|||||||
for (idx = 0; idx < IndexMax; idx++)
|
for (idx = 0; idx < IndexMax; idx++)
|
||||||
db[idx].classify_leaf(idx);
|
db[idx].classify_leaf(idx);
|
||||||
|
|
||||||
// Iterate until all positions are classified (15 cycles needed)
|
// Iterate through the positions until no more of the unknown positions can be
|
||||||
|
// changed to either wins or draws (15 cycles needed).
|
||||||
while (repeat)
|
while (repeat)
|
||||||
for (repeat = idx = 0; idx < IndexMax; idx++)
|
for (repeat = idx = 0; idx < IndexMax; idx++)
|
||||||
if (db[idx] == UNKNOWN && db[idx].classify(db) != UNKNOWN)
|
if (db[idx] == UNKNOWN && db[idx].classify(db) != UNKNOWN)
|
||||||
|
|||||||
Reference in New Issue
Block a user