{"type":"ScholarlyArticle","title":"Completeness and Diversity in Depth-First Proof-Number Search with Applications to Retrosynthesis","authors":[{"name":"Christopher Franz","slug":"christopher-franz","given":"Christopher","family":"Franz","affiliation":"Frankfurt , Germany"},{"name":"Georg Mogk","slug":"georg-mogk","given":"Georg","family":"Mogk","affiliation":"Bayer AG , Leverkusen , Germany"},{"name":"Thomas Mrziglod","slug":"thomas-mrziglod","given":"Thomas","family":"Mrziglod","affiliation":"Bayer AG , Leverkusen , Germany"},{"name":"Kevin Schewior","slug":"kevin-schewior","given":"Kevin","family":"Schewior","affiliation":"University of Southern Denmark , Odense , Denmark"}],"abstract":"We revisit Depth-First Proof-Number Search (DFPN), a well-known algorithm for solving two-player games. First, we consider the completeness property of the algorithm and its variants, i.e., whether they always find a winning strategy when there exists one. While it is known that the standard version is not complete, we show that the combination with the simple Threshold Controlling Algorithm is complete, solving an open problem from the area. Second, we modify DFPN to compute a diverse set of solutions rather than just a single one. Finally, we apply this new variant in Chemistry to the synthesis planning of new target molecules (Retrosynthesis). In this domain a diverse set of many solutions is desirable. We apply additional modifications from the literature to the algorithm and show that it outperforms Monte-Carlo Tree-Search, another well-known algorithm for the same problem, according to a natural diversity measure.","doi":"10.24963/ijcai.2022/658","url":"https://ijcai.org/proceedings/2022/658","pdf":"https://ijcai.org/proceedings/2022/0658.pdf","markdown":"https://ijcai.org/proceedings/2022/658.md","bibtex":"https://ijcai.org/proceedings/2022/bibtex/658","volume":{"slug":"2022","title":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2022","url":"https://ijcai.org/proceedings/2022/","year":2022,"location":"Vienna","dates":"23-29 July 2022","editors":"Luc De Raedt","isbn":"978-1-956792-00-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2022"},"section":"Search","track":"Main Track","number":658,"pages":{"first":4747,"last":4753},"keywords":["Multidisciplinary Topics and Applications: Life Science","Agent-based and Multi-agent Systems: Algorithmic Game Theory","Planning and Scheduling: Planning Algorithms","Search: Search and Machine Learning"],"videos":[{"label":"Video #1","url":"https://slideslive.com/38987086","length_sec":87,"provider":"slideslive"},{"label":"Video #2","url":"https://slideslive.com/38985229","length_sec":729,"provider":"slideslive"}],"references":[{"position":1,"raw":"[Allis et al., 1994] L. Victor Allis, Maarten van der Meulen, and H. Jaap van den Herik. Proof-number search. Artificial Intelligence, 66(1):91-124, 1994.","title":"Proof-number search","authors":"L Victor Allis, Maarten Van Der Meulen, H Jaap Van Den Herik","year":"1994","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Badowski et al., 2019] Tomasz Badowski, Karol Molga, and Bartosz A. Grzybowski. Selection of cost-effective yet chemically diverse pathways from the networks of computer-generated retrosynthetic plans. Chem. Sci., 10:4640-4651, 2019.","title":"Selection of cost-effective yet chemically diverse pathways from the networks of computer-generated retrosynthetic plans","authors":"Tomasz Badowski, Karol Molga, Bartosz A Grzybowski","year":"2019","venue":"Chem. Sci","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Baste et al., 2020] Julien Baste, Michael R. Fellows, et al. Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory. In International Joint Conference on Artificial Intelligence (IJCAI), pages 1119- 1125, 2020.","title":"Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory","authors":"Julien Baste, R Michael, Fellows","year":"2020","venue":"International Joint Conference on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":"/proceedings/2020/156"},{"position":4,"raw":"[Browne et al., 2012] Cameron Browne, Edward Jack Pow- ley, et al. A survey of monte carlo tree search methods. IEEE Trans. Comput. Intell. AI Games, 4(1):1-43, 2012.","title":"A survey of monte carlo tree search methods","authors":"Cameron Browne, Edward Jack Powley","year":"2012","venue":"IEEE Trans. Comput. Intell. AI Games","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Campbell, 1985] Murray Campbell. The graph-history in- teraction: on ignoring position history. In ACM Annual Conference, pages 278-280, 1985.","title":"The graph-history interaction: on ignoring position history","authors":"Murray Campbell, Campbell","year":"1985","venue":"ACM Annual Conference","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Chen et al., 2020] Binghong Chen, Chengtao Li, et al. Retro*: Learning retrosynthetic planning with neural guided A* search. In International Conference on Ma- chine Learning (ICML), pages 1608-1616, 2020.","title":"Retro*: Learning retrosynthetic planning with neural guided A* search","authors":"Chen","year":"2020","venue":"International Conference on Machine Learning (ICML)","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Corey, 1967] E. J. Corey. General methods for the construc- tion of complex molecules. Pure and Applied Chemistry, 14(1):19-38, 1967.","title":"General methods for the construction of complex molecules","authors":"E J Corey","year":"1967","venue":"Pure and Applied Chemistry","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Ertl and Schuffenhauer, 2009] Peter Ertl and Ansgar Schuf- fenhauer. Estimation of synthetic accessibility score of drug-like molecules based on molecular complexity and fragment contributions. Journal of Cheminformatics, 1:1758-2946, 6 2009.","title":"Peter Ertl and Ansgar Schuffenhauer. Estimation of synthetic accessibility score of drug-like molecules based on molecular complexity and fragment contributions","authors":"Schuffenhauer Ertl","year":"2009","venue":"Journal of Cheminformatics","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Fagerberg et al., 2018] Rolf Fagerberg, Christoph Flamm, et al. Finding the K best synthesis plans. Journal of Chem- informatics, 10(1):19, 2018.","title":"Finding the K best synthesis plans","authors":"Rolf Fagerberg, Christoph Flamm","year":"2018","venue":"Journal of Cheminformatics","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Gao, 2021] Chao Gao. On computation complexity of true proof number search. arXiv/cs.CC, abs/2102.04907, 2021.","title":"On computation complexity of true proof number search","authors":"Chao Gao","year":"2021","venue":null,"doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Heifets and Jurisica, 2012] Abraham Heifets and Igor Ju- risica. Construction of new medicines via game proof search. In AAAI Conference on Artificial Intelligence (AAAI), page 1564-1570, 2012.","title":"Abraham Heifets and Igor Jurisica. Construction of new medicines via game proof search","authors":"Jurisica Heifets","year":"2012","venue":"AAAI Conference on Artificial Intelligence (AAAI)","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Kishimoto and Müller, 2004a] Akihiro Kishimoto and Mar- tin Müller. Df-pn in go: An application to the one-eye problem. In Advances in Computer Games (ACG), pages 125-141, 2004.","title":"Df-pn in go: An application to the one-eye problem","authors":"Müller Kishimoto, Akihiro Kishimoto, Martin Müller","year":"2004","venue":"Advances in Computer Games (ACG)","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Kishimoto and Müller, 2004b] Akihiro Kishimoto and Mar- tin Müller. A general solution to the graph history inter- action problem. In AAAI Conference on Artificial Intelli- gence (AAAI), page 644-649, 2004.","title":"Akihiro Kishimoto and Martin Müller. A general solution to the graph history interaction problem","authors":"Müller Kishimoto","year":"2004","venue":"AAAI Conference on Artificial Intelligence (AAAI)","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Kishimoto and Müller, 2008] Akihiro Kishimoto and Mar- tin Müller. About the completeness of depth-first proof- number search. In Computers and Games, pages 146-156, 2008.","title":"Akihiro Kishimoto and Martin Müller. About the completeness of depth-first proofnumber search","authors":"Müller Kishimoto","year":"2008","venue":"Computers and Games","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Kishimoto et al., 2012] Akihiro Kishimoto, Mark H. M. Winands, et al. Game-tree search using proof numbers: The first twenty years. J. Int. Comput. Games Assoc., 35(3):131-156, 2012.","title":"Game-tree search using proof numbers: The first twenty years","authors":"Akihiro Kishimoto, H M Mark, Winands","year":"2012","venue":"J. Int. Comput. Games Assoc","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Kishimoto et al., 2019] Akihiro Kishimoto, Beat Buesser, et al. Depth-first proof-number search with heuristic edge cost and application to chemical synthesis planning. In Advances in Neural Information Processing Systems (NeurIPS), pages 7224-7234, 2019.","title":"Depth-first proof-number search with heuristic edge cost and application to chemical synthesis planning","authors":"Akihiro Kishimoto, Beat Buesser","year":"2019","venue":"Advances in Neural Information Processing Systems (NeurIPS)","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Kishimoto, 2005] Akihiro Kishimoto. Correct and efficient search algorithms in the presence of repetitions. PhD the- sis, Department of Computing Science, University of Al- berta, 2005.","title":"Correct and efficient search algorithms in the presence of repetitions","authors":"Akihiro Kishimoto","year":"2005","venue":null,"doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Kishimoto, 2010] Akihiro Kishimoto. Dealing with infinite loops, underestimation, and overestimation of depth-first proof-number search. In AAAI Conference on Artificial Intelligence (AAAI), pages 108-113, 2010.","title":"Dealing with infinite loops, underestimation, and overestimation of depth-first proof-number search","authors":"Akihiro Kishimoto","year":"2010","venue":"AAAI Conference on Artificial Intelligence (AAAI)","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Knuth and Moore, 1975] Donald E. Knuth and Ronald W. Moore. An analysis of alpha-beta pruning. Artif. Intell., 6(4):293-326, 1975.","title":"An analysis of alpha-beta pruning","authors":"Donald E Knuth, Ronald W Moore","year":"1975","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[MLPDS, 2020] MLPDS. Askcos: Software tools for or- ganic synthesis. https://askcos.mit.edu/, 2020. Accessed: 23-11-2021.","title":"MLPDS. Askcos: Software tools for organic synthesis","authors":"Mlpds","year":"2020","venue":null,"doi":null,"url":"https://askcos.mit.edu/,2020","internal_url":null},{"position":21,"raw":"[Nagai, 2002] A. Nagai. Df-pn algorithm for searching AND/OR trees and its applications. PhD thesis, Depart- ment of Information Science, University of Tokyo, 2002.","title":"Df-pn algorithm for searching AND/OR trees and its applications","authors":"A Nagai","year":"2002","venue":null,"doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Palay, 1983] Andrew J. Palay. Searching with probabilities. PhD thesis, Department of Computer Science, Carnegie Mellon University, 1983.","title":"Searching with probabilities","authors":"Andrew J Palay","year":"1983","venue":null,"doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Pearl, 1984] Judea Pearl. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison- Wesley Longman Publishing Co., Inc., 1984.","title":"Judea Pearl. Heuristics: Intelligent Search Strategies for Computer Problem Solving","authors":"Pearl","year":"1984","venue":null,"doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Schaeffer et al., 2005] Jonathan Schaeffer, Yngvi Björnsson, et al. Solving checkers. In International Joint Conference on Artificial Intelligence (IJCAI), pages 292-297, 2005.","title":"Solving checkers","authors":"Jonathan Schaeffer, Yngvi Björnsson","year":"2005","venue":"International Joint Conference on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Schwaller et al., 2020] Philippe Schwaller, Riccardo Pe- traglia, Valerio Zullo, et al. Predicting retrosynthetic path- ways using transformer-based models and a hyper-graph exploration strategy. Chem. Sci., 11:3316-3325, 2020.","title":"Predicting retrosynthetic pathways using transformer-based models and a hyper-graph exploration strategy","authors":"Philippe Schwaller, Riccardo Petraglia, Valerio Zullo","year":"2020","venue":"Chem. Sci","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Segler et al., 2018] Marwin H. S. Segler, Mike Preuss, and Mark P. Waller. Planning chemical syntheses with deep neural networks and symbolic AI. Nature, 555(7698):604- 610, 2018.","title":"Planning chemical syntheses with deep neural networks and symbolic AI","authors":"H S Marwin, Mike Segler, Mark P Preuss, Waller","year":"2018","venue":"Nature","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Shibukawa et al., 2020] Ryosuke Shibukawa, Shoichi Ishida, Kazuki Yoshizoe, et al. CompRet: A comprehen- sive recommendation framework for chemical synthesis planning with algorithmic enumeration. Journal of Cheminformatics, 12:52, 2020.","title":"CompRet: A comprehensive recommendation framework for chemical synthesis planning with algorithmic enumeration","authors":"Ryosuke Shibukawa, Shoichi Ishida, Kazuki Yoshizoe","year":"2020","venue":"Journal of Cheminformatics","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Szymkuć et al., 2016] Sara Szymkuć, Ewa P. Gajewska, et al. Computer-assisted synthetic planning: The end of the beginning. Angewandte Chemie International Edition, 55(20):5904-5937, 2016.","title":"Computer-assisted synthetic planning: The end of the beginning","authors":"Sara Szymkuć, Ewa P Gajewska","year":"2016","venue":"Angewandte Chemie International Edition","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}