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

[Vincent Diepeveen <diep@xxxxxxxxx>]

At 22:20 3-12-2004 -0500, Jeffrey Rainy wrote:
>Hi,
>
>> > We can have lengthy discussions, but the majority of ANN top researchers
>> > agree with me here that for game playing ANN is completely useless.
>
>Ok, I'll bite on this one.
>
>Any computable function can be computed by a given (possibly large) ANN. Any

Yes i was waiting for someone to bite.

Practical limitations avoid that. If you use an ANN that *theoretical* can
do the same like patterns that are in a pro program, then the time to train
your ANN in a correct way is like 10^200 possibilities. Somewhere in that
region.

So practical limitations is why such ANN's do not exist.

>Go program computes a computable (possibly complex) function. Therefore, any
>go program could also be programmed using an (possibly large and complex)
>ANN.
>
>I'll agree that the training could be hard to do. However, it could be done.
>
>So, ANN are not completly useless. Maybe not the optimal choice, given some
>setting, but possibly useful.
>
>J.
>
>
>
>
>_______________________________________________
>computer-go mailing list
>computer-go@xxxxxxxxxxxxxxxxx
>http://www.computer-go.org/mailman/listinfo/computer-go/
>
>
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/