RE: [computer-go] Pattern matching - example play

["Mark Boon" <tesujisoftware@xxxxxxxxx>]

> -----Original Message-----
> From: computer-go-bounces@xxxxxxxxxxxxxxxxx
> [mailto:computer-go-bounces@xxxxxxxxxxxxxxxxx]On Behalf Of Vincent
> Diepeveen
> Sent: Wednesday, December 01, 2004 16:32
> To: computer-go; computer-go
> Subject: Re: [computer-go] Pattern matching - example play
>
> However there are some huge differences between 9x9 and 19x19.
> First of all
> if some top chess programmers build a 9x9 go program in combination with a
> deep search, parallel hardware, i really doubt any human will be able to
> beat it.
>
> There simply has not been put any big commercial effort yet into 9x9 go.

You're overlooking one important aspect: evaluating a 9x9 Go position is
way, way more difficult than evaluating a chess-position.

What you write seems based on the assumption that you can evaluate as many
moves per second as in chess. Would it still be true if the maximum number
of nodes per second on current hardware is in the neighbourhood of 1,000?
Because that's what I estimate for an evaluation of a 9x9 Go position that
is still not nearly as good as chess-evaluations.

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