{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:31:48Z","timestamp":1750307508887,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,7,8]],"date-time":"2009-07-08T00:00:00Z","timestamp":1247011200000},"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":[[2009,7,8]]},"DOI":"10.1145\/1569901.1570100","type":"proceedings-article","created":{"date-parts":[[2009,7,21]],"date-time":"2009-07-21T13:32:17Z","timestamp":1248183137000},"page":"1483-1490","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Simulating human grandmasters"],"prefix":"10.1145","author":[{"given":"Omid","family":"David-Tabibi","sequence":"first","affiliation":[{"name":"Bar-Ilan University, Ramat-Gan, Israel"}]},{"given":"H. Jaap","family":"van den Herik","sequence":"additional","affiliation":[{"name":"Tilburg University, Tilburg, Netherlands"}]},{"given":"Moshe","family":"Koppel","sequence":"additional","affiliation":[{"name":"Bar-Ilan University, Ramat-Gan, Israel"}]},{"given":"Nathan S.","family":"Netanyahu","sequence":"additional","affiliation":[{"name":"Bar-Ilan University, Ramat-Gan, Israel"}]}],"member":"320","published-online":{"date-parts":[[2009,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/800179.810240"},{"key":"e_1_3_2_1_2_1","volume-title":"University of Joensuu","author":"Aksenov P.","year":"2004","unstructured":"P. Aksenov . phGenetic algorithms for optimising chess position scoring. M. Sc. Thesis , University of Joensuu , Finland , 2004 . P. Aksenov.phGenetic algorithms for optimising chess position scoring. M. Sc. Thesis, University of Joensuu, Finland, 2004."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"T.S. Anantharaman.Extension heuristics. ICCA Journal 14(2):47--65 1991.  T.S. Anantharaman.Extension heuristics. ICCA Journal 14(2):47--65 1991.","DOI":"10.3233\/ICG-1991-14202"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007634325138"},{"key":"e_1_3_2_1_5_1","first-page":"65","volume-title":"Advances in Computer Chess 5, ed. D.F. Beal","author":"Beal D.F.","year":"1989","unstructured":"D.F. Beal . Experiments with the null move. Advances in Computer Chess 5, ed. D.F. Beal , pages 65 -- 79 . Elsevier Science , Amsterdam , 1989 . D.F. Beal.Experiments with the null move. Advances in Computer Chess 5, ed. D.F. Beal, pages 65--79. Elsevier Science, Amsterdam, 1989."},{"issue":"4","key":"e_1_3_2_1_6_1","first-page":"205","article-title":"Quantification of search extension benefits","volume":"18","author":"Beal D.F.","year":"1995","unstructured":"D.F. Beal and M.C. Smith . Quantification of search extension benefits . ICCA Journal , 18 ( 4 ): 205 -- 218 , 1995 . D.F. Beal and M.C. Smith. Quantification of search extension benefits. ICCA Journal, 18(4):205--218, 1995.","journal-title":"ICCA Journal"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/647480.728100"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00081-5"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(83)90001-2"},{"key":"e_1_3_2_1_10_1","volume-title":"Chess Fundamentals, ed","author":"Capablanca J.R.","year":"2006","unstructured":"J.R. Capablanca . Chess Fundamentals, ed . N. de Firmian, Random House, Revised ed., 2006 . J.R. Capablanca. Chess Fundamentals, ed. N. de Firmian, Random House, Revised ed., 2006."},{"issue":"3","key":"e_1_3_2_1_11_1","first-page":"181","article-title":"An upper bound for the number of reachable positions","volume":"19","author":"Chinchalkar S.","year":"1996","unstructured":"S. Chinchalkar . An upper bound for the number of reachable positions . ICCA Journal , 19 ( 3 ): 181 -- 183 , 1996 . S. Chinchalkar. An upper bound for the number of reachable positions. ICCA Journal, 19(3):181--183, 1996.","journal-title":"ICCA Journal"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389382"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87608-3_19"},{"issue":"3","key":"e_1_3_2_1_14_1","first-page":"137","article-title":"Null move and deep search: Selective search heuristics for obtuse chess programs","volume":"16","author":"Donninger C.","year":"1993","unstructured":"C. Donninger . Null move and deep search: Selective search heuristics for obtuse chess programs . ICCA Journal , 16 ( 3 ): 137 -- 143 , 1993 . C. Donninger. Null move and deep search: Selective search heuristics for obtuse chess programs. ICCA Journal, 16(3):137--143, 1993.","journal-title":"ICCA Journal"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(72)90045-8"},{"key":"e_1_3_2_1_16_1","first-page":"740","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference","author":"Gross R.","year":"2002","unstructured":"R. Gross , K. Albrecht , W. Kantschik , and W. Banzhaf . Evolving chess playing programs . In Proceedings of the Genetic and Evolutionary Computation Conference , pages 740 -- 747 . New York, NY , 2002 . R. Gross, K. Albrecht, W. Kantschik, and W. Banzhaf. Evolving chess playing programs. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 740--747. New York, NY, 2002."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31989-4_11"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1763756.1763765"},{"issue":"2","key":"e_1_3_2_1_19_1","first-page":"75","article-title":"Extended futility pruning","volume":"21","author":"Heinz E.A.","year":"1998","unstructured":"E.A. Heinz . Extended futility pruning . ICCA Journal , 21 ( 2 ): 75 -- 83 , 1998 . E.A. Heinz. Extended futility pruning. ICCA Journal, 21(2):75--83, 1998.","journal-title":"ICCA Journal"},{"key":"e_1_3_2_1_20_1","first-page":"227","volume-title":"Marsland and J. Schaeffer","author":"Hyatt R.M.","year":"1990","unstructured":"R.M. Hyatt , A.E. Gower , and H.L. Nelson . Cray Blitz . Computers, Chess, and Cognition, eds. T.A. Marsland and J. Schaeffer , pages 227 -- 237 . Springer-Verlag , New York , 1990 . R.M. Hyatt, A.E. Gower, and H.L. Nelson. Cray Blitz. Computers, Chess, and Cognition, eds. T.A. Marsland and J. Schaeffer, pages 227--237. Springer-Verlag, New York, 1990."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2001.934299"},{"key":"e_1_3_2_1_22_1","volume-title":"Hash tables in Cray Blitz.phICCA Journal, 8(1):3--13","author":"Nelson H.L.","year":"1985","unstructured":"H.L. Nelson . Hash tables in Cray Blitz.phICCA Journal, 8(1):3--13 , 1985 . H.L. Nelson. Hash tables in Cray Blitz.phICCA Journal, 8(1):3--13, 1985."},{"issue":"4","key":"e_1_3_2_1_23_1","first-page":"4","article-title":"An improvement to the Scout tree-search algorithm","volume":"6","author":"Reinfeld A.","year":"1983","unstructured":"A. Reinfeld . An improvement to the Scout tree-search algorithm . ICCA Journal , 6 ( 4 ): 4 -- 14 , 1983 . A. Reinfeld. An improvement to the Scout tree-search algorithm. ICCA Journal, 6(4):4--14, 1983.","journal-title":"ICCA Journal"},{"issue":"3","key":"e_1_3_2_1_24_1","first-page":"16","article-title":"The history heuristic","volume":"6","author":"Schaeffer J.","year":"1983","unstructured":"J. Schaeffer . The history heuristic . ICCA Journal , 6 ( 3 ): 16 -- 19 , 1983 . J. Schaeffer. The history heuristic. ICCA Journal, 6(3):16--19, 1983.","journal-title":"ICCA Journal"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.42858"},{"key":"e_1_3_2_1_26_1","first-page":"529","volume-title":"Proceedings of the 2001 International Joint Conference on Artificial Intelligence","author":"Schaeffer J.","year":"2001","unstructured":"J. Schaeffer , M. Hlynka , and V. Jussila . Temporal difference learning applied to a high-performance game-playing program . In Proceedings of the 2001 International Joint Conference on Artificial Intelligence , pages 529 -- 534 . Seattle, WA , 2001 . J. Schaeffer, M. Hlynka, and V. Jussila. Temporal difference learning applied to a high-performance game-playing program. In Proceedings of the 2001 International Joint Conference on Artificial Intelligence, pages 529--534. Seattle, WA, 2001."},{"key":"e_1_3_2_1_27_1","first-page":"255","volume-title":"A chess-playing program. Machine Intelligence 4, eds. B. Meltzer and D. Michie","author":"Scott J.J.","year":"1969","unstructured":"J.J. Scott . A chess-playing program. Machine Intelligence 4, eds. B. Meltzer and D. Michie , pages 255 -- 265 . Edinburgh University Press , Edinburgh , 1969 . J.J. Scott. A chess-playing program. Machine Intelligence 4, eds. B. Meltzer and D. Michie, pages 255--265. Edinburgh University Press, Edinburgh, 1969."},{"key":"e_1_3_2_1_28_1","first-page":"82","volume-title":"Chess 4.5 -- The Northwestern University chess program. Chess Skill in Man and Machine, ed. P.W. Frey","author":"Slate D.J.","year":"1983","unstructured":"D.J. Slate and L.R. Atkin . Chess 4.5 -- The Northwestern University chess program. Chess Skill in Man and Machine, ed. P.W. Frey , pages 82 -- 118 . Springer-Verlag , New York , 2 nd ed., 1983 . D.J. Slate and L.R. Atkin. Chess 4.5 -- The Northwestern University chess program. Chess Skill in Man and Machine, ed. P.W. Frey, pages 82--118. Springer-Verlag, New York, 2nd ed., 1983.","edition":"2"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/551283"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00992697"},{"issue":"3","key":"e_1_3_2_1_31_1","first-page":"119","article-title":"Genetic algorithms optimising evaluation functions","volume":"14","author":"Tunstall-Pedoe W.","year":"1991","unstructured":"W. Tunstall-Pedoe . Genetic algorithms optimising evaluation functions . ICCA Journal , 14 ( 3 ): 119 -- 128 , 1991 . W. Tunstall-Pedoe. Genetic algorithms optimising evaluation functions. ICCA Journal, 14(3):119--128, 1991.","journal-title":"ICCA Journal"},{"key":"e_1_3_2_1_32_1","volume-title":"University of Amsterdam","author":"Wiering M.A.","year":"1995","unstructured":"M.A. Wiering . TD learning of game evaluation functions with hierarchical neural architectures. Master's Thesis , University of Amsterdam , 1995 . M.A. Wiering. TD learning of game evaluation functions with hierarchical neural architectures. Master's Thesis, University of Amsterdam, 1995."}],"event":{"name":"GECCO09: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Montreal Qu\u00e9bec Canada","acronym":"GECCO09"},"container-title":["Proceedings of the 11th Annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1569901.1570100","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1569901.1570100","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:17:58Z","timestamp":1750249078000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1569901.1570100"}},"subtitle":["evolution and coevolution of evaluation functions"],"short-title":[],"issued":{"date-parts":[[2009,7,8]]},"references-count":32,"alternative-id":["10.1145\/1569901.1570100","10.1145\/1569901"],"URL":"https:\/\/doi.org\/10.1145\/1569901.1570100","relation":{},"subject":[],"published":{"date-parts":[[2009,7,8]]},"assertion":[{"value":"2009-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}