> > This seems to be the case and I still do not really on some level >> understand why. Since with the chinese go rules the board should be >> effectively stateless (exempting ko information) all the information be >> contained in the the current position. Why additional information is needed >> i.e. an annotation of the last played move is required on some level is a >> mystery to me. >> > > One can build nice examples of that for some artificial games: the > knowledge of the last move helps *for finite computational cost*. > Sylvain has shown interesting elements around that, but as far as I know > this was not in his ph.D. thesis and this is not published.
If I understand correctly what it is about, I do have something in my thesis about that. p153:" 4.4.3 Mathematical insights: strength VS accuracy", and more precisely "Theorem 4.4.1 (Accurate simulation player without memory is strong)" It is certainly not of direct practical application though. Sylvain
_______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
