{"type":"ScholarlyArticle","title":"Generalisation of Alpha-Beta Search for AND-OR Graphs With Partially Ordered Values","authors":[{"name":"Junkang Li","slug":"junkang-li","given":"Junkang","family":"Li","affiliation":"NukkAI , Paris , France; Normandie Univ. ; UNICAEN , ENSICAEN , CNRS , GREYC , 14 000 Caen , France"},{"name":"Bruno Zanuttini","slug":"bruno-zanuttini","given":"Bruno","family":"Zanuttini","affiliation":"Normandie Univ. ; UNICAEN , ENSICAEN , CNRS , GREYC , 14 000 Caen , France"},{"name":"Tristan Cazenave","slug":"tristan-cazenave","given":"Tristan","family":"Cazenave","affiliation":"NukkAI , Paris , France; LAMSADE , Université Paris-Dauphine , PSL , CNRS , France"},{"name":"Véronique Ventos","slug":"veronique-ventos","given":"Véronique","family":"Ventos","affiliation":"NukkAI , Paris , France"}],"abstract":"We define a new setting related to the evaluation of AND-OR directed acyclic graphs with partially ordered values. Such graphs arise naturally when solving games with incomplete information (e.g. most card games such as Bridge) or games with multiple criteria. In particular, this setting generalises standard AND-OR graph evaluation and computation of optimal strategies in games with complete information.\r\n\r\nUnder this setting, we propose a new algorithm which uses both alpha-beta pruning and cached values. In this paper, we present our algorithm, prove its correctness, and give experimental results on a card game with incomplete information.","doi":"10.24963/ijcai.2022/661","url":"https://ijcai.org/proceedings/2022/661","pdf":"https://ijcai.org/proceedings/2022/0661.pdf","markdown":"https://ijcai.org/proceedings/2022/661.md","bibtex":"https://ijcai.org/proceedings/2022/bibtex/661","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":661,"pages":{"first":4769,"last":4775},"keywords":["Search: Game Playing","Multidisciplinary Topics and Applications: Computer Games"],"videos":[{"label":"Video #1","url":"https://slideslive.com/38986917","length_sec":89,"provider":"slideslive"},{"label":"Video #2","url":"https://slideslive.com/38985060","length_sec":333,"provider":"slideslive"}],"references":[{"position":1,"raw":"[Bienvenu et al., 2010] Meghyn Bienvenu, Hélène Fargier, and Pierre Marquis. Knowledge Compilation in the Modal Logic S5. In Proc. 24th AAAI Conference on Artificial In- telligence (AAAI 2010), pages 261-266, 2010.","title":"Knowledge Compilation in the Modal Logic S5","authors":"Bienvenu","year":"2010","venue":"Proc. 24th AAAI Conference on Artificial Intelligence (AAAI 2010)","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Cazenave and Ventos, 2020] Tristan Cazenave and Véronique Ventos. The αµ search algorithm for the game of bridge. In Proc. Monte Carlo Search Interna- tional Workshop, pages 1-16. Springer, 2020.","title":"The αµ search algorithm for the game of bridge","authors":"Ventos Cazenave, Tristan Cazenave, Véronique Ventos","year":"2020","venue":"Proc. Monte Carlo Search International Workshop","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Dasgupta et al., 1996] Pallab Dasgupta, P. P. Chakrabarti, and S. C. De Sarkar. Searching game trees under a par- tial order. Artif. Intell., 82(1-2):237-257, 1996.","title":"Searching game trees under a partial order","authors":"P P Pallab Dasgupta, S C Chakrabarti, De Sarkar","year":"1996","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Davey and Priestley, 2002] Brian A. Davey and Hilary A. Priestley. Introduction to Lattices and Order. Cambridge University Press, 2nd edition, 2002.","title":"Introduction to Lattices and Order","authors":"Brian A Davey, Hilary A Priestley","year":"2002","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Edelkamp, 2020] Stefan Edelkamp. Representing and re- ducing uncertainty for enumerating the belief space to im- prove endgame play in skat. In Proc. 24th European Con- ference on Artificial Intelligence (ECAI 2020), pages 395- 402. IOS Press, 2020.","title":"Representing and reducing uncertainty for enumerating the belief space to improve endgame play in skat","authors":"Stefan Edelkamp, Edelkamp","year":"2020","venue":"Proc. 24th European Conference on Artificial Intelligence (ECAI 2020)","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Frank and Basin, 1998] Ian Frank and David A. Basin. Search in games with incomplete information: A case study using bridge card play. Artif. Intell., 100(1-2):87- 123, 1998.","title":"Search in games with incomplete information: A case study using bridge card play","authors":"Ian Frank, David A Basin","year":"1998","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Frank and Basin, 2001] Ian Frank and David A. Basin. A theoretical and empirical investigation of search in im- perfect information games. Theor. Comput. Sci., 252(1- 2):217-256, 2001.","title":"A theoretical and empirical investigation of search in imperfect information games","authors":"Ian Frank, David A Basin","year":"2001","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Ginsberg and Jaffray, 2002] M Ginsberg and Alan Jaffray. Alpha-beta pruning under partial orders. In Richard Nowakowski, editor, More Games of No Chance, num- ber 42 in Mathematical Sciences Research Institute Publi- cations, pages 37-48. Cambridge University Press, 2002.","title":"Alpha-beta pruning under partial orders","authors":"M Ginsberg, Alan Jaffray","year":"2002","venue":"More Games of No Chance","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Ginsberg, 2001] Matthew L. Ginsberg. GIB: imperfect in- formation in a computationally challenging game. J. Artif. Intell. Res., 14:303-358, 2001.","title":"GIB: imperfect information in a computationally challenging game","authors":"L Matthew, Ginsberg","year":"2001","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Haworth and Hernandez, 2021] Guy Haworth and Nelson Hernandez. The 20th top chess engine championship, TCEC20. ICGA Journal, 43(1):62-73, 2021.","title":"The 20th top chess engine championship, TCEC20","authors":"Hernandez Haworth, Guy Haworth, Nelson Hernandez","year":"2021","venue":"ICGA Journal","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Kissmann and Edelkamp, 2009] Peter Kissmann and Stefan Edelkamp. Solving fully-observable non-deterministic planning problems via translation into a general game. In Bärbel Mertsching, Marcus Hund, and Muhammad Za- heer Aziz, editors, Proc. 32nd Annual German Conference on Artificial Intelligence (KI 2009), pages 1-8. Springer, 2009.","title":"Peter Kissmann and Stefan Edelkamp. Solving fully-observable non-deterministic planning problems via translation into a general game","authors":"Edelkamp Kissmann","year":"2009","venue":"Proc. 32nd Annual German Conference on Artificial Intelligence (KI 2009)","doi":null,"url":null,"internal_url":null},{"position":12,"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":13,"raw":"[Kupferschmid and Helmert, 2006] Sebastian Kupferschmid and Malte Helmert. A skat player based on monte-carlo simulation. In Proc. 5th International Conference on Com- puters and Games (CG 2006), pages 135-147. Springer, 2006.","title":"A skat player based on monte-carlo simulation","authors":"Helmert Kupferschmid, Sebastian Kupferschmid, Malte Helmert","year":"2006","venue":"Proc. 5th International Conference on Computers and Games (CG 2006)","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Levy, 1989] David NL Levy. The million pound bridge pro- gram. Heuristic Programming in Artificial Intelligence: The First Computer Olympiad, pages 95-103, 1989.","title":"The million pound bridge program","authors":"Levy ; David Nl Levy","year":"1989","venue":"Heuristic Programming in Artificial Intelligence: The First Computer Olympiad","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Loddo and Saiu, 2010] Jean-Vincent Loddo and Luca Saiu. How to correctly prune tropical trees. In Serge Autex- ier, Jacques Calmet, David Delahaye, Patrick D. F. Ion, Laurence Rideau, Renaud Rioboo, and Alan P. Sexton, ed- itors, Proc. 10th International Conference on Intelligent Computer Mathematics, volume 6167 of Lecture Notes in Computer Science, pages 101-115. Springer, 2010.","title":"How to correctly prune tropical trees","authors":"Saiu ; Jean-Vincent Loddo, Luca Loddo, Saiu","year":"2010","venue":"Proc. 10th International Conference on Intelligent Computer Mathematics","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Marsland, 1986] T. A. Marsland. A review of game-tree pruning. J. Int. Comput. Games Assoc., 9(1):3-19, 1986.","title":"A review of game-tree pruning","authors":"T A Marsland","year":"1986","venue":"J. Int. Comput. Games Assoc","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Nasu, 2018] Yu Nasu. Efficiently updatable neural- network-based evaluation functions for computer shogi. The 28th World Computer Shogi Championship Appeal Document, 2018.","title":"Efficiently updatable neuralnetwork-based evaluation functions for computer shogi","authors":"Yu Nasu","year":"2018","venue":"The 28th World Computer Shogi Championship Appeal Document","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Niveau and Zanuttini, 2016] Alexandre Niveau and Bruno Zanuttini. Efficient Representations for the Modal Logic S5. In Proc. 25th International Joint Conference on Arti- ficial Intelligence (IJCAI 2016), 2016.","title":"Alexandre Niveau and Bruno Zanuttini. Efficient Representations for the Modal Logic S5","authors":"Zanuttini Niveau","year":"2016","venue":"Proc. 25th International Joint Conference on Artificial Intelligence (IJCAI 2016)","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Rebstock et al., 2019] Douglas Rebstock, Christopher Soli- nas, Michael Buro, and Nathan R Sturtevant. Policy based inference in trick-taking card games. In Proc. 2019 IEEE Conference on Games (CoG 2019), pages 1-8. IEEE, 2019.","title":"Policy based inference in trick-taking card games","authors":"Douglas Rebstock, Christopher Solinas, Michael Buro, Nathan R Sturtevant","year":"2019","venue":"Proc. 2019 IEEE Conference on Games (CoG 2019)","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Schaeffer et al., 2007] Jonathan Schaeffer, Neil Burch, Yn- gvi Björnsson, Akihiro Kishimoto, Martin Müller, Robert Lake, Paul Lu, and Steve Sutphen. Checkers is solved. Science, 317(5844):1518-1522, 2007.","title":"Checkers is solved","authors":"Jonathan Schaeffer, Neil Burch, Yngvi Björnsson, Akihiro Kishimoto, Martin Müller, Robert Lake, Paul Lu, Steve Sutphen","year":"2007","venue":"Science","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Sturtevant and White, 2006] Nathan R Sturtevant and Adam M White. Feature construction for reinforcement learning in hearts. In Proc. 5th International Conference on Computers and Games (CG 2006), pages 122-134. Springer, 2006.","title":"Feature construction for reinforcement learning in hearts","authors":"R Nathan, Adam M Sturtevant, White","year":"2006","venue":"Proc. 5th International Conference on Computers and Games (CG 2006)","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Van Den Herik et al., 2002] H Jaap Van Den Herik, Jos WHM Uiterwijk, and Jack Van Rijswijck. Games solved: Now and in the future. Artif. Intell., 134(1-2):277- 311, 2002.","title":"Games solved: Now and in the future","authors":"Herik Van Den","year":"2002","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}