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
-go] RAVE uses all moves in playout?
On Thu, Aug 11, 2011 at 3:43 AM, Hiroshi Yamashita y...@bd.mbn.or.jp wrote:
Hi,
I have a question about RAVE.
For example, there are 5 moves a,b,c,d,e. Black to play.
In playout, Black plays a, White plays b, Black plays c,
W plays d and B plays e.
Then game
8:42 PM
Subject: Re: [Computer-go] RAVE uses all moves in playout?
On Thu, Aug 11, 2011 at 3:43 AM, Hiroshi Yamashita y...@bd.mbn.or.jp wrote:
Hi,
I have a question about RAVE.
For example, there are 5 moves a,b,c,d,e. Black to play.
In playout, Black plays a, White plays b, Black plays
On Thu, Aug 11, 2011 at 3:43 AM, Hiroshi Yamashita y...@bd.mbn.or.jp wrote:
Hi,
I have a question about RAVE.
For example, there are 5 moves a,b,c,d,e. Black to play.
In playout, Black plays a, White plays b, Black plays c,
W plays d and B plays e.
Then game is over, result is B win.
B:a
Hi,
I have a question about RAVE.
For example, there are 5 moves a,b,c,d,e. Black to play.
In playout, Black plays a, White plays b, Black plays c,
W plays d and B plays e.
Then game is over, result is B win.
B:a W:b B:c W:d B:e ... B win, result = +1
I update only B moves RAVE, like this.
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
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:
Thanks a lot!
The word of AMAF(All Moves As First) made me confused a bit.
Regards,
Hiroshi Yamashita
___
Computer-go
