Re: [computer-go] Minimax with random evaluations

[Don Dailey <drd@xxxxxxx>]

>   What would be very interesting is to see the effect of search depth on a 
>   more intelligent, but still simple, algorithm, such as the one David Fotland 
>   (I think) suggested a few months back of always defending the weakest chain 
>   (again I think that was it). But I guess that is a couple of orders of 
>   magnitude slower.

I am also interested in very simple algorithms as a way of (hopefully)
learning some things that might surprise.  I was thinking in lines of
evaluation features on top of alpha/beta searching such as we are
experimenting with now.

I'm fairly curious about some very simple things, which works best.
Not that any would lead directly to a strong program but might tell us
something useful.

- Don



_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/