Author:
Ji James,Thielscher Michael
Publisher
Springer Nature Switzerland
Reference10 articles.
1. Coulom, R.: Efficient selectivity and backup operators in Monte-Carlo tree search. In: 5th International Conference on Computer and Games, pp. 72–83 (2006)
2. Koscis, L., Szpesvári, C.: Bandit based Monte-Carlo planning. In: 17th European Conference on Machine Learning (ECML), pp. 282–293 (2006)
3. Silver, D., Huang, A., Maddison, C., et al.: Mastering the game of Go with deep neural networks and tree search. Nature 529, 484–489 (2016)
4. The Guardian, https://www.theguardian.com/technology/2016/mar/15/googles-alphago-seals-4-1-victory-over-grandmaster-lee-sedol. Accessed 9 Nov 2023
5. Ramanujan, R., Sabharwal, A., Selman, B.: On adversarial search spaces and sampling-based planning. In: 20th International Conference on Automated Planning and Scheduling (ICAPS), pp. 242–245 (2010)