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

["Frank de Groot" <frank@xxxxxxxxxxxxx>]

----- Original Message ----- 
From: "Tapani Raiko" <tapani.raiko@xxxxxxxxxxxxxxxxx>
To: "computer-go" <computer-go@xxxxxxxxxxxxxxxxx>
Subject: Re: [computer-go] Pattern matching - example play


> If the played games contain all the information, you could equally say
> that the empty goban contains all Go knowledge. For example, very few
> games show ladders. It is the possibilities that the positions open up
> that have most of the knowlegde.

Hm, your argument is even more invalid than I initially thought.
If a ladder does not occur in half a million games (or rarely, whatever),
the knowledge in the game records is:
"Avoid putting yourself in a situation where one of your chains chain can be
put in atari ad infinitum until you loose the chain."

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