{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T17:54:59Z","timestamp":1755798899645,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,8,5]],"date-time":"2024-08-05T00:00:00Z","timestamp":1722816000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,8,5]],"date-time":"2024-08-05T00:00:00Z","timestamp":1722816000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,8,5]]},"DOI":"10.1109\/cog60054.2024.10645614","type":"proceedings-article","created":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T18:44:09Z","timestamp":1724870649000},"page":"1-4","source":"Crossref","is-referenced-by-count":2,"title":["Deduction Game Framework and Information Set Entropy Search"],"prefix":"10.1109","author":[{"given":"Fandi","family":"Meng","sequence":"first","affiliation":[{"name":"Queen Mary University of London,London,United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Lucas","sequence":"additional","affiliation":[{"name":"Queen Mary University of London,London,United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"2024","article-title":"Black box (board game)","author":"contributors","year":"2024"},{"article-title":"Deduction games","year":"2019","author":"Faidutti","key":"ref2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1201\/9781003179184"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2200894"},{"key":"ref5","article-title":"Competing in a complex hidden role game with information set monte carlo tree search","author":"Reinhardt","year":"2020","journal-title":"arXiv preprint arXiv:2005.07156"},{"article-title":"Automatically solving deduction games via symbolic execution, model counting, and entropy maximization","year":"2019","author":"Downing","key":"ref6"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01917147"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.3233\/ICG-2005-28105"},{"key":"ref9","article-title":"Maximum entropy monte-carlo planning","volume":"32","author":"Xiao","year":"2019","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(98)00023-X"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.2307\/3608991"},{"key":"ref12","first-page":"2024","article-title":"Mastermind (board game)","author":"contributors","year":"2024"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2017.11.004"},{"key":"ref14","article-title":"Mastermind is np-complete","author":"Stuckman","year":"2005","journal-title":"arXiv preprint cs\/0512049"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"}],"event":{"name":"2024 IEEE Conference on Games (CoG)","start":{"date-parts":[[2024,8,5]]},"location":"Milan, Italy","end":{"date-parts":[[2024,8,8]]}},"container-title":["2024 IEEE Conference on Games (CoG)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10645493\/10645533\/10645614.pdf?arnumber=10645614","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T09:24:57Z","timestamp":1725441897000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10645614\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,5]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/cog60054.2024.10645614","relation":{},"subject":[],"published":{"date-parts":[[2024,8,5]]}}}