{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:36:23Z","timestamp":1725503783146},"reference-count":0,"publisher":"SCITEPRESS - Science and and Technology Publications","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.5220\/0005753004000406","type":"proceedings-article","created":{"date-parts":[[2016,4,28]],"date-time":"2016-04-28T09:19:28Z","timestamp":1461835168000},"page":"400-406","source":"Crossref","is-referenced-by-count":4,"title":["Using Conspiracy Numbers for Improving Move Selection in Minimax Game-Tree Search"],"prefix":"10.5220","author":[{"given":"Quang","family":"Vu","sequence":"first","affiliation":[{"name":"JAIST, Japan"}]},{"given":"Taichi","family":"Ishitobi","sequence":"first","affiliation":[{"name":"JAIST, Japan"}]},{"given":"Jean-Christophe","family":"Terrillon","sequence":"first","affiliation":[{"name":"JAIST, Japan"}]},{"given":"Hiroyuki","family":"Iida","sequence":"first","affiliation":[{"name":"JAIST, Japan"}]}],"member":"3171","event":{"name":"8th International Conference on Agents and Artificial Intelligence","start":{"date-parts":[[2016,2,24]]},"location":"Rome, Italy","end":{"date-parts":[[2016,2,26]]}},"container-title":["Proceedings of the 8th International Conference on Agents and Artificial Intelligence"],"original-title":["Using Conspiracy Numbers for Improving Move Selection in Minimax Game-Tree Search"],"deposited":{"date-parts":[[2016,4,28]],"date-time":"2016-04-28T09:20:16Z","timestamp":1461835216000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.scitepress.org\/DigitalLibrary\/Link.aspx?doi=10.5220\/0005753004000406"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":0,"URL":"https:\/\/doi.org\/10.5220\/0005753004000406","relation":{},"subject":[],"published":{"date-parts":[[2016]]}}}