{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:40:36Z","timestamp":1750308036533,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,7,8]],"date-time":"2006-07-08T00:00:00Z","timestamp":1152316800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,7,8]]},"DOI":"10.1145\/1143997.1144144","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"831-838","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Genetically programmed strategies for chess endgame"],"prefix":"10.1145","author":[{"given":"Nicolas","family":"Lassabe","sequence":"first","affiliation":[{"name":"IRIT\/UT1, Toulouse, France"}]},{"given":"St\u00e9phane","family":"Sanchez","sequence":"additional","affiliation":[{"name":"IRIT\/UT1, Toulouse, France"}]},{"given":"Herv\u00e9e","family":"Luga","sequence":"additional","affiliation":[{"name":"IRIT\/UT1, Toulouse, France"}]},{"given":"Yves","family":"Duthen","sequence":"additional","affiliation":[{"name":"IRIT\/UT1, Toulouse, France"}]}],"member":"320","published-online":{"date-parts":[[2006,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1","volume-title":"EuroGP","author":"\u00e8s M. Au","year":"2004","unstructured":"M. Au on \u00e8s , A. Beck , P. Camacho , N. Lassabe , H. Luga , and F. Scharffe . Evaluation of chess position by modular neural ne work genera ed by genetic algorithm . In EuroGP pages 1 -- 10 , 2004 . M. Au on\u00e8s, A. Beck, P. Camacho, N. Lassabe, H. Luga, and F. Scharffe. Evaluation of chess position by modular neural ne work genera ed by genetic algorithm. In EuroGP pages 1--10, 2004."},{"key":"e_1_3_2_1_2_1","first-page":"291","volume":"13","author":"Bain M.","year":"1994","unstructured":"M. Bain and S. Muggleton . Learning optimal chess strategies. In Machine Intelligence 13 pages 291 -- 309 , 1994 . M. Bain and S. Muggleton. Learning optimal chess strategies. In Machine Intelligence 13 pages 291--309, 1994.","journal-title":"Learning optimal chess strategies. In Machine Intelligence"},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of the Third Austral ian and New Zealand Conference on Intelligent Information Systems IEEE Conference on Evolutionary Computation","volume":"2","author":"Burmeister J.","year":"1995","unstructured":"J. Burmeister and J. Wiles . The challenge of go as a domain for ai research:a comparison between go an chess . In Proceedings of the Third Austral ian and New Zealand Conference on Intelligent Information Systems IEEE Conference on Evolutionary Computation volume volume 2 , 1995 . J. Burmeister and J. Wiles. The challenge of go as a domain for ai research:a comparison between go an chess. In Proceedings of the Third Austral ian and New Zealand Conference on Intelligent Information Systems IEEE Conference on Evolutionary Computation volume volume 2, 1995."},{"key":"e_1_3_2_1_4_1","volume-title":"The Rating of Chessplayers, Past and Present Arco Pub","author":"Elo A. E.","year":"1978","unstructured":"A. E. Elo . The Rating of Chessplayers, Past and Present Arco Pub ., New York , 2 nd edition, 1978 . A. E. Elo. The Rating of Chessplayers, Past and Present Arco Pub., New York, 2nd edition, 1978.","edition":"2"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1995.487479"},{"key":"e_1_3_2_1_6_1","volume-title":"Genetic programmig and krk","author":"Gleich D.","year":"2003","unstructured":"D. Gleich . Machine learning in computer chess : Genetic programmig and krk , 2003 . D. Gleich. Machine learning in computer chess: Genetic programmig and krk, 2003."},{"key":"e_1_3_2_1_7_1","first-page":"740","volume-title":"GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference","author":"Gros R.","year":"2002","unstructured":"R. Gros , K. Albrecht , W. Kantschik , and W. Banzhaf . Evolving chess playing programs . In GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference pages 740 -- 747 . Morgan Kaufmann Publishers , 2002 . R. Gros, K. Albrecht, W. Kantschik, and W. Banzhaf. Evolving chess playing programs. In GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference pages 740--747. Morgan Kaufmann Publishers, 2002."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31989-4_11"},{"key":"e_1_3_2_1_9_1","first-page":"995","volume-title":"Proceedings of the 2001 Congress on Evolutionary Computation CEC2001","author":"Kendall G.","year":"2001","unstructured":"G. Kendall and G. Whitwell . An evolutionary approach for the uning of a chess evaluation function using population dynamics . In Proceedings of the 2001 Congress on Evolutionary Computation CEC2001 pages 995 -- 1002 . IEEE Press, 27-30 2001 . G. Kendall and G. Whitwell. An evolutionary approach for the uning of a chess evaluation function using population dynamics. In Proceedings of the 2001 Congress on Evolutionary Computation CEC2001 pages 995--1002. IEEE Press, 27-30 2001."},{"key":"e_1_3_2_1_10_1","volume-title":"Genetic Programming: On the programming of Computers by Means of Natural Selection MIT Press","author":"Koza J. R.","year":"1992","unstructured":"J. R. Koza . Genetic Programming: On the programming of Computers by Means of Natural Selection MIT Press , Cambridge , Mass ., 1992 . J. R. Koza. Genetic Programming: On the programming of Computers by Means of Natural Selection MIT Press, Cambridge, Mass., 1992."},{"key":"e_1_3_2_1_11_1","first-page":"235","volume-title":"Advances in Computer Chess 8","author":"Morales E.","year":"1997","unstructured":"E. Morales . On learning how to play . In Advances in Computer Chess 8 pages 235 -- 250 . Universiteit Maastricht , 1997 . E. Morales. On learning how to play. In Advances in Computer Chess 8 pages 235--250. Universiteit Maastricht, 1997."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.3233\/ICG-2000-23304"},{"key":"e_1_3_2_1_13_1","first-page":"320","volume":"2","author":"Newell A.","year":"1958","unstructured":"A. Newell , J. Shaw , and H. Simon . Chess-playing programs and the problem of complexity. IBM Journal of Research and Development 2 : 320 -- 335 , 1958 . A. Newell, J. Shaw, and H. Simon. Chess-playing programs and the problem of complexity. IBM Journal of Research and Development 2:320--335, 1958.","journal-title":"Chess-playing programs and the problem of complexity. IBM Journal of Research and Development"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/978-1-4613-9080-0_7","volume-title":"Cray blitz. In in Computers, Chess, and Cognition","author":"Hyatt A. E. G.","year":"1990","unstructured":"A. E. G. Rober M. Hyatt , Harry L. Nelson . Cray blitz. In in Computers, Chess, and Cognition pages 111 -- 130 . Springer-Verlag , 1990 . A. E. G. Rober M. Hyatt, Harry L. Nelson. Cray blitz. In in Computers, Chess, and Cognition pages 111--130. Springer-Verlag, 1990."},{"key":"e_1_3_2_1_15_1","volume-title":"Artificial Intelligence: A Modern Approach Prentice-Hall","author":"Russell S.","year":"1995","unstructured":"S. Russell and P. Norvig . Artificial Intelligence: A Modern Approach Prentice-Hall , Englewood Cliffs, NJ , 1995 . S. Russell and P. Norvig. Artificial Intelligence: A Modern Approach Prentice-Hall, Englewood Cliffs, NJ, 1995."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/257874.257878"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1080\/14786445008521796"},{"key":"e_1_3_2_1_18_1","first-page":"394","volume":"61","author":"Simon H.","year":"1973","unstructured":"H. Simon and W. Chase . Skill in chess. American Scientist 61 : 394 -- 403 , 1973 . H. Simon and W. Chase. Skill in chess. American Scientist 61:394--403, 1973.","journal-title":"Skill in chess. American Scientist"},{"key":"e_1_3_2_1_19_1","first-page":"163","volume-title":"H. J. v. d","author":"Weill J.-C.","year":"1994","unstructured":"J.-C. Weill . How hard is he correct coding of an easy endgame . In H. J. v. d . Herik, I. S. Herschberg, and J. W. H. M. Uiterwijk, editors, Advances in Computer Chess 7 pages 163 -- 176 . University of Limburg , 1994 . J.-C. Weill. How hard is he correct coding of an easy endgame. In H. J. v. d. Herik, I. S. Herschberg, and J. W. H. M. Uiterwijk, editors, Advances in Computer Chess 7 pages 163--176. University of Limburg, 1994."}],"event":{"name":"GECCO06: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Seattle Washington USA","acronym":"GECCO06"},"container-title":["Proceedings of the 8th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1143997.1144144","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1143997.1144144","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:14:14Z","timestamp":1750259654000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1143997.1144144"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,8]]},"references-count":19,"alternative-id":["10.1145\/1143997.1144144","10.1145\/1143997"],"URL":"https:\/\/doi.org\/10.1145\/1143997.1144144","relation":{},"subject":[],"published":{"date-parts":[[2006,7,8]]},"assertion":[{"value":"2006-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}