X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fsearch.cpp;h=77c5b2d3b8829a42ff31e75d743f9fe282d3d919;hp=902ba0fc6915769c157ef096f6b83340049794db;hb=80d7556af785f57a4f90d121c57c9c2f85a2963e;hpb=00d9e9fd283b31e63389af091b158dbc3fedfc0e diff --git a/src/search.cpp b/src/search.cpp index 902ba0fc..77c5b2d3 100644 --- a/src/search.cpp +++ b/src/search.cpp @@ -539,12 +539,7 @@ void Thread::search(bool isMainThread) { namespace { - // search<>() is the main search function for both PV and non-PV nodes and for - // normal and SplitPoint nodes. When called just after a split point the search - // is simpler because we have already probed the hash table, done a null move - // search, and searched the first move before splitting, so we don't have to - // repeat all this work again. We also don't need to store anything to the hash - // table here: This is taken care of after we return from the split point. + // search<>() is the main search function for both PV and non-PV nodes template Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode) {