{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:01:55Z","timestamp":1725512515958},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540716020"},{"type":"electronic","value":"9783540716051"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-71605-1_8","type":"book-chapter","created":{"date-parts":[[2007,6,19]],"date-time":"2007-06-19T23:36:48Z","timestamp":1182296208000},"page":"78-89","source":"Crossref","is-referenced-by-count":23,"title":["Evolution of an Efficient Search Algorithm for the Mate-In-N Problem in Chess"],"prefix":"10.1007","author":[{"given":"Ami","family":"Hauptman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moshe","family":"Sipper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0004-3702(94)90004-3","volume":"66","author":"L.V. Allis","year":"1994","unstructured":"Allis, L.V., van der Meulen, M., van den Herik, H.J.: Proof-number search. Artificial Intelligence\u00a066, 91\u2013124 (1994)","journal-title":"Artificial Intelligence"},{"issue":"4","key":"8_CR2","first-page":"227","volume":"19","author":"D.F. Beal","year":"1996","unstructured":"Beal, D.F., Smith, M.C.: Multiple probes of transposition tables. ICCA Journal\u00a019(4), 227\u2013233 (1996)","journal-title":"ICCA Journal"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.tcs.2005.09.043","volume":"349","author":"M.S. Bourzutschky","year":"2005","unstructured":"Bourzutschky, M.S., Tamplin, J.A., Haworth, G.M.: Chess endgames: 6-man data and strategy. Theoretical Computer Science\u00a0349, 140\u2013157 (2005)","journal-title":"Theoretical Computer Science"},{"key":"8_CR4","first-page":"203","volume-title":"Advances in Genetic Programming 2","author":"S. Brave","year":"1996","unstructured":"Brave, S.: Evolving recursive programs for tree search. In: Angeline, P.J., Kinnear Jr., K.E. (eds.) Advances in Genetic Programming 2, pp. 203\u2013220. MIT Press, Cambridge (1996)"},{"issue":"1\u20132","key":"8_CR5","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0004-3702(01)00129-1","volume":"134","author":"M. Campbell","year":"2002","unstructured":"Campbell, M., Hoane Jr., A.J., Hsu, F.-H.: Deep blue. Artificial Intelligence\u00a0134(1\u20132), 57\u201383 (2002)","journal-title":"Artificial Intelligence"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/S0364-0213(03)00032-6","volume":"27","author":"C.F. Chabris","year":"2003","unstructured":"Chabris, C.F., Hearst, E.S.: Visualization, pattern recognition, and forward search: Effects of playing speed and sight of the position on grandmaster chess errors. Cognitive Science\u00a027, 637\u2013648 (2003)","journal-title":"Cognitive Science"},{"key":"8_CR7","first-page":"740","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference","author":"R. Gross","year":"2002","unstructured":"Gross, R., Albrecht, K., Kantschik, W., Banzhaf, W.: Evolving chess playing programs. In: Langdon, W.B., Cant\u00fa-Paz, E., Mathias, K., Roy, R., Davis, D., Poli, R., Balakrishnan, K., Honavar, V., Rudolph, G., Wegener, J., Bull, L., Potter, M.A., Schultz, A.C., Miller, J.F., Burke, E., Jonoska, N. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference. GECCO 2002, New York, 9-13 July 2002, pp. 740\u2013747. Morgan Kaufmann Publishers, Seattle (2002)"},{"key":"8_CR8","unstructured":"Hauptman, A., Sipper, M.: Analyzing the intelligence of a genetically programmed chess player. In: Late Breaking Papers at the Genetic and Evolutionary Computation Conference 2005, Washington, DC (June 2005)"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.I., Tomassini, M. (eds.) EuroGP 2005. LNCS, vol.\u00a03447, pp. 120\u2013131. Springer, Heidelberg (2005)"},{"issue":"3","key":"8_CR10","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1162\/106365601750406046","volume":"9","author":"T.-P. Hong","year":"2001","unstructured":"Hong, T.-P., Huang, K.-Y., Lin, W.-Y.: Adversarial search by evolutionary computation. Evolutionary Computation\u00a09(3), 371\u2013385 (2001)","journal-title":"Evolutionary Computation"},{"issue":"3-4","key":"8_CR11","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s005000100154","volume":"6","author":"T.-P. Hong","year":"2002","unstructured":"Hong, T.-P., Huang, K.-Y., Lin, W.-Y.: Applying genetic algorithms to game search trees. Soft Comput.\u00a06(3-4), 277\u2013283 (2002)","journal-title":"Soft Comput."},{"key":"8_CR12","first-page":"124","volume":"80","author":"H. Kaindl","year":"1982","unstructured":"Kaindl, H.: Quiescence search in computer chess (Reprint in Computer Game-Playing: Theory and Practice, Ellis Horwood, Chichester, 1983). ACM SIGART Bulletin\u00a080, 124\u2013131 (1982)","journal-title":"ACM SIGART Bulletin"},{"key":"8_CR13","volume-title":"Genetic Programming II: Automatic Discovery of Reusable Programs","author":"J.R. Koza","year":"1994","unstructured":"Koza, J.R.: Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press, Cambridge (May 1994)"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1145\/800175.809846","volume-title":"Proceedings of the ACM National Conference","author":"T.A. Marsland","year":"1981","unstructured":"Marsland, T.A., Campbell, M.S.: A survey of enhancements to the alpha-beta algorithm. In: Proceedings of the ACM National Conference, November 1981, pp. 109\u2013114. ACM Press, New York (1981)"},{"issue":"1-4","key":"8_CR15","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1023\/A:1018939819265","volume":"28","author":"M. Newborn","year":"2000","unstructured":"Newborn, M.: Deep blue\u2019s contribution to AI. Ann. Math. Artif. Intell.\u00a028(1-4), 27\u201330 (2000)","journal-title":"Ann. Math. Artif. Intell."},{"key":"8_CR16","unstructured":"Polgar, L.: Chess : 5334 Problems, Combinations, and Games. Black Dog and Leventhal Publishers (1995)"},{"key":"8_CR17","volume-title":"Artificial Intelligence: A Modern Approach","author":"S.J. Russell","year":"1995","unstructured":"Russell, S.J., Norvig, P.: Artificial Intelligence: A Modern Approach. Prentice-Hall, Englewood Cliffs (1995)"}],"container-title":["Lecture Notes in Computer Science","Genetic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71605-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:38:45Z","timestamp":1558273125000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71605-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540716020","9783540716051"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71605-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}