{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:51:27Z","timestamp":1743090687983,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319279916"},{"type":"electronic","value":"9783319279923"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27992-3_8","type":"book-chapter","created":{"date-parts":[[2015,12,24]],"date-time":"2015-12-24T07:24:21Z","timestamp":1450941861000},"page":"76-88","source":"Crossref","is-referenced-by-count":1,"title":["Go Complexities"],"prefix":"10.1007","author":[{"given":"Abdallah","family":"Saffidine","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Teytaud","sequence":"additional","affiliation":[]},{"given":"Shi-Jim","family":"Yen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,25]]},"reference":[{"issue":"7","key":"8_CR1","doi-asserted-by":"publisher","first-page":"1439","DOI":"10.1142\/S0129054112400576","volume":"23","author":"D Auger","year":"2012","unstructured":"Auger, D., Teytaud, O.: The frontier of decidability in partially observable recursive games. Int. J. Found. Comput. Sci. 23(7), 1439\u20131450 (2012)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"3","key":"8_CR2","doi-asserted-by":"crossref","first-page":"165","DOI":"10.3233\/ICG-2007-30311","volume":"30","author":"T Cazenave","year":"2007","unstructured":"Cazenave, T., Borsboom, J.: Golois wins Phantom Go tournament. ICGA J. 30(3), 165\u2013166 (2007)","journal-title":"ICGA J."},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-75538-8_7","volume-title":"Computers and Games","author":"R Coulom","year":"2007","unstructured":"Coulom, R.: Efficient selectivity and backup operators in monte-carlo tree search. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M.J. (eds.) CG 2006. LNCS, vol. 4630, pp. 72\u201383. Springer, Heidelberg (2007)"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-48957-6_15","volume-title":"Computers and Games","author":"M Cr\u00e2smaru","year":"1999","unstructured":"Cr\u00e2smaru, M.: On the complexity of Tsume-Go. In: van den Herik, H.J., Iida, H. (eds.) CG 1998. LNCS, vol. 1558, p. 222. Springer, Heidelberg (1999)"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/3-540-45579-5_16","volume-title":"Computers and Games","author":"M Cr\u00e2smaru","year":"2002","unstructured":"Cr\u00e2smaru, M., Tromp, J.: Ladders are PSPACE-complete. In: Marsland, T., Frank, I. (eds.) CG 2001. LNCS, vol. 2063, p. 241. Springer, Heidelberg (2002)"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Gelly, S., Silver, D.: Combining online and offline knowledge in UCT. In: Proceedings of the 24th International Conference on Machine Learning, ICML \u201907, pp. 273\u2013280. ACM Press, New York (2007)","DOI":"10.1145\/1273496.1273531"},{"key":"8_CR7","unstructured":"Gelly, S., Wang, Y., Munos, R., Teytaud, O.: Modification of UCT with patterns in Monte-Carlo Go. Rapport de recherche INRIA RR-6062 (2006). \n                    http:\/\/hal.inria.fr\/inria-00117266\/en\/"},{"key":"8_CR8","doi-asserted-by":"crossref","DOI":"10.1201\/b10581","volume-title":"Games, Puzzles, and Computation","author":"RA Hearn","year":"2009","unstructured":"Hearn, R.A., Demaine, E.D.: Games, Puzzles, and Computation. A K Peters, Cambridge (2009)"},{"issue":"2","key":"8_CR9","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1145\/322186.322201","volume":"27","author":"D Lichtenstein","year":"1980","unstructured":"Lichtenstein, D., Sipser, M.: Go is polynomial-space hard. J. ACM 27(2), 393\u2013401 (1980)","journal-title":"J. ACM"},{"key":"8_CR10","unstructured":"Robson, J.M.: The complexity of Go. In: IFIP Congress, pp. 413\u2013417 (1983)"}],"container-title":["Lecture Notes in Computer Science","Advances in Computer Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27992-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:26:49Z","timestamp":1559348809000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27992-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319279916","9783319279923"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27992-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}