Join GitHub today
GitHub is home to over 50 million developers working together to host and review code, manage projects, and build software together.Sign up
Continue searching when the result is unclear #209
When the time for a move is up and the best move is selected it may be beneficial to continue searching a bit longer when the result isn't clear cut.
A possible strategy is as follows:
See the computer go mailing list archive for inspiration or other solutions. Some bots seem to do this a lot and with M being the amount of time allocated initially for the move the go as far as 3*M for N.