{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:15:12Z","timestamp":1725495312392},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540430803"},{"type":"electronic","value":"9783540455790"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45579-5_8","type":"book-chapter","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T17:52:18Z","timestamp":1195235538000},"page":"115-132","source":"Crossref","is-referenced-by-count":2,"title":["Learning from Perfection"],"prefix":"10.1007","author":[{"given":"Jack","family":"van Rijswijck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,12,20]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Michael Buro. From simple features to sophisticated evaluation functions. In Computers and Games\u2019 98, pages 126\u2013145. Springer, 1998.","DOI":"10.1007\/3-540-48957-6_8"},{"issue":"1","key":"8_CR2","first-page":"3","volume":"10","author":"D. Michie","year":"1987","unstructured":"Donald Michie and Ivan Bratko. Ideas on Knowledge Synthesis stemming from the KBBKN Endgame. Journal of the International Computer Chess Association, 10(1):3\u201313, 1987.","journal-title":"Journal of the International Computer Chess Association"},{"key":"8_CR3","unstructured":"John Nunn. Secrets of Rook Endings. Batsford, 1992."},{"issue":"4","key":"8_CR4","first-page":"191","volume":"16","author":"J. Nunn","year":"1993","unstructured":"John Nunn. Extracting Information from Endgame Databases. Journal of the International Computer Chess Association, 16(4):191\u2013200, 1993.","journal-title":"Journal of the International Computer Chess Association"},{"key":"8_CR5","unstructured":"John Nunn. Secrets of Pawnless Endings. Batsford, 1994."},{"key":"8_CR6","unstructured":"John Nunn. Secrets of Minor Piece Endings. Batsford, 1995."},{"key":"8_CR7","series-title":"Technical Report","volume-title":"Department of Computer Science","author":"P. E. Utgoff","year":"1997","unstructured":"Paul E. Utgoff and Doina Precup. Constructive Function Approximation. Technical Report 97-04, Department of Computer Science, University of Massachusetts, Amherst, MA, 1997."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Paul E. Utgoff and Doina Precup. Constructive Function Approximation. In H. Liu and H. Motoda, editors, Feature Extraction, Construction and Selection: A Data Mining Perspective, volume 453 of The Kluwer International Series in Engineering and Computer Science, Chapter 14. Kluwer Academic Publishers, 1998.","DOI":"10.1007\/978-1-4615-5725-8_14"},{"key":"8_CR9","unstructured":"Terry van Belle. A New Approach to Genetic-Based Automatic Feature Discovery. Master\u2019s thesis, University of Alberta, 1995."}],"container-title":["Lecture Notes in Computer Science","Computers and Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45579-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T15:34:05Z","timestamp":1556984045000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45579-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430803","9783540455790"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-45579-5_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}