{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T19:16:05Z","timestamp":1761765365638},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2011,3,1]],"date-time":"2011-03-01T00:00:00Z","timestamp":1298937600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput. Intell. AI Games"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1109\/tciaig.2011.2107323","type":"journal-article","created":{"date-parts":[[2011,1,21]],"date-time":"2011-01-21T20:04:57Z","timestamp":1295640297000},"page":"57-66","source":"Crossref","is-referenced-by-count":27,"title":["Best Reply Search for Multiplayer Games"],"prefix":"10.1109","volume":"3","author":[{"given":"Maarten P. D.","family":"Schadd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark H. M.","family":"Winands","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-1968-0_7"},{"key":"ref38","first-page":"646","article-title":"Mixing search strategies for multi-player games","author":"zuckerman","year":"2009","journal-title":"Proc 21st Int Joint Conf Artif Intell"},{"key":"ref33","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/978-3-642-12993-3_4","volume":"6048","author":"winands","year":"2010","journal-title":"Advances in Computer Games (ACG 2009)"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/978-3-540-87608-3_2","volume":"5131","author":"lorentz","year":"2008","journal-title":"Computers and Games (CG 2008)"},{"key":"ref31","first-page":"140","article-title":"Playing amazons endgames","volume":"32","author":"kloetzer","year":"2009","journal-title":"Int Comput Games Assoc J"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273531"},{"key":"ref37","first-page":"9","author":"marsland","year":"2001","journal-title":"Advances in Computer Games (ACG 9)"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87608-3_5"},{"key":"ref35","first-page":"474","article-title":"Monte Carlo tree search techniques in the game of Kriegspiel","author":"ciancarini","year":"2009","journal-title":"Proc 21st Int Joint Conf Artif Intell"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.3166\/ria.23.183-202"},{"key":"ref10","first-page":"713","article-title":"Robust game play against unknown opponents","author":"sturtevant","year":"2006","journal-title":"Proc 2nd Int Joint Conf Auton Agents Multiagent Syst"},{"key":"ref11","first-page":"1057","article-title":"Prob-Max<formula formulatype=\"inline\"> <tex Notation=\"TeX\">$^n$<\/tex><\/formula>: Playing N-player games with opponent models","author":"sturtevant","year":"2006","journal-title":"Proc Nat Conf Artif Intell"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87608-3_4"},{"key":"ref13","first-page":"195","article-title":"An analysis of UCT in multi-player games","volume":"31","author":"sturtevant","year":"2008","journal-title":"Int Comput Games Assoc J"},{"key":"ref14","author":"sackson","year":"1969","journal-title":"A Gamut of Games"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17928-0_22"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-35660-0_10"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1465611.1465715"},{"key":"ref18","author":"breuker","year":"1998","journal-title":"Memory Versus Search in Games"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/34.42858"},{"key":"ref28","first-page":"282","volume":"4212","author":"kocsis","year":"2006","journal-title":"Proceedings of the EMCL 2006"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/978-3-540-40031-8_8","volume":"2883","author":"sturtevant","year":"2003","journal-title":"Computers and Games (CG 2002)"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/978-3-540-75538-8_7","volume":"4630","author":"coulom","year":"2007","journal-title":"Computers and Games (CG 2006)"},{"key":"ref3","first-page":"201","article-title":"On pruning techniques for multi-player games","author":"sturtevant","year":"2000","journal-title":"Proc Nat Conf Artif Intell"},{"key":"ref6","author":"sturtevant","year":"2003","journal-title":"Multi-player games Algorithms and approaches"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1142\/S1793005708001094"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2010.5593354"},{"key":"ref8","first-page":"669","article-title":"Last-branch and speculative pruning algorithms for Max<formula formulatype=\"inline\"><tex Notation=\"TeX\">$^n$<\/tex> <\/formula>","author":"sturtevant","year":"2003","journal-title":"Proc 18th Int Joint Conf Artif Intell"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(91)90082-U"},{"key":"ref2","first-page":"158","article-title":"An algorithmic solution of N-person games","author":"luckhardt","year":"1986","journal-title":"Proc Nat Conf Artif Intell"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/11922155_16"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","article-title":"An analysis of alpha-beta pruning","volume":"6","author":"knuth","year":"1975","journal-title":"Artif Intell"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/800179.810240"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9080-0_9"},{"key":"ref21","first-page":"65","author":"beal","year":"1989","journal-title":"Advances in Computer Chess 5"},{"key":"ref24","first-page":"71","article-title":"ProbCut: An effective selective extension of the alpha-beta algorithm","volume":"18","author":"buro","year":"1995","journal-title":"Int Comput Chess Assoc J"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00081-5"},{"key":"ref26","author":"plaat","year":"1996","journal-title":"Research Re Search & Re-Search"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1985.4767683"}],"container-title":["IEEE Transactions on Computational Intelligence and AI in Games"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4804728\/5730536\/05696747.pdf?arnumber=5696747","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:52:36Z","timestamp":1633909956000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5696747\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3]]},"references-count":39,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tciaig.2011.2107323","relation":{},"ISSN":["1943-068X","1943-0698"],"issn-type":[{"value":"1943-068X","type":"print"},{"value":"1943-0698","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3]]}}}