[36] Rémi Coulom. Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search. In H. Jaap van den Herik, Paolo Ciancarini, and H. H. L. M. (Jeroen) Donkers, editors, Computers and Games, Lecture Notes in Computer Science, pages 72-83, Berlin, Heidelberg, 2007. Springer. ISBN 978-3-540-75538-8. doi: 10.1007/978-3-540-75538-8_7.
[37] B. Bouzy and B. Helmstetter. Monte-Carlo Go Developments. In H. Jaap Van Den Herik, Hiroyuki Iida, and Ernst A. Heinz, editors, Advances in Computer Games: Many Games, Many Challenges, IFIP — The International Federation for Information Processing, pages 159–174. Springer US, Boston, MA, 2004. ISBN 978-0-387-35706-5. doi: 10.1007/978-0-387-35706-5_11. URL https://doi.org/10.1007/978-0-387-35706-5_11.
[38] Michael Chung, Michael Buro, and Jonathan Schaeffer. Monte Carlo Planning in RTS Games. January 2005.
[39] Dimitri Bertsekas. Rollout, Policy Iteration, and Distributed Reinforcement Learning. Athena Scientific, Belmont, Massachusetts, first edition edition, August 2020. ISBN 978-1-886529-07-6.
[40] Dimitri P. Bertsekas. Lessons from AlphaZero for Optimal, Model Predictive, and Adaptive Control. Athena Scientific, March 2022. ISBN 978-1-886529-17-5.
[41] D. Kleinman. On an iterative technique for Riccati equation computations. IEEE Transactions on Automatic Control, 13(1):114-115, February 1968. ISSN 1558-2523. doi: 10.1109/TAC.1968.1098829. URL https://ieeexplore.ieee.org/abstract/document/1098829?casa_token= tKFm80m5gI4AAAAA:E3oaouksJy-5g-HuySnACwNdxyHpRDk8IbPTssB0B-PK0qZng_ -v9Fsk7qzcyYyYVudFUrI8. Conference Name: IEEE Transactions on Automatic Control.
[42] Martin L. Puterman and Shelby L. Brumelle. On the Convergence of Policy Iteration in Stationary Dynamic Programming. Mathematics of Operations Research, 4(1):60-69, 1979. ISSN 0364-765X. URL https://www.jstor.org/stable/3689239. Publisher: INFORMS.
[43] M. G. Bellemare, Y. Naddaf, J. Veness, and M. Bowling. The Arcade Learning Environment: An Evaluation Platform for General Agents. Journal of Artificial Intelligence Research, 47: 253-279, June 2013. ISSN 1076-9757. doi: 10.1613/jair.3912. URL https://www.jair.org/index.php/jair/article/view/10819.
[44] Karl Cobbe, Christopher Hesse, Jacob Hilton, and John Schulman. Leveraging Procedural Generation to Benchmark Reinforcement Learning, July 2020. URL http://arxiv.org/abs/1912.01588. arXiv:1912.01588 [cs, stat].
[45] Andrew Y. Ng, Daishi Harada, and Stuart Russell. Policy invariance under reward transformations: Theory and application to reward shaping. In *In Proceedings of the Sixteenth International Conference on Machine Learning*, pages 278-287. Morgan Kaufmann, 1999.
[46] Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Alex Graves, Ioannis Antonoglou, Daan Wierstra, and Martin Riedmiller. Playing Atari with Deep Reinforcement Learning, December 2013. URL http://arxiv.org/abs/1312.5602. arXiv:1312.5602 [cs].
[47] David Brandfonbrener, William F. Whitney, Rajesh Ranganath, and Joan Bruna. Offline RL Without Off-Policy Evaluation, December 2021. URL http://arxiv.org/abs/2106.08909.arXiv:2106.08909 [cs, stat].
[48] Ronald J. Williams. Simple Statistical Gradient-Following Algorithms for Connectionist Reinforcement Learning. In Richard S. Sutton, editor, Reinforcement Learning, The Springer International Series in Engineering and Computer Science, pages 5-32. Springer US, Boston, MA, 1992. ISBN 978-1-4615-3618-5. doi: 10.1007/978-1-4615-3618-5_2. URL https://doi.org/10.1007/978-1-4615-3618-5_2.
[49] Damien Ernst, Pierre Geurts, and Louis Wehenkel. Tree-Based Batch Mode Reinforcement Learning. Journal of Machine Learning Research, 6(18):503-556, 2005. ISSN 1533-7928. URL http://jmlr.org/papers/v6/ernst05a.html.