[7] David Silver, Thomas Hubert, Julian Schrittwieser, Ioannis Antonoglou, Matthew Lai, Arthur Guez, Marc Lanctot, Laurent Sifre, Dharshan Kumaran, Thore Graepel, et al. A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play. Science, 362(6419):1140-1144, 2018.
[8] Julian Schrittwieser, Ioannis Antonoglou, Thomas Hubert, Karen Simonyan, Laurent Sifre, Simon Schmitt, Arthur Guez, Edward Lockhart, Demis Hassabis, Thore Graepel, Timothy Lillicrap, and David Silver. Mastering Atari, Go, chess and shogi by planning with a learned model. Nature, 588(7839):604-609, 2020.
[9] Adam Gleave, Michael Dennis, Cody Wild, Neel Kant, Sergey Levine, and Stuart Russell. Adversarial Policies: Attacking Deep Reinforcement Learning. In 8th International Conference on Learning Representations, ICLR 2020, 2020.
[10] Li-Cheng Lan, Huan Zhang, Ti-Rong Wu, Meng-Yu Tsai, I-Chen Wu, and Cho-Jui Hsieh. Are AlphaZero-like Agents Robust to Adversarial Perturbations? In 36th Advances in Neural Information Processing Systems, NIPS 2022, 2022.
[11] Jonathan Schaeffer, Neil Burch, Yngvi Björnsson, Akihiro Kishimoto, Martin Müller, Robert Lake, Paul Lu, and Steve Sutphen. Checkers Is Solved. Science, 317(5844):1518-1522, 2007.
[12] Chao Gao, Martin Müller, and Ryan Hayward. Focused Depth-first Proof Number Search using Convolutional Neural Networks for the Game of Hex. In 26th International Joint Conference on Artificial Intelligence, IJCAI 2017, volume 17, pages 3668-3674, 2017.
[13] Chung-Chin Shih, Ti-Rong Wu, Ting Han Wei, and I-Chen Wu. A Novel Approach to Solving Goal-Achieving Problems for Board Games. In 36th AAAI Conference on Artificial Intelligence, AAAI 2022, volume 36, pages 10362-10369, 2022.
[14] Ti-Rong Wu, Chung-Chin Shih, Ting Han Wei, Meng-Yu Tsai, Wei-Yuan Hsu, and I-Chen Wu. AlphaZero-based Proof Cost Network to Aid Game Solving. In 10th International Conference on Learning Representations, ICLR 2022, 2022.
[15] Stephen McAleer, Forest Agostinelli, Alexander Shmakov, and Pierre Baldi. Solving the Rubik's Cube with Approximate Policy Iteration. In 7th International Conference on Learning Representations, ICLR 2019, 2019.
[16] Forest Agostinelli, Stephen McAleer, Alexander Shmakov, and Pierre Baldi. Solving the Rubik's cube with deep reinforcement learning and search. Nature Machine Intelligence, 1(8):356-363, 2019.
[17] Guillaume Lample, Marie-Anne Lachaux, Thibaut Lavril, Xavier Martinet, Amaury Hayat, Gabriel Ebner, Aurélien Rodriguez, and Timothée Lacroix. HyperTree Proof Search for Neural Theorem Proving. In 36th Advances in Neural Information Processing Systems, NIPS 2022, 2022.
[18] David Wu. Deep-Learning the Hardest Go Problem in the World. https://blog.janestreet.com/deep-learning-the-hardest-go-problem-in-the-world/, 2019. Accessed: 2023-01-19.
[19] Wim Pijls and Arie de Bruin. Game tree algorithms and solution trees. Theoretical computer science, 252(1-2):197-215, 2001.
[20] George C. Stockman. A minimax algorithm better than alpha-beta? Artificial Intelligence, 12 (2):179-196, 1979.
[21] Louis Victor Allis, Maarten van der Meulen, and H Jaap van den Herik. Proof-number search. Artificial Intelligence, 66(1):91-124, 1994.
[22] Mark H M Winands, Yngvi Björnsson, and Jahn-Takeshi Saito. Monte-carlo tree search solver. In International Conference on Computers and Games, pages 25-36. Springer, 2008.
[23] Tristan Cazenave and Abdallah Saffidine. Score Bounded Monte-Carlo Tree Search. In 7th International Conference on Computers and Games, CG 2010, pages 93-104. Springer Berlin Heidelberg, 2011.