Tackling Morpion Solitaire with AlphaZero-likeRanked Reward Reinforcement Learning

E. D. Demaine, M. L. Demaine, A. Langerman, and S. Langerman, “Morpion solitaire,” Theory of Computing Systems , vol. 39, no. 3, pp. 439–453, 2006

2006

Earlier work this paper cites.

Y. Bengio, J. Louradour, R. Collobert, and J. Weston, “Curriculum learning,” in Proceedings of the 26th annual international conference on machine learning . ACM, 2009, pp. 41–48

2009

Earlier work this paper cites.

T. Cazenave, “Nested monte-carlo search,” in Twenty-First International Joint Conference on Artificial Intelligence , 2009

2009

Earlier work this paper cites.

C. Rego, D. Gamboa, F. Glover, and C. Osterman, “Traveling salesman problem heuristics: Leading methods, implementations and latest advances,” European Journal of Operational Research , vol. 211, no. 3, pp. 427–441, 2011

2011

Earlier work this paper cites.

C. D. Rosin, “Nested rollout policy adaptation for monte carlo tree search,” in Twenty-Second International Joint Conference on Artificial Intelligence , 2011

2011

Earlier work this paper cites.

C. B. Browne, E. Powley, D. Whitehouse, S. M. Lucas, P. I. Cowling, P. Rohlfshagen, S. Tavener, D. Perez, S. Samothrakis, and S. Colton, “A survey of monte carlo tree search methods,” IEEE Transactions on Computational Intelligence and AI in games , vol. 4, no. 1, pp. 1–43, 2012

2012

Earlier work this paper cites.

T. Cazenave and F. Teytaud, “Beam nested rollout policy adaptation,” 2012

2012

Earlier work this paper cites.

A. Kawamura, T. Okamoto, Y. Tatsu, Y. Uno, and M. Yamato, “Morpion solitaire 5d: a new upper bound of 121 on the maximum score,” arXiv preprint arXiv:1307.8192 , 2013

Original

2013

Earlier work this paper cites.

J. Schmidhuber, “Deep learning in neural networks: An overview,” Neural networks , vol. 61, pp. 85–117, 2015

2015

Earlier work this paper cites.

V. Mnih, K. Kavukcuoglu, D. Silver, A. A. Rusu, J. Veness, M. G. Bellemare, A. Graves, M. Riedmiller, A. K. Fidjeland, G. Ostrovski et al. , “Human-level control through deep reinforcement learning,” Nature , vol. 518, no. 7540, pp. 529–533, 2015

2015

Earlier work this paper cites.

O. Vinyals, M. Fortunato, and N. Jaitly, “Pointer networks,” in Advances in neural information processing systems , 2015, pp. 2692–2700

2015

Cited alongside, same era.

D. Silver, A. Huang, C. J. Maddison, A. Guez, L. Sifre, G. Van Den Driessche, J. Schrittwieser, I. Antonoglou, V. Panneershelvam, M. Lanctot et al. , “Mastering the game of go with deep neural networks and tree search,” nature , vol. 529, no. 7587, p. 484, 2016

2016

Cited alongside, same era.

I. Bello, H. Pham, Q. V. Le, M. Norouzi, and S. Bengio, “Neural combinatorial optimization with reinforcement learning,” arXiv preprint arXiv:1611.09940 , 2016

Original

2016

Cited alongside, same era.

D. Silver, J. Schrittwieser, K. Simonyan, I. Antonoglou, A. Huang, A. Guez, T. Hubert, L. Baker, M. Lai, A. Bolton et al. , “Mastering the game of go without human knowledge,” Nature , vol. 550, no. 7676, p. 354, 2017

2017

Cited alongside, same era.

T. M. Moerland, J. Broekens, A. Plaat, and C. M. Jonker, “A0c: Alpha zero in continuous action space,” arXiv preprint arXiv:1805.09613 , 2018

Original

2018

Later among the works it cites.

Y. Tian, J. Ma, Q. Gong, S. Sengupta, Z. Chen, J. Pinkerton, and C. L. Zitnick, “Elf opengo: An analysis and open reimplementation of alphazero,” arXiv preprint arXiv:1902.04522 , 2019

Original

2019

Later among the works it cites.

H. Wang, M. Emmerich, M. Preuss, and A. Plaat, “Alternative loss functions in alphazero-like self-play,” in 2019 IEEE Symposium Series on Computational Intelligence (SSCI) . IEEE, 2019, pp. 155–162

2019

Later among the works it cites.

——, “Hyper-parameter sweep on alphazero general,” arXiv preprint arXiv:1903.08129 , 2019

Original

2019

Later among the works it cites.