[Computer-go] How many probes down the tree are necessary for a "good" bot?
Erik van der Werf
erikvanderwerf at gmail.com
Fri Nov 15 04:04:06 PST 2013
On Fri, Nov 15, 2013 at 11:48 AM, Ben Ellis <ben.ellis at softweyr.co.uk> wrote:
> How do you know a move is truly bad?
Strong players know :-)
> There are almost always exceptions.
> Or is it a case you can mostly afford to ignore low ranked moves at the cost
> of the occasional lost game?
In some cases we can prove it, but you don't need to be perfect. Moves
that are likely to be inferior may simply be sampled (a lot) less. If
a move that initially looked bad really is good, eventually it can
still get sampled (if you give the program enough time).
More information about the Computer-go