{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T03:44:24Z","timestamp":1777693464182,"version":"3.51.4"},"reference-count":7,"publisher":"SAGE Publications","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ICG"],"published-print":{"date-parts":[[2019,3,5]]},"DOI":"10.3233\/icg-180057","type":"journal-article","created":{"date-parts":[[2018,11,23]],"date-time":"2018-11-23T10:46:42Z","timestamp":1542970002000},"page":"234-245","source":"Crossref","is-referenced-by-count":0,"title":["Winning strategies in DarkHex: Hex with hidden stones"],"prefix":"10.1177","volume":"40","author":[{"given":"Fran\u00e7ois","family":"Bonnet","sequence":"first","affiliation":[{"name":"School of Computing, Tokyo Institute of Technology, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/ICG-180057_ref1","doi-asserted-by":"crossref","unstructured":"Bonnet, F. & Viennot, S. (2016). Nash equilibrium in mastermind. In Proceedings of the 9th International Conference on Computers and Games (pp.\u00a0115\u2013128).","DOI":"10.1007\/978-3-319-50935-8_11"},{"key":"10.3233\/ICG-180057_ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-71649-7_2"},{"issue":"2","key":"10.3233\/ICG-180057_ref3","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1080\/0025570X.1981.11976904","article-title":"Kriegspiel Hex: Solution 1084","volume":"54","author":"Broline","year":"1981","journal-title":"Mathematics Magazine"},{"key":"10.3233\/ICG-180057_ref5","unstructured":"Nasar, S. (1998). A\u00a0Beautiful Mind: A\u00a0Biography of John Forbes Nash, Jr. Simon and Schuster."},{"key":"10.3233\/ICG-180057_ref7","unstructured":"Pawlewicz, J. & Hayward, R.B. (2013). Scalable parallel DFPN search. In Proceedings of the 8th International Conference on Computers and Games (pp.\u00a0138\u2013150)."},{"key":"10.3233\/ICG-180057_ref8","doi-asserted-by":"publisher","first-page":"296","DOI":"10.2307\/1969530","article-title":"An iterative method of solving a game","volume":"54","author":"Robinson","year":"1951","journal-title":"Annals of Mathematics"},{"key":"10.3233\/ICG-180057_ref9","unstructured":"Yang, J., Liao, S. & Pawlak, M. (2002). New winning and losing positions for 7\u00a0\u00d7 7 Hex. In Proceedings of the 3rd International Conference on Computers and Games (pp.\u00a0230\u2013248)."}],"container-title":["ICGA Journal"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/ICG-180057","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:12:50Z","timestamp":1777453970000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/ICG-180057"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,5]]},"references-count":7,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.3233\/icg-180057","relation":{},"ISSN":["2468-2438","1389-6911"],"issn-type":[{"value":"2468-2438","type":"electronic"},{"value":"1389-6911","type":"print"}],"subject":[],"published":{"date-parts":[[2019,3,5]]}}}