{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T20:10:35Z","timestamp":1739909435079,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,2,24]],"date-time":"2010-02-24T00:00:00Z","timestamp":1266969600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Genet Program Evolvable Mach"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s10710-010-9103-4","type":"journal-article","created":{"date-parts":[[2010,2,23]],"date-time":"2010-02-23T11:23:25Z","timestamp":1266924205000},"page":"5-22","source":"Crossref","is-referenced-by-count":9,"title":["Expert-driven genetic algorithms for simulating evaluation functions"],"prefix":"10.1007","volume":"12","author":[{"given":"Omid","family":"David-Tabibi","sequence":"first","affiliation":[]},{"given":"Moshe","family":"Koppel","sequence":"additional","affiliation":[]},{"given":"Nathan S.","family":"Netanyahu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,2,24]]},"reference":[{"key":"9103_CR1","doi-asserted-by":"crossref","unstructured":"S.G. Akl, M.M. Newborn, The principal continuation and the killer heuristic. in Proceedings of the 5th Annual ACM Computer Science Conference (ACM Press, Seattle, WA, 1977), pp. 466\u2013473","DOI":"10.1145\/800179.810240"},{"key":"9103_CR2","unstructured":"P. Aksenov, Genetic Algorithms for Optimising Chess Position Scoring. Master\u2019s Thesis, University of Joensuu, Finland (2004)"},{"issue":"2","key":"9103_CR3","first-page":"47","volume":"14","author":"T.S. Anantharaman","year":"1991","unstructured":"T.S. Anantharaman, Extension heuristics. ICCA J. 14(2), 47\u201365 (1991)","journal-title":"ICCA J."},{"issue":"3","key":"9103_CR4","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1023\/A:1007634325138","volume":"40","author":"J. Baxter","year":"2000","unstructured":"J. Baxter, A. Tridgell, L. Weaver, Learning to play chess using temporal-differences. Mach. Learn. 40(3), 243\u2013263 (2000)","journal-title":"Mach. Learn."},{"key":"9103_CR5","unstructured":"D.F. Beal, Experiments with the null move. Advances in Computer Chess 5, in ed. by D.F. Beal (Elsevier Science, Amsterdam, 1989), pp. 65\u201379"},{"issue":"4","key":"9103_CR6","first-page":"205","volume":"18","author":"D.F. Beal","year":"1995","unstructured":"D.F. Beal, M.C. Smith, Quantification of search extension benefits. ICCA J. 18(4), 205\u2013218 (1995)","journal-title":"ICCA J."},{"key":"9103_CR7","unstructured":"Y. Bj\u00f6rnsson, T.A. Marsland, Multi-cut pruning in alpha-beta search. in Proceedings of the First International Conference on Computers and Games, Tsukuba, Japan (1998), pp. 15\u201324"},{"issue":"1-2","key":"9103_CR8","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0304-3975(00)00081-5","volume":"252","author":"Y. Bj\u00f6rnsson","year":"2001","unstructured":"Y. Bj\u00f6rnsson, T.A. Marsland, Multi-cut alpha-beta-pruning in game-tree search. Theor. Comput. Sci. 252(1\u20132), 177\u2013196 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"9103_CR9","first-page":"31","volume":"35","author":"M. Block","year":"2008","unstructured":"M. Block, M. Bader, E. Tapia, M. Ramirez, K. Gunnarsson, E. Cuevas, D. Zaldivar, R. Rojas, Using reinforcement learning in chess engines, Res. Comput. Sci. 35, 31\u201340 (2008)","journal-title":"Res. Comput. Sci."},{"issue":"4","key":"9103_CR10","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0004-3702(83)90001-2","volume":"20","author":"M.S. Campbell","year":"1983","unstructured":"M.S. Campbell, T.A. Marsland, A comparison of minimax tree search algorithms. Artif. Intell. 20(4), 347\u2013367 (1983)","journal-title":"Artif. Intell."},{"issue":"3","key":"9103_CR11","first-page":"181","volume":"19","author":"S. Chinchalkar","year":"1996","unstructured":"S. Chinchalkar, An upper bound for the number of reachable positions. ICCA J. 19(3), 181\u2013183 (1996)","journal-title":"ICCA J."},{"key":"9103_CR12","doi-asserted-by":"crossref","unstructured":"O. David-Tabibi, A. Felner, N.S. Netanyahu, Blockage detection in pawn endings. in Proceedings of the 2004 International Conference on Computers and Games, eds. by H.J. van den Herik, Y. Bj\u00f6rnsson, N.S. Netanyahu (Springer (LNCS 3846), Ramat-Gan, Israel, 2006), pp. 187\u2013201","DOI":"10.1007\/11674399_13"},{"key":"9103_CR13","doi-asserted-by":"crossref","unstructured":"O. David-Tabibi, M. Koppel, N.S. Netanyahu, Genetic algorithms for mentor-assisted evaluation function optimization. in Proceedings of the Genetic and Evolutionary Computation Conference (Atlanta, GA, 2008), pp. 1469\u20131476","DOI":"10.1145\/1389095.1389382"},{"key":"9103_CR14","doi-asserted-by":"crossref","unstructured":"O. David-Tabibi, N.S. Netanyahu, Extended null-move reductions. in Proceedings of the 2008 International Conference on Computers and Games, eds. by H.J. van den Herik, X. Xu, Z. Ma, M.H.M. Winands (Springer (LNCS 5131), Beijing, China, 2008), pp. 205\u2013216","DOI":"10.1007\/978-3-540-87608-3_19"},{"issue":"3","key":"9103_CR15","first-page":"137","volume":"16","author":"C. Donninger","year":"1993","unstructured":"C. Donninger, Null move and deep search: Selective search heuristics for obtuse chess programs. ICCA J. 16(3), 137\u2013143 (1993)","journal-title":"ICCA J."},{"issue":"1-3","key":"9103_CR16","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0004-3702(72)90045-8","volume":"3","author":"J.J. Gillogly","year":"1972","unstructured":"J.J. Gillogly, The technology chess program. Artif. Intell. 3(1\u20133), 145\u2013163 (1972)","journal-title":"Artif. Intell."},{"key":"9103_CR17","unstructured":"R. Gross, K. Albrecht, W. Kantschik, W. Banzhaf, Evolving chess playing programs. in Proceedings of the Genetic and Evolutionary Computation Conference (New York, NY, 2002), pp. 740\u2013747"},{"key":"9103_CR18","doi-asserted-by":"crossref","unstructured":"A. Hauptman, M. Sipper, Using genetic programming to evolve chess endgame players. in Proceedings of the 2005 European Conference on Genetic Programming (Springer, Lausanne, Switzerland, 2005), pp. 120\u2013131","DOI":"10.1007\/978-3-540-31989-4_11"},{"key":"9103_CR19","doi-asserted-by":"crossref","unstructured":"A. Hauptman, M. Sipper, Evolution of an efficient search algorithm for the Mate-in-N problem in chess. in Proceedings of the 2007 European Conference on Genetic Programming (Springer, Valencia, Spain, 2007), pp. 78\u201389","DOI":"10.1007\/978-3-540-71605-1_8"},{"issue":"2","key":"9103_CR20","first-page":"75","volume":"21","author":"E.A. Heinz","year":"1998","unstructured":"E.A. Heinz, Extended futility pruning. ICCA J. 21(2), 75\u201383 (1998)","journal-title":"ICCA J."},{"key":"9103_CR21","first-page":"227","volume-title":"Cray Blitz. Computers, chess, and cognition","author":"R.M. Hyatt","year":"1990","unstructured":"R.M. Hyatt, A.E. Gower, H.L. Nelson. Cray Blitz. Computers, chess, and cognition, in eds. T.A. Marsland, J. Schaeffer (Springer, New York, 1990), pp. 227\u2013237"},{"key":"9103_CR22","doi-asserted-by":"crossref","unstructured":"G. Kendall, G. Whitwell, An evolutionary approach for the tuning of a chess evaluation function using population dynamics. in Proceedings of the 2001 Congress on Evolutionary Computation. (IEEE Press, World Trade Center, Seoul, Korea, 2001), pp. 995\u20131002","DOI":"10.1109\/CEC.2001.934299"},{"key":"9103_CR23","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/978-1-4613-9080-0_14","volume-title":"Chess as the Drosophila of AI. Computers, chess, and cognition","author":"J. McCarthy","year":"1990","unstructured":"J. McCarthy, Chess as the Drosophila of AI. Computers, chess, and cognition, eds. T.A. Marsland, J. Schaeffer (Springer, New York, 1990), pp. 227\u2013237"},{"issue":"1","key":"9103_CR24","first-page":"3","volume":"8","author":"H.L. Nelson","year":"1985","unstructured":"H.L. Nelson. Hash tables in Cray Blitz. ICCA J. 8(1), 3\u201313 (1985)","journal-title":"ICCA J."},{"issue":"4","key":"9103_CR25","first-page":"4","volume":"6","author":"A. Reinfeld","year":"1983","unstructured":"A. Reinfeld, An improvement to the Scout tree-search algorithm. ICCA J. 6(4), 4\u201314 (1983)","journal-title":"ICCA J."},{"issue":"3","key":"9103_CR26","first-page":"16","volume":"6","author":"J. Schaeffer","year":"1983","unstructured":"J. Schaeffer, The history heuristic. ICCA J. 6(3), 16\u201319 (1983)","journal-title":"ICCA J."},{"issue":"11","key":"9103_CR27","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1109\/34.42858","volume":"11","author":"J. Schaeffer","year":"1989","unstructured":"J. Schaeffer, The history heuristic and alpha-beta search enhancements in practice. IEEE Trans. Pattern. Anal. Mach. Intell. 11(11), 1203\u20131212 (1989)","journal-title":"IEEE Trans. Pattern. Anal. Mach. Intell."},{"key":"9103_CR28","unstructured":"J. Schaeffer, M. Hlynka, V. Jussila, Temporal difference learning applied to a high-performance game-playing program. in Proceedings of the 2001 International Joint Conference on Artificial Intelligence (Seattle, WA, 2001), pp. 529\u2013534"},{"key":"9103_CR29","first-page":"255","volume-title":"A chess-playing program, in machine intelligence 4.","author":"J.J. Scott","year":"1969","unstructured":"J.J. Scott. A chess-playing program, in machine intelligence 4, eds. B. Meltzer, D. Michie (Edinburgh University Press, Edinburgh, 1969), pp. 255\u2013265"},{"key":"9103_CR30","doi-asserted-by":"crossref","unstructured":"D.J. Slate, L.R. Atkin, Chess 4.5\u2014The Northwestern University chess program. Chess skill in man and machine, ed. by P.W. Frey (Springer, New York, 2nd ed, 1983), pp. 82\u2013118","DOI":"10.1007\/978-1-4612-5515-4_4"},{"key":"9103_CR31","volume-title":"Reinforcement learning: An introduction","author":"R.S. Sutton","year":"1998","unstructured":"R.S. Sutton, A.G. Barto. Reinforcement learning: an introduction (MIT Press, Cambridge, MA, 1998)"},{"issue":"3\u20134","key":"9103_CR32","first-page":"257","volume":"8","author":"G. Tesauro","year":"1992","unstructured":"G. Tesauro, Practical issues in temporal difference learning. Mach. Learn. 8(3\u20134), 257\u2013277 (1992)","journal-title":"Mach. Learn."},{"issue":"3","key":"9103_CR33","first-page":"119","volume":"14","author":"W. Tunstall-Pedoe","year":"1991","unstructured":"W. Tunstall-Pedoe (1991) Genetic algorithms optimising evaluation functions. ICCA J. 14(3), 119\u2013128 (1991)","journal-title":"ICCA J."},{"key":"9103_CR34","unstructured":"M.A. Wiering, TD Learning of Game Evaluation Functions with Hierarchical Neural Architectures. Master\u2019s Thesis, University of Amsterdam (1995)"}],"container-title":["Genetic Programming and Evolvable Machines"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-010-9103-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10710-010-9103-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-010-9103-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T19:34:34Z","timestamp":1739907274000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10710-010-9103-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,24]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["9103"],"URL":"https:\/\/doi.org\/10.1007\/s10710-010-9103-4","relation":{},"ISSN":["1389-2576","1573-7632"],"issn-type":[{"type":"print","value":"1389-2576"},{"type":"electronic","value":"1573-7632"}],"subject":[],"published":{"date-parts":[[2010,2,24]]}}}