{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:26:13Z","timestamp":1725564373073},"publisher-location":"Berlin, Heidelberg","reference-count":14,"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_11","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T19:03:50Z","timestamp":1283713430000},"page":"154-170","source":"Crossref","is-referenced-by-count":1,"title":["The Neural MoveMap Heuristic in Chess"],"prefix":"10.1007","author":[{"given":"Levente","family":"Kocsis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos W. H. M.","family":"Uiterwijk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Postma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaap","family":"van den Herik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","first-page":"3","volume":"9","author":"T. Marsland","year":"1986","unstructured":"Marsland, T.: A review of game-tree pruning. International Computer Chess Association Journal\u00a09, 3\u201319 (1986)","journal-title":"International Computer Chess Association Journal"},{"key":"11_CR2","first-page":"16","volume":"6","author":"J. Schaeffer","year":"1983","unstructured":"Schaeffer, J.: The history heuristic. International Computer Chess Association Journal\u00a06, 16\u201319 (1983)","journal-title":"International Computer Chess Association Journal"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/S0004-3702(00)00026-6","volume":"120","author":"K. Greer","year":"2000","unstructured":"Greer, K.: Computer chess move-ordering schemes using move influence. Artificial Intelligence\u00a0120, 235\u2013250 (2000)","journal-title":"Artificial Intelligence"},{"key":"11_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-45517-5_6","volume-title":"Engineering of Intelligent Systems","author":"L. Kocsis","year":"2001","unstructured":"Kocsis, L., Uiterwijk, J., van den Herik, J.: Move ordering using neural networks. In: Monostori, L., V\u00e1ncza, J., Ali, M. (eds.) IEA\/AIE 2001. LNCS (LNAI), vol.\u00a02070, pp. 45\u201350. Springer, Heidelberg (2001)"},{"key":"11_CR5","first-page":"99","volume-title":"Advances in Neural Information Processing Systems 1","author":"G. Tesauro","year":"1989","unstructured":"Tesauro, G.: Connectionist learning of expert preferences by comparison training. In: Touretzky, D. (ed.) Advances in Neural Information Processing Systems 1, pp. 99\u2013106. Morgan Kaufmann, San Francisco (1989)"},{"key":"11_CR6","first-page":"596","volume-title":"Ninth National Conference of the American Association for Artificial Intelligence (AAAI 1991)","author":"P. Utgoff","year":"1991","unstructured":"Utgoff, P., Clouse, J.: Two kinds of training information for evaluation function learning. In: Ninth National Conference of the American Association for Artificial Intelligence (AAAI 1991), pp. 596\u2013600. AAAI Press, Menlo Park (1991)"},{"key":"11_CR7","unstructured":"Enderton, H.: The Golem Go program. Technical Report CMU-CS-92-101, School of Computer Science, Carnegie-Mellon University (1991)"},{"key":"11_CR8","first-page":"3","volume":"24","author":"M. Winands","year":"2001","unstructured":"Winands, M., Uiterwijk, J., van den Herik, J.: The quad heuristic in Lines of Action. International Computer Games Association Journal\u00a024, 3\u201315 (2001)","journal-title":"International Computer Games Association Journal"},{"key":"11_CR9","unstructured":"Winands, M.: Personal communication (2002)"},{"key":"11_CR10","first-page":"79","volume":"20","author":"R. Hyatt","year":"1997","unstructured":"Hyatt, R., Newborn, M.: Crafty goes deep. International Computer Chess Association Journal\u00a020, 79\u201386 (1997)","journal-title":"International Computer Chess Association Journal"},{"key":"11_CR11","unstructured":"Matanovi\u0107, A. (ed.): Encyclopaedia of Chess Openings. Volume A\u2013E. Chess Informant (2003)"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Riedmiller, M., Braun, H.: A direct adaptive method for faster backpropagation learning: The RPROP algorithm. In: IEEE International Conference on Neural Networks, pp. 586\u2013591 (1993)","DOI":"10.1109\/ICNN.1993.298623"},{"key":"11_CR13","unstructured":"Kocsis, L., Uiterwijk, J., van den Herik, J.: Search-independent forward pruning. In: Belgium-Netherlands Conference on Artificial Intelligence, pp. 159\u2013166 (2001)"},{"key":"11_CR14","unstructured":"Bj\u00f6rnsson, Y., Marsland, T.: Learning search control in adversary games. In: van den Herik, J., Monien, B. (eds.) Advances in Computer Games 9, Universiteit Maastricht, pp. 157\u2013174 (2001)"}],"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_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T22:26:24Z","timestamp":1553034384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-40031-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540205456","9783540400318"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-40031-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}