{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:26:11Z","timestamp":1725564371972},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540205456"},{"type":"electronic","value":"9783540400318"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-40031-8_17","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:03:50Z","timestamp":1283727830000},"page":"249-263","source":"Crossref","is-referenced-by-count":2,"title":["Position-Value Representation in Opening Books"],"prefix":"10.1007","author":[{"given":"Thomas R.","family":"Lincke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0004-3702(79)90003-1","volume":"12","author":"H. Berliner","year":"1979","unstructured":"Berliner, H.: The B* tree search algorithm: A best-first proof procedure. Artificial Intelligence\u00a012, 23\u201340 (1979)","journal-title":"Artificial Intelligence"},{"key":"17_CR2","first-page":"98","volume":"22","author":"M. Buro","year":"1999","unstructured":"Buro, M.: Toward Opening Book Learning. International Computer Chess Association Journal\u00a022, 98\u2013102 (1999)","journal-title":"International Computer Chess Association Journal"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/3-540-45579-5_5","volume-title":"Computers and Games","author":"T. Lincke","year":"2002","unstructured":"Lincke, T.: Strategies for the automatic construction of opening books. In: Marsland, T., Frank, I. (eds.) CG 2001. LNCS, vol.\u00a02063, pp. 74\u201386. Springer, Heidelberg (2002)"},{"key":"17_CR4","first-page":"10","volume":"7","author":"D.F. Beal","year":"1984","unstructured":"Beal, D.F.: Mixing heuristic and perfect evaluations: Nested minimax. International Computer Chess Association Journal\u00a07, 10\u201315 (1984)","journal-title":"International Computer Chess Association Journal"},{"key":"17_CR5","series-title":"Cambridge Studies in Advanced Mathematics","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511805967","volume-title":"Enumerative Combinatorics","author":"R. Stanley","year":"1997","unstructured":"Stanley, R.: Enumerative Combinatorics. Cambridge Studies in Advanced Mathematics, vol.\u00a01(49). Cambridge University Press, Cambridge (1997)"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-48957-6_3","volume-title":"Computers and Games","author":"D. Breuker","year":"1999","unstructured":"Breuker, D., van den Herik, J., Uiterwijk, J., Allis, V.: A solution to the GHI problem for best-first search. In: van den Herik, H.J., Iida, H. (eds.) CG 1998. LNCS, vol.\u00a01558, pp. 25\u201349. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Computers and Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-40031-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T02:09:28Z","timestamp":1553047768000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-40031-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540205456","9783540400318"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-40031-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}