{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T16:17:07Z","timestamp":1771517827647,"version":"3.50.1"},"reference-count":56,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/S022325\/1"],"award-info":[{"award-number":["EP\/S022325\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Games"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1109\/tg.2021.3138561","type":"journal-article","created":{"date-parts":[[2021,12,28]],"date-time":"2021-12-28T21:21:30Z","timestamp":1640726490000},"page":"663-675","source":"Crossref","is-referenced-by-count":5,"title":["Visualizing Multiplayer Game Spaces"],"prefix":"10.1109","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8966-5644","authenticated-orcid":false,"given":"James","family":"Goodman","sequence":"first","affiliation":[{"name":"School of Electronic Engineering and Computer Science, Queen Mary University of London, London, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1958-0212","authenticated-orcid":false,"given":"Diego","family":"Perez-Liebana","sequence":"additional","affiliation":[{"name":"School of Electronic Engineering and Computer Science, Queen Mary University of London, London, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3180-7451","authenticated-orcid":false,"given":"Simon","family":"Lucas","sequence":"additional","affiliation":[{"name":"School of Electronic Engineering and Computer Science, Queen Mary University of London, London, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804779"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1177\/1094428104263675"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2018.8477869"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754811"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2200894"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.14311\/AP.2014.54.0333"},{"key":"ref37","first-page":"2579","article-title":"Visualizing data using t-SNE","volume":"9","author":"maaten","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1037\/h0071325"},{"key":"ref35","first-page":"66","article-title":"Dimensionality reduction: A comparative","volume":"10","author":"maaten","year":"2009","journal-title":"J Mach Learn Res"},{"key":"ref34","first-page":"1","article-title":"Efficient evolutionary methods for game agent optimisation: Model-based is best","author":"lucas","year":"0","journal-title":"Proc AAAI-2019 Workshop Games Simul Artif Intell"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/11871842_29"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2186810"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1038\/nature24270","article-title":"Mastering the game of go without human knowledge","volume":"550","author":"silver","year":"2017","journal-title":"Nature"},{"key":"ref2","author":"elias","year":"2012","journal-title":"Characteristics of Games"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.5398"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CoG47356.2020.9231603"},{"key":"ref22","first-page":"1057","article-title":"Prob-maxn?: Playing n-player games with opponent models","volume":"6","author":"sturtevant","year":"0","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.3233\/ICG-2008-31402"},{"key":"ref24","first-page":"120","article-title":"Incorporating opponent models into adversary search","volume":"1","author":"carmel","year":"0","journal-title":"Proc 13th Nat Conf Artif Intell \/8th Innov Appl Artif Intell Conf"},{"key":"ref23","doi-asserted-by":"crossref","DOI":"10.26481\/dis.20031205hd","article-title":"Nosce hostem: Searching with opponent models","author":"donkers","year":"2003"},{"key":"ref26","first-page":"91","article-title":"Monte-Carlo tree search in production management problems","author":"chaslot","year":"0","journal-title":"Proc 18th BeNeLux Conf Artif Intell"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75538-8_7"},{"key":"ref50","article-title":"18 gameplay evaluation measures","volume":"4","author":"volz","year":"2015"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2017.8080424"},{"key":"ref56","first-page":"17443","article-title":"Real world games look like spinning tops","volume":"33","author":"czarnecki","year":"2020","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-020-19244-4"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-55849-3_28"},{"key":"ref53","article-title":"Deep learning for general game playing with Ludii and polygames","author":"soemers","year":"2021"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/CEC48606.2020.9185834"},{"key":"ref10","article-title":"Multiplayer solitaire","author":"atlas","year":"2020"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/CoG52621.2021.9619089"},{"key":"ref11","article-title":"Why many Eurogames are inherently single-player games","author":"burgun","year":"2015"},{"key":"ref12","author":"woods","year":"2012","journal-title":"Eurogames The design culture and play of modern European board games"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2019.8847949"},{"key":"ref14","first-page":"158","article-title":"An algorithmic solution of n-person games","volume":"86","author":"luckhart","year":"0","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(91)90082-U"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/S0004-3702(97)00074-X","article-title":"Pruning algorithms for multi-model adversary search","volume":"99","author":"carmel","year":"1998","journal-title":"Artif Intell"},{"key":"ref17","first-page":"201","article-title":"On pruning techniques for multi-player games","volume":"49","author":"sturtevant","year":"0","journal-title":"Proc 17th Nat Conf Artif Intell \/12th Conf Innov Appl Artif Intell"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2011.2107323"},{"key":"ref19","first-page":"210","volume":"4250","author":"lorenz","year":"2006","journal-title":"Player Modeling Search Algorithms and Strategies in Multi-Player Games"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2016.7860398"},{"key":"ref3","first-page":"1","article-title":"TAG: A tabletop games framework","author":"gaina","year":"0","journal-title":"Proc AIIDE Workshop Exp AI Games"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01448847"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1609\/aiide.v12i1.12884"},{"key":"ref8","article-title":"Player interaction","author":"aleknevicus","year":"2003"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1609\/aiide.v7i3.12479"},{"key":"ref7","first-page":"286","article-title":"Non-cooperative games","volume":"52","author":"nash","year":"0","journal-title":"Ann Math"},{"key":"ref9","author":"tesfatsion","year":"2006","journal-title":"Handbook of Computational Economics Agent-Based Computational Economics"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2016.7860384"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v24i1.7562"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2010.2041928"},{"key":"ref47","first-page":"1","article-title":"Characteristics of generatable games","author":"togelius","year":"0","journal-title":"Proc 5th Workshop Proc Content Gener Games (at 9th Int Conf Found Digit Games)"},{"key":"ref42","article-title":"Using knowledge about the opponent in game-tree search","author":"jansen","year":"1992"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2016.2565558"},{"key":"ref44","first-page":"23","article-title":"Game-tree properties and MCTS performance","volume":"11","author":"finnsson","year":"0","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v20i1.13437"}],"container-title":["IEEE Transactions on Games"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7782673\/9987665\/09664231.pdf?arnumber=9664231","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T19:11:49Z","timestamp":1673896309000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9664231\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12]]},"references-count":56,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tg.2021.3138561","relation":{},"ISSN":["2475-1502","2475-1510"],"issn-type":[{"value":"2475-1502","type":"print"},{"value":"2475-1510","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12]]}}}