[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

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



On Mon, Nov 29, 2004 at 10:20:27PM +0100, Frank de Groot wrote:
> My ideaa is that you only need the beginner's books stuff.
> If you apply that rigorously and to the max, and in a deep search, you end
> up with a system that applies the very complex pro stuff all by itself.

Nice theory, but I find it pretty hard to believe, for many reasons.
In a way that is a "typical chess programmers" approach to Go, which I
find rather simpleminded and quite unlikely to produce good results. Not
because the searhc space is too large, but because I do not believe it
is possible to produce a whole-board evaluation function that gives
meaningfull results fast enough for a deep search. But that is, of
course, my personal belief, and I am ready to be corrected by hard
results.

Best regards

  Heikki

-- 
Heikki Levanto   "In Murphy We Turst"     heikki (at) lsd (dot) dk

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