{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:30:46Z","timestamp":1762101046254},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642129926"},{"type":"electronic","value":"9783642129933"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12993-3_17","type":"book-chapter","created":{"date-parts":[[2010,5,4]],"date-time":"2010-05-04T08:43:37Z","timestamp":1272962617000},"page":"182-194","source":"Crossref","is-referenced-by-count":6,"title":["Automated Discovery of Search-Extension Features"],"prefix":"10.1007","author":[{"given":"P\u00e1lmi","family":"Skowronski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yngvi","family":"Bj\u00f6rnsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark H. M.","family":"Winands","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(90)90073-9","volume":"43","author":"T.S. Anantharaman","year":"1990","unstructured":"Anantharaman, T.S., Campbell, M.S., Hsu, F.: Singular extensions: adding selectivity to brute-force searching. Artificial Intelligence\u00a043(1), 99\u2013109 (1990)","journal-title":"Artificial Intelligence"},{"issue":"4","key":"17_CR2","first-page":"205","volume":"8","author":"D.F. Beal","year":"1995","unstructured":"Beal, D.F., Smith, M.C.: Quantification of search extension benefits. ICCA Journal\u00a08(4), 205\u2013218 (1995)","journal-title":"ICCA Journal"},{"key":"17_CR3","unstructured":"Hyatt, R.M.: Crafty. A chess program (1996) (March 27, 2008), ftp:\/\/ftp.cis.uab.edu\/pub\/hyatt"},{"issue":"1","key":"17_CR4","first-page":"10","volume":"12","author":"D. Levy","year":"1989","unstructured":"Levy, D., Broughton, D., Taylor, M.: The SEX algorithm in computer chess. ICCA Journal\u00a012(1), 10\u201321 (1989)","journal-title":"ICCA Journal"},{"issue":"3","key":"17_CR5","doi-asserted-by":"crossref","first-page":"146","DOI":"10.3233\/ICG-2002-25304","volume":"25","author":"Y. Tsuruoka","year":"2002","unstructured":"Tsuruoka, Y., Yokoyama, D., Chikayama, T.: Game-tree search algorithm based on realization probability. ICGA Journal\u00a025(3), 146\u2013153 (2002)","journal-title":"ICGA Journal"},{"issue":"3","key":"17_CR6","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1142\/S1793005708001070","volume":"4","author":"M.H.M. Winands","year":"2008","unstructured":"Winands, M.H.M., Bj\u00f6rnsson, Y.: Enhanced realization probability search. New Mathematics and Natural Computation\u00a04(3), 329\u2013342 (2008)","journal-title":"New Mathematics and Natural Computation"},{"key":"17_CR7","unstructured":"Bj\u00f6rnsson, Y.: Selective Depth-First Game-Tree Search. Phd dissertation, University of Alberta (2002)"},{"issue":"3-4","key":"17_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0020-0255(03)00045-8","volume":"154","author":"Y. Bj\u00f6rnsson","year":"2003","unstructured":"Bj\u00f6rnsson, Y., Marsland, T.A.: Learning extension parameters in game-tree search. Information Sciences\u00a0154(3-4), 95\u2013118 (2003)","journal-title":"Information Sciences"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/11922155_4","volume-title":"Advances in Computer Games","author":"L. Kocsis","year":"2006","unstructured":"Kocsis, L., Szepesv\u00e1ri, C., Winands, M.H.M.: RSPSA: Enhanced Parameter Optimization in Games. In: van den Herik, H.J., Hsu, S.-C., Hsu, T.-s., Donkers, H.H.L.M(J.) (eds.) CG 2005. LNCS, vol.\u00a04250, pp. 39\u201356. Springer, Heidelberg (2006)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Fawcett, T.E., Utgoff, P.E.: Automatic feature generation for problem solving systems. In: Intern. Conf. on Machine Learning (ICML), pp. 144\u2013153 (1992)","DOI":"10.1016\/B978-1-55860-247-2.50024-3"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Kaneko, T., Yamaguchi, K., Kawai, S.: Automated identification of patterns in evaluation functions. In: Advances in Computer Games, vol.\u00a010, pp. 279\u2013298 (2003)","DOI":"10.1007\/978-0-387-35706-5_18"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-48957-6_8","volume-title":"Computers and Games","author":"M. Buro","year":"1999","unstructured":"Buro, M.: From simple features to sophisticated evaluation functions. In: van den Herik, H.J., Iida, H. (eds.) CG 1998. LNCS, vol.\u00a01558, pp. 126\u2013145. Springer, Heidelberg (1999)"},{"key":"17_CR13","unstructured":"Buro, M.: Experiments with Multi-ProbCut and a new high-quality evaluation function for Othello. In: Games in AI Research, pp. 77\u201396 (1999)"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-540-75538-8_11","volume-title":"Computers and Games","author":"N.R. Sturtevant","year":"2007","unstructured":"Sturtevant, N.R., White, A.M.: Feature construction for reinforcement learning in hearts. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M(J.) (eds.) CG 2006. LNCS, vol.\u00a04630, pp. 122\u2013134. Springer, Heidelberg (2007)"},{"issue":"2","key":"17_CR15","first-page":"100","volume":"21","author":"L. Finkelstein","year":"1998","unstructured":"Finkelstein, L., Markovitch, S.: Learning to play chess selectively by acquiring move patterns. ICCA Journal\u00a021(2), 100\u2013119 (1998)","journal-title":"ICCA Journal"},{"key":"17_CR16","unstructured":"Handscomb, K.: 8\u00d78 game design competition: The winning game: Breakthrough ... and two other favorites. Abstract Games Magazine\u00a07 (2001)"}],"container-title":["Lecture Notes in Computer Science","Advances in Computer Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12993-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T19:09:13Z","timestamp":1559070553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12993-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642129926","9783642129933"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12993-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}