Re: computer-go: A problem with understanding lookahead

[<Michael.Collins@xxxxxxx>]

Hi All,

Am I correct in this?

Assuming pattern matching it is the only evaluation done.
Assume you have a database of every position (huge and impossible).
Will using a 1 ply search always return the same result as a full depth
search?

I suppose the argument is really redundant on the pricipal that if the
perfect
search always proposes move A at a set point the that move would be the one
in
the database anyway.

Regards,
Mike...