increment m_tbhits in UCTSearch.cpp

[jjoshua2]

root increments m_tbhits too now. fix #517

[Tilps]

Looks fine. SF just does the equivalent of tbhits = search_tbhits + m_root->get_children().size(), in the reporting code path - but we're already looping, so this seems like a good option.

[jjoshua2]

It's hard to know whether a loop of increments or one lookup is faster, but either way it shouldn't be limiting our performance.

…

On Thu, May 3, 2018 at 5:52 PM, Tilps ***@***.***> wrote: ***@***.**** approved this pull request. Looks fine. SF just does the equivalent of tbhits = search_tbhits + m_root->get_children().size(), in the reporting code path - but we're already looping, so this seems like a good option. — You are receiving this because you authored the thread. Reply to this email directly, view it on GitHub <#518 (review)>, or mute the thread <https://github.com/notifications/unsubscribe-auth/AO6INFVimR64iKSOZZOwKP7lAxt8He0Dks5tu3w3gaJpZM4TxgFK> .