{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:32:27Z","timestamp":1742913147036,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319314709"},{"type":"electronic","value":"9783319314716"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","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":[[2016]]},"DOI":"10.1007\/978-3-319-31471-6_10","type":"book-chapter","created":{"date-parts":[[2016,3,18]],"date-time":"2016-03-18T22:35:28Z","timestamp":1458340528000},"page":"123-135","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Towards Human-Competitive Game Playing for\u00a0Complex Board Games with Genetic Programming"],"prefix":"10.1007","author":[{"given":"Denis","family":"Robilliard","sequence":"first","affiliation":[]},{"given":"Cyril","family":"Fonlupt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,20]]},"reference":[{"key":"10_CR1","unstructured":"Pfeiffer, M.: Reinforcement learning of strategies for Settlers of Catan. In: Mehdi, Q., Gough, N., Natkin, S., Al-Dabass, D. (eds.) 5th international conference on computer games: artificial intelligence, design and education, pp. 384\u2013388 (2004)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-12993-3_3","volume-title":"Advances in Computer Games","author":"I Szita","year":"2010","unstructured":"Szita, I., Chaslot, G., Spronck, P.: Monte-Carlo tree search in settlers of catan. In: van den Herik, H.J., Spronck, P. (eds.) ACG 2009. LNCS, vol. 6048, pp. 21\u201332. Springer, Heidelberg (2010)"},{"issue":"4","key":"10_CR3","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s12065-013-0096-9","volume":"6","author":"RK Winder","year":"2013","unstructured":"Winder, R.K.: Methods for approximating value functions for the Dominion card game. Evol. Intell. 6(4), 195\u2013204 (2013)","journal-title":"Evol. Intell."},{"key":"10_CR4","unstructured":"Chaslot, G.M.J.P., Saito, J.-T., Bouzy, B., Uiterwijk, J.W.H.M., Van Den Herik, H.J.: Monte-Carlo strategies for computer Go. In: Proceedings of the 18th BeNeLux Conference on Artificial Intelligence, Namur, Belgium, pp. 83\u201391 (2006)"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-540-31989-4_11","volume-title":"Genetic Programming","author":"A Hauptman","year":"2005","unstructured":"Hauptman, A., Sipper, M.: GP-endchess: using genetic programming to evolve chess endgame players. In: Keijzer, M., Tettamanzi, A.G.B., Collet, P., van Hemert, J., Tomassini, M. (eds.) EuroGP 2005. LNCS, vol. 3447, pp. 120\u2013131. Springer, Heidelberg (2005)"},{"key":"10_CR6","first-page":"28","volume":"64","author":"M Sipper","year":"2008","unstructured":"Sipper, M.: Evolving game-playing strategies with genetic programming. ERCIM News 64, 28\u201329 (2008). Invited article","journal-title":"ERCIM News"},{"issue":"314","key":"10_CR7","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1080\/14786445008521796","volume":"41","author":"CE Shannon","year":"1950","unstructured":"Shannon, C.E.: XXII. Programming a computer for playing chess. Philos. Mag. (Ser. 7) 41(314), 256\u2013275 (1950)","journal-title":"Philos. Mag. (Ser. 7)"},{"key":"10_CR8","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":"10_CR9","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: Herik, H.J., Ciancarini, P., Donkers, H.H.L.M.J. (eds.) CG 2006. LNCS, vol. 4630, pp. 72\u201383. Springer, Heidelberg (2007)"},{"key":"10_CR10","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, pp. 273\u2013280. ACM (2007)","DOI":"10.1145\/1273496.1273531"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-540-87608-3_2","volume-title":"Computers and Games","author":"RJ Lorentz","year":"2008","unstructured":"Lorentz, R.J.: Amazons discover Monte-Carlo. In: Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol. 5131, pp. 13\u201324. Springer, Heidelberg (2008)"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-12993-3_5","volume-title":"Advances in Computer Games","author":"T Cazenave","year":"2010","unstructured":"Cazenave, T.: Monte-Carlo kakuro. In: van den Herik, H.J., Spronck, P. (eds.) ACG 2009. LNCS, vol. 6048, pp. 45\u201354. Springer, Heidelberg (2010)"},{"issue":"4","key":"10_CR13","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1109\/TCIAIG.2010.2067212","volume":"2","author":"B Arneson","year":"2010","unstructured":"Arneson, B., Hayward, R.B., Henderson, P.: Monte-Carlo tree search in Hex. IEEE Trans. Comput. Intell. AI Games 2(4), 251\u2013258 (2010)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-642-12993-3_7","volume-title":"Advances in Computer Games","author":"F Teytaud","year":"2010","unstructured":"Teytaud, F., Teytaud, O.: Creating an upper-confidence-tree program for havannah. In: van den Herik, H.J., Spronck, P. (eds.) ACG 2009. LNCS, vol. 6048, pp. 65\u201374. Springer, Heidelberg (2010)"},{"key":"10_CR15","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-319-14923-3_5","volume-title":"Computer Games","author":"D Robilliard","year":"2014","unstructured":"Robilliard, D., Fonlupt, C., Teytaud, F.: Monte-Carlo tree search for the game of \u201c7 wonders\u201d. In: Cazenave, T., Winands, M.H.M., Bj\u00f6rnsson, Y. (eds.) CGW 2014. CCIS, vol. 504, pp. 64\u201377. Springer, Heidelberg (2014)"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Whitehouse, D., Powley, E.J., Cowling, P.I.: Determinization and information set Monte-Carlo tree search for the card game Dou Di Zhu. In: IEEE Conference on Computational Intelligence and Games (CIG), pp. 87\u201394. IEEE (2011)","DOI":"10.1109\/CIG.2011.6031993"},{"key":"10_CR17","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)"}],"container-title":["Lecture Notes in Computer Science","Artificial Evolution"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-31471-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:27:35Z","timestamp":1558312055000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-31471-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319314709","9783319314716"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-31471-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"20 March 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}