[24] Timo V Ewalds. Playing and Solving Havannah. Master's thesis, University of Alberta, 2012.
[25] Ting Han Wei, Chao-Chin Liang, I Wu, Lung-Pin Chen, et al. Software development architecture for job-level algorithms. ICGA Journal, 38(3):131-148, 2015.
[26] Michael Bowling, Neil Burch, Michael Johanson, and Oskari Tammelin. Heads-up limit hold'em poker is solved. Science, 347(6218):145-149, 2015.
[27] Abdallah Saffidine, Nicolas Jouandeau, and Tristan Cazenave. Solving BRREAKTHROUGH with Race Patterns and Job-Level Proof Number Search. In 13th International Conference on Advances in Computer Games, ACG 2011, pages 196-207. Springer, 2011.
[28] Philip Henderson, Broderick Arneson, and Ryan B Hayward. Solving 8x8 Hex. In 21st International Joint Conference on Artificial Intelligence, IJCAI 2009, volume 9, pages 505-510, 2009.
[29] I-Chen Wu, Hung-Hsuan Lin, Der-Johng Sun, Kuo-Yuan Kao, Ping-Hung Lin, Yi-Chih Chan, and Po-Ting Chen. Job-Level Proof Number Search. IEEE Transactions on Computational Intelligence and AI in Games, 5(1):44-56, 2012.
[30] Ayumu Nagai. Df-pn Algorithm for Searching AND/OR Trees and Its Applications. PhD thesis, University of Tokyo, Tokyo, Japan, 2002.
[31] Jr-Chang Chen, I-Chen Wu, Wen-Jie Tseng, Bo-Han Lin, and Chia-Hui Chang. Job-level alpha-beta search. IEEE Transactions on Computational Intelligence and AI in Games, 7(1): 28-38, 2014.
[32] Christopher D Rosin. Multi-armed bandits with episode context. Annals of Mathematics and Artificial Intelligence, 61(3):203–230, 2011.
[33] Michael McCloskey and Neal J Cohen. Catastrophic Interference in Connectionist Networks: The Sequential Learning Problem. In Psychology of learning and motivation, volume 24, pages 109-165. Academic Press, 1989.
[34] Guillaume MJ-B Chaslot, Mark HM Winands, and H. Jaap van den Herik. Parallel Monte-Carlo Tree Search. In 6th International Conference on Computers and Games, CG 2008, pages 60-71. Springer, 2008.
[35] Rainer Feldmann, Burkhard Monien, Peter Mysliwietz, and Oliver Vornberger. Distributed game-tree search. ICCA Journal, 12(2):65-73, 1989.
[36] Louis Victor Allis. Searching for Solutions in Games and Artificial Intelligence. PhD thesis, Transnational University Limburg, Maastricht, Netherlands, 1994.
[37] Ti-Rong Wu, Hung Guei, Po-Wei Huang, Pei-Chiun Peng, Ting Han Wei, Chung-Chin Shih, and Yun-Jui Tsai. Minizero: Comparative analysis of Alphazero and Muzero on Go, Othello, and Atari games. arXiv preprint arXiv:2310.11305, 2023.
[38] Ivo Danihelka, Arthur Guez, Julian Schrittwieser, and David Silver. Policy improvement by planning with Gumbel. In 10th International Conference on Learning Representations, ICLR 2022, 2022.
[39] Chung-Chin Shih, Ting Han Wei, Ti-Rong Wu, and I-Chen Wu. A Local-Pattern Related Look-Up Table. IEEE Transactions on Games, 2023.
[40] Akihiro Kishimoto and Martin Müller. A General Solution to the Graph History Interaction Problem. In 19th AAAI Conference on Artificial Intelligence, AAAI 2004, volume 4, pages 644-649, 2004.
[41] Erik C D van der Werf and Mark H M Winands. Solving go for Rectangular Boards. ICGA Journal, 32(2):77-88, 2009.
[42] Marwin HS Segler, Mike Preuss, and Mark P Waller. Planning chemical syntheses with deep neural networks and symbolic AI. Nature, 555(7698):604-610, 2018.