----- Oorspronkelijk bericht ----- Van: Matt Gokey <[EMAIL PROTECTED]> Datum: maandag, januari 22, 2007 6:27 pm Onderwerp: Re: [computer-go] an idea... computer go program's rank vs time
> Been following this thread pretty closely and thought I would jump > in > with a thought and try to find some common ground. I think there > is > truth to be found in both sides of this argument. > > Of course people improve with time and so do computers with > certain > algorithms. The question is about the curve and whether there is > a > significant difference in this curve between chess and go. > > Don believes there is probably no difference and states a rule: > doubling > thinking time = linear improvement in play. > > What if we look at it mathematically by looking at the branching > factor? > Go’s branching factor is generally considered to be about an order > of > magnitude greater than chess – perhaps a bit less, right? That > means > that after each ply go becomes another additional order of > magnitude > more complex. Mathematically a bigger branching factor does not matter. If the level increase is proportional to the 2log of time, then it is also proportional to the 10log of time. The only difference is the proportionality factor. Dave _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
