[computer-go] Paper for AAAI

Petr Baudis pasky at ucw.cz
Mon Apr 7 08:59:56 PDT 2008


On Mon, Apr 07, 2008 at 08:36:25AM -0400, Jason House wrote:
> On Apr 7, 2008, at 8:22 AM, Petr Baudis <pasky at ucw.cz> wrote:
>
>>  Hello,
>>
>> On Sun, Apr 06, 2008 at 08:55:26PM -0600, David Silver wrote:
>>> Here is a draft of the paper, any feedback would be very welcome :-)
>>>
>>> http://www.cs.ualberta.ca/~silver/research/publications/files/MoGoNectar.pdf
>>
>>  you are saying that in minimax, opponent moves are selected by
>> minimizing the lower confidence bound - this seems novel, is that so? I
>> always got the impression that for the opponent moves, you reverse the
>> mean value but still use UCB.
>
> I think both methods are equivalent. The UCB for one player is 1-LCB for 
> the other player...

Hmm, you are right, but this can get rather hairy considering things
like FPU; perhaps the formulation is simply unnecessarily confusing.

-- 
				Petr "Pasky" Baudis
Whatever you can do, or dream you can, begin it.
Boldness has genius, power, and magic in it.	-- J. W. von Goethe


More information about the computer-go mailing list