On Sat, Dec 20, 2014 at 12:17 AM, Aja Huang <[email protected]> wrote: > We've just submitted our paper to ICLR. We made the draft available at > http://www.cs.toronto.edu/~cmaddis/pubs/deepgo.pdf
Hi Aja, Wow, very impressive. In fact so impressive, it seems a bit suspicious(*)... If this is real then one might wonder what it means about the game. Can it really be that simple? I always thought that even with perfect knowledge there should usually still be a fairly broad set of equal-valued moves. Are we perhaps seeing that most of the time players just reproduce the same patterns over and over again? Do I understand correctly that your representation encodes the location of the last 5 moves? If so, do you have an idea how much extra performance that provides compared to only the last or not using it at all? Thanks for sharing the paper! Best, Erik * I'd really like to see some test results on pro games that are newer than any of your training data. _______________________________________________ Computer-go mailing list [email protected] http://computer-go.org/mailman/listinfo/computer-go
