computer-go: Correct moves?

[Darren Cook <darren@xxxxxxxxxxxxxx>]

>The difference between go and chess (I know this has been done many times 
>over), is that in chess, there usually is a "correct" move to make, and so 
>ply searching is acceptable.  But in go, there is no "correct" move most of 
>the time, and the computer would have an impossible time trying to "guess" 
>the next move.

I've not heard that difference between go and chess before. Can you explain
more by what you mean? How is there any more a correct move to play in
chess than in go? They are both complete information games and therefore
both theoretically solvable, given enough resources. The only difference is
that 19x19 go requires more resources (and even that is algorithm dependent).

Darren