Better document bitbase loop

Thanks to Lucas to spot the weak comment and
to Jundery to suggest a better one.

No functional change.

diff --git a/src/bitbase.cpp b/src/bitbase.cpp
index 0599c3c81238d2255583291bc5f3a1ab9a4829ef..425d0f149326f6cd569930cf913fb09e9127cc9e 100644 (file)
--- 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)