{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:11:25Z","timestamp":1743081085718,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319199405"},{"type":"electronic","value":"9783319199412"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19941-2_54","type":"book-chapter","created":{"date-parts":[[2015,6,21]],"date-time":"2015-06-21T23:07:32Z","timestamp":1434928052000},"page":"565-574","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Using Patterns in Computer Go"],"prefix":"10.1007","author":[{"given":"Leszek Stanis\u0142aw","family":"\u015aliwa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,23]]},"reference":[{"key":"54_CR1","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/34.44404","volume":"12","author":"B Abramson","year":"1990","unstructured":"Abramson, B.: Expected-outcome: a general model of static evaluation. IEEE Trans. PAMI 12, 182\u2013193 (1990)","journal-title":"IEEE Trans. PAMI"},{"key":"54_CR2","first-page":"13","volume":"13","author":"M Boon","year":"1990","unstructured":"Boon, M.: A pattern matcher for Goliath. Comput. Go 13, 13\u201323 (1990)","journal-title":"Comput. Go"},{"key":"54_CR3","unstructured":"Bouzy, B. and Chaslot, G.: Bayesian generation and integration of K-nearest-neighbor patterns for 19x19 Go. In: Kendall, G., Lucas, S.(eds.) IEEE 2005 Symposium on Computational Intelligence in Games, pp. 176\u2013181, Colchester (2005)"},{"issue":"1","key":"54_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCIAIG.2012.2186810","volume":"4","author":"C Browne","year":"2009","unstructured":"Browne, C., et al.: A survey of Monte Carlo Tree Search methods. IEEE Trans. Comput. Intell. AI Games 4(1), 1\u201343 (2009)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"54_CR5","unstructured":"Cazenave, T.: Generation of Patterns with External Conditions for the Game of Go. In: van den Herik, H.J., Monien, B.(eds.) Advances in Computer Games 9, pp. 275\u2013293. Universiteit Maastricht, Maastricht (2001)"},{"key":"54_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-12993-3_1","volume-title":"Advances in Computer Games","author":"G Chaslot","year":"2010","unstructured":"Chaslot, G., Fiter, C., Hoock, J.-B., Rimmel, A., Teytaud, O.: Adding expert knowledge and exploration in Monte-Carlo Tree Search. In: van den Herik, H.J., Spronck, P. (eds.) ACG 2009. LNCS, vol. 6048, pp. 1\u201313. Springer, Heidelberg (2010)"},{"issue":"3","key":"54_CR7","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1142\/S1793005708001094","volume":"4","author":"G Chaslot","year":"2008","unstructured":"Chaslot, G., et al.: Progressive strategies for Monte-Carlo Tree Search. New Math. Nat. Comput. 4(3), 343\u2013357 (2008)","journal-title":"New Math. Nat. Comput."},{"issue":"4","key":"54_CR8","first-page":"198","volume":"30","author":"R Coulom","year":"2007","unstructured":"Coulom, R.: Computing Elo ratings of move patterns in the game of go. Int. Comp. Games Assoc. J. 30(4), 198\u2013208 (2007)","journal-title":"Int. Comp. Games Assoc. J."},{"key":"54_CR9","unstructured":"Drake, P., and Uurtamo, S.: Heuristics in Monte Carlo Go. In: International Conference on Artificial Intelligence, pp. 171\u2013175, Las Vegas (2007)"},{"issue":"3","key":"54_CR10","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1145\/2093548.2093574","volume":"55","author":"S Gelly","year":"2012","unstructured":"Gelly, S., et al.: The grand challenge of computer go: Monte Carlo Tree Search and extensions. Commun. ACM 55(3), 106\u2013113 (2012)","journal-title":"Commun. ACM"},{"key":"54_CR11","unstructured":"Gelly, S., et al.: Modifications of UCT with Patterns in Monte-Carlo Go. Technical report 6062, INRIA (2006)"},{"key":"54_CR12","unstructured":"GNU Go 3.8. \n                      http:\/\/www.gnu.org\/software\/gnugo"},{"key":"54_CR13","unstructured":"G\u00f6rtz, U., Game records in SGF format. \n                      http:\/\/www.u-go.net\/gamerecords"},{"key":"54_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-642-12148-7_23","volume-title":"Genetic Programming","author":"J-B Hoock","year":"2010","unstructured":"Hoock, J.-B., Teytaud, O.: Bandit-based genetic programming. In: Esparcia-Alc\u00e1zar, A.I., Ek\u00e1rt, A., Silva, S., Dignum, S., Uyar, A.\u015e. (eds.) EuroGP 2010. LNCS, vol. 6021, pp. 268\u2013277. Springer, Heidelberg (2010)"},{"key":"54_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/11871842_29","volume-title":"Machine Learning: ECML 2006","author":"L Kocsis","year":"2006","unstructured":"Kocsis, L., Szepesv\u00e1ri, C.: Bandit based Monte-Carlo planning. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282\u2013293. Springer, Heidelberg (2006)"},{"key":"54_CR16","doi-asserted-by":"crossref","unstructured":"Wang, Y., Gelly, S.: Modifications of UCT and sequence-like simulations for Monte-Carlo Go. In Proceedings of IEEE Symposium on Computational Intelligence and Games, pp. 175\u2013182, Honolulu (2007)","DOI":"10.1109\/CIG.2007.368095"},{"key":"54_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-540-40031-8_26","volume-title":"Computers and Games","author":"E Werf van der","year":"2003","unstructured":"van der Werf, E., Uiterwijk, J.W.H.M., Postma, E.O., van den Herik, H.J.: Local move prediction in go. In: Schaeffer, J., M\u00fcller, M., Bj\u00f6rnsson, Y. (eds.) CG 2002. LNCS, vol. 2883, pp. 393\u2013412. Springer, Heidelberg (2003)"},{"key":"54_CR18","unstructured":"Zobrist, A.L.: Feature Extraction and Representation for Pattern Recognition and the Game of Go. Ph.D. thesis, University of Wisconsin, Madison (1970)"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition and Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19941-2_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T20:06:56Z","timestamp":1560110816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-19941-2_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319199405","9783319199412"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19941-2_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"23 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}