From 077e32efc9fdd30d561356b2fd331d6f42f9a256 Mon Sep 17 00:00:00 2001 From: Marco Costalba Date: Tue, 19 Mar 2013 19:08:00 +0100 Subject: [PATCH 1/1] Better document bitbase loop Thanks to Lucas to spot the weak comment and to Jundery to suggest a better one. No functional change. --- src/bitbase.cpp | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/src/bitbase.cpp b/src/bitbase.cpp index 0599c3c8..425d0f14 100644 --- a/src/bitbase.cpp +++ b/src/bitbase.cpp @@ -89,7 +89,8 @@ void Bitbases::init_kpk() { for (idx = 0; idx < IndexMax; 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) for (repeat = idx = 0; idx < IndexMax; idx++) if (db[idx] == UNKNOWN && db[idx].classify(db) != UNKNOWN) -- 2.39.2