[computer-go] Former Deep Blue Research working on Go

[Rémi Coulom]

Andrés Domínguez wrote:
> 2007/10/10, Don Dailey <drdailey at cox.net>:
>   
>> Andrés,
>>
>> You are right about null move of course.  The assumption that other
>> moves are >= to the value of a pass is much stronger in GO than in
>> Chess, yet ironically it's not as effective in Go.
>>     
>
> That was what i was trying to say. Pass is one of the worst moves
> (except final) is good for null-move on Go. Of course you have
> reduced depth, probably bad with alpha-beta with a bad evaluation
> function, but looks interesting with UCT reducing the number of
> simulations and increasing the % value. I don't use UCT, so I
> haven't tried it.
>
> Andrés
>   
Hi,

UCT does no alpha-beta pruning, so null-move pruning cannot be used.

Rémi