Doesn't the total number of playout simply relates to the search ply depth?
DL -----Original Message----- From: Gian-Carlo Pascutto <[EMAIL PROTECTED]> To: computer-go <computer-go@computer-go.org> Sent: Fri, 11 Apr 2008 10:01 am Subject: [computer-go] Scalability study request Hi all,? ? the result of the scalability study at? ? http://cgos.boardspace.net/study/13/index.html? ? seems to look a lot like 2 parallel lines over the entire range, which I find very surprising, since I'd have expected at least some differences caused by different playout strategies.? ? I am now wondering if scalability could be unaffected by playouts (just adding a constant offset) and only depend on the UCT/search implementation. From the publications of the MoGo team it seems likely that the programs are very similar there.? ? I am able to provide a Leela version that is identical to the one currently used in the study, but with light (uniform random) playouts (and being about 3 times as fast).? ? I think it would be very interesting to see the behaviour of this. IMHO it would provide deeper understanding in how the combination of MC/UCT works. The critical question is if we would get another parallel line, indicating that the search is the key to further progress, or if we would get a line with a different steepness, indicating playouts are the key. Or maybe the two are more strongly linked and both contribute. Either way I believe more data would be usefull.? ? -- GCP? _______________________________________________? computer-go mailing list? [EMAIL PROTECTED] http://www.computer-go.org/mailman/listinfo/computer-go/?
_______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
