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
_______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
