{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,26]],"date-time":"2026-10-26T16:57:58Z","timestamp":1793033878822,"version":"4.5.0"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"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,6]]},"DOI":"10.1109\/tciaig.2011.2144597","type":"journal-article","created":{"date-parts":[[2011,4,26]],"date-time":"2011-04-26T14:24:41Z","timestamp":1303827881000},"page":"142-154","source":"Crossref","is-referenced-by-count":35,"title":["Fast Approximate Max-n Monte Carlo Tree Search for Ms Pac-Man"],"prefix":"10.1109","volume":"3","author":[{"given":"Spyridon","family":"Samothrakis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Robles","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Simon","family":"Lucas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2011.6031987"},{"key":"ref33","first-page":"40","article-title":"UCT for tactical assault planning in real-time strategy games","author":"balla","year":"2009","journal-title":"Proc 21st Int Joint Conf Artif Intell"},{"key":"ref32","first-page":"216","article-title":"Monte-Carlo tree search: A new framework for game AI","author":"chaslot","year":"2008","journal-title":"Proc 4th Artif Intell Interactive Digit Entertain Conf"},{"key":"ref31","article-title":"Monte Carlo planning in RTS games","author":"chung","year":"2005","journal-title":"Proc IEEE Symp Comput Intell Games"},{"key":"ref30","first-page":"1537","article-title":"Achieving master level play in 9<formula formulatype=\"inline\"><tex Notation=\"TeX\">$\\,{\\times}\\,$<\/tex> <\/formula>9 computer Go","author":"gelly","year":"2008","journal-title":"Proc 23rd AAAI Conf Artif Intell"},{"key":"ref37","author":"galaxies","year":"2006","journal-title":"Twin GalaxiesMs Pac-Man High Scores ONLINE"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2010.5593331"},{"key":"ref35","first-page":"158","article-title":"An algorithmic solution of n-person games","author":"luckhardt","year":"1986","journal-title":"Proc 5th Nat Conf Artif Intell (AAAI)"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/11674399_2"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2007.368110"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2008.5035644"},{"key":"ref12","first-page":"203","article-title":"Evolving a neural network location evaluator to play Ms Pac-Man","author":"lucas","year":"2005","journal-title":"Proc IEEE Symp Comput Intell Games"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2009.5286469"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2009.5286495"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/UKCI.2010.5625586"},{"key":"ref16","first-page":"282","article-title":"Bandit based Monte-Carlo planning","author":"kocsis","year":"2006","journal-title":"Proc 15th Eur Conf Mach Learn"},{"key":"ref17","author":"rasmusen","year":"2007","journal-title":"Games and Information An Introduction to Game Theory"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref19","article-title":"Exploration exploitation in Go: UCT for Monte-Carlo Go","author":"gelly","year":"2006","journal-title":"Proc Annu Conf Neural Inf Process Syst"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2007.4425000"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2010.2067212"},{"key":"ref27","first-page":"175","article-title":"Monte-Carlo tree search in backgammon","author":"van lishout","year":"2007","journal-title":"Proc Comput Games Workshop"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2009.2018702"},{"key":"ref6","author":"koza","year":"1992","journal-title":"Genetic Programming On the Programming of Computers by Means of Natural Selection"},{"key":"ref29","first-page":"367","article-title":"Monte-Carlo tree search in poker using expected reward distributions","author":"den broeck","year":"2009","journal-title":"Proc ACM"},{"key":"ref5","author":"matsumoto","year":"2009","journal-title":"Ice pambush 2"},{"key":"ref8","author":"bonet","year":"1999","journal-title":"Learning to play Pac-Man using incremental reinforcement learning"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1613\/jair.2368","article-title":"Learning to play using low-complexity rule-based policies","volume":"30","author":"szita","year":"2007","journal-title":"J Artif Intell Res"},{"key":"ref2","author":"gelly","year":"2006","journal-title":"Modification of UCT with patterns in Monte-Carlo Go"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2003.1299397"},{"key":"ref1","first-page":"72","article-title":"Efficient selectivity and backup operators in Monte-Carlo tree search","author":"coulom","year":"2006","journal-title":"Proc 5th Int Conf Comput Games"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2009.2018703"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"178","DOI":"10.3233\/ICG-2009-32311","article-title":"Human vs. Computer Go competition in FUZZ-IEEE 2009","volume":"32","author":"yen","year":"2009","journal-title":"ICGA J"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"241","DOI":"10.3233\/ICG-2009-32412","article-title":"9<formula formulatype=\"inline\"><tex Notation=\"TeX\">$\\,{\\times}\\,$<\/tex> <\/formula>9 Go as black with komi 7.5: At last some games won against top players in the disadvantageous situation","volume":"32","author":"billouet","year":"2009","journal-title":"ICGA J"},{"key":"ref24","article-title":"Computing ELO ratings of move patterns in the game of Go","author":"coulom","year":"2007","journal-title":"Proc Comput Games Workshop"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1093\/screen\/24.4-5.108"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2010.2083662"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1142\/S1793005708001094"}],"container-title":["IEEE Transactions on Computational Intelligence and AI in Games"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4804728\/5875971\/05752830.pdf?arnumber=5752830","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:53:59Z","timestamp":1642006439000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5752830\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":38,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tciaig.2011.2144597","relation":{},"ISSN":["1943-068X","1943-0698"],"issn-type":[{"value":"1943-068X","type":"print"},{"value":"1943-0698","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6]]}}}