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:
- Select the best move by number of plays
- Select the best move by win ratio
- If the two aren't the same continue searching for N amount of time if there's still enough time left
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.
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.