{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T14:19:02Z","timestamp":1725718742276},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1109\/cig.2015.7317939","type":"proceedings-article","created":{"date-parts":[[2015,11,5]],"date-time":"2015-11-05T22:53:27Z","timestamp":1446764007000},"page":"122-129","source":"Crossref","is-referenced-by-count":8,"title":["An experimental study of action selection mechanisms to create an entertaining opponent"],"prefix":"10.1109","author":[{"given":"Nick","family":"Sephton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter I.","family":"Cowling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicholas H.","family":"Slaven","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1142\/S1793005708001094"},{"year":"2009","author":"schadd","journal-title":"Monte-Carlo search techniques in the modern board game Thurn and Taxis","key":"ref11"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1080\/08839510701527580"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/CIG.2008.5035632"},{"key":"ref14","first-page":"215","article-title":"Assessing Believability","author":"togelius","year":"2012","journal-title":"Believable Bots"},{"key":"ref15","first-page":"499","article-title":"Evolving Opponents for Interesting Interactive Computer Games","author":"yannakakis","year":"2004","journal-title":"Proc of the 8th International Conference on the Simulation of Adaptive Behavior"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/TAMD.2010.2056368"},{"year":"0","author":"koster","journal-title":"A Theory of Fun for Game Design 2004","key":"ref17"},{"key":"ref18","first-page":"91","article-title":"AI for dynamic difficulty adjustment in games","author":"hunicke","year":"2004","journal-title":"Challenges in Game Artificial Intelligence AAAI"},{"year":"0","author":"holopainen","journal-title":"Game Design Patterns 2003","key":"ref19"},{"key":"ref4","first-page":"282","article-title":"Bandit based Monte-Carlo Planning","author":"kocsis","year":"2006","journal-title":"Machine Learning European Conference on"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/978-3-540-75538-8_7","article-title":"Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search","author":"coulom","year":"2007","journal-title":"Proc Int Conf Comput Games"},{"key":"ref6","article-title":"Information capture and reuse strategies in Monte Carlo Tree Search, with applications to games of hidden information","author":"powley","year":"2013","journal-title":"Artif Intell (submitted)"},{"key":"ref5","article-title":"Exploration exploitation in Go: UCT for Monte-Carlo Go","author":"gelly","year":"2006","journal-title":"Proc Adv Neur Inform Process Syst Vancouver Canada"},{"key":"ref8","first-page":"134","article-title":"Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search","author":"long","year":"2010","journal-title":"Proc Assoc Adv Artif Intell Atlanta Georgia"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/TCIAIG.2012.2200894"},{"key":"ref2","first-page":"83","article-title":"Monte-Carlo Strategies for Computer Go","author":"chaslot","year":"2006","journal-title":"Proc BeNeLux Conf Artif Intell Namur Belgium"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/TCIAIG.2012.2186810"},{"key":"ref9","first-page":"100","article-title":"Inte-grating Monte Carlo Tree Search with Knowledge-Based Methods to Create Engaging Play in a Commercial Mobile Game","author":"whitehouse","year":"2013","journal-title":"Proc Artif Intell Interact Digital Entert Conf Boston Massachusetts"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/CIG.2014.6932892"},{"key":"ref22","article-title":"Par-allelization of Information Set Monte Carlo tree search","author":"sephton","year":"2014","journal-title":"IEEE Congress on Evolutionary Computation"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1109\/IJCNN.2008.4633818"}],"event":{"name":"2015 IEEE Conference on Computational Intelligence and Games (CIG)","start":{"date-parts":[[2015,8,31]]},"location":"Tainan, Taiwan","end":{"date-parts":[[2015,9,2]]}},"container-title":["2015 IEEE Conference on Computational Intelligence and Games (CIG)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7302806\/7317656\/07317939.pdf?arnumber=7317939","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T23:01:31Z","timestamp":1498258891000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7317939\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/cig.2015.7317939","relation":{},"subject":[],"published":{"date-parts":[[2015,8]]}}}