Document why we don't use TT to prune in search_pv()

From a Joona' s post on talkchess.

Signed-off-by: Marco Costalba <mcostalba@gmail.com>

diff --git a/src/search.cpp b/src/search.cpp
index 5d803949112423dfe4b3ebe1570437d945b6b1c2..0a53225abba9a81c8018edd10765b11c8dca00b9 100644 (file)
--- a/src/search.cpp
+++ b/src/search.cpp
@@ -1121,7 +1121,14 @@ namespace {
         return alpha;
 
     // Transposition table lookup. At PV nodes, we don't use the TT for
-    // pruning, but only for move ordering.
+    // pruning, but only for move ordering. This is to avoid problems in
+    // the following areas:
+    //
+    // * Repetition draw detection
+    // * Fifty move rule detection
+    // * Searching for a mate
+    // * Printing of full PV line
+    //
     tte = TT.retrieve(pos.get_key());
     ttMove = (tte ? tte->move() : MOVE_NONE);