Here's an old message from Olivier Teytaud: -- In a B node, update only B moves - and only if there's no W move at same location before B's move.
I think this version is ok: I update only B moves RAVE, like this. > > RAVEcount(a) += 1, RAVEwins(a) += 1 > RAVEcount(c) += 1, RAVEwins(c) += 1 > RAVEcount(e) += 1, RAVEwins(e) += 1 > > But on Sylvain's paper Figure4, > It looks like updating all moves Black and White, like this. > at least if I understand well your notations. Best regards, Olivier -- Does this mean that the diagram is in the paper is incorrect? We think the third value should be 1/3, not 3/5. BTW, I found this message in the archive: http://www.mail-archive.com/[email protected]/msg03973.html Disturbingly, I can't find it in my old email. -- Peter Drake https://sites.google.com/a/lclark.edu/drake/ _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
