{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,15]],"date-time":"2024-01-15T17:17:45Z","timestamp":1705339065412},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2000,1]]},"DOI":"10.1016\/s0020-0255(99)00093-6","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"3-21","source":"Crossref","is-referenced-by-count":10,"title":["Temporal difference learning for heuristic search and game playing"],"prefix":"10.1016","volume":"122","author":[{"given":"D.F.","family":"Beal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.C.","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0255(99)00093-6_BIB1","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF00115009","article-title":"Learning to predict by the methods of temporal differences","volume":"3","author":"Sutton","year":"1988","journal-title":"Machine Learning"},{"key":"10.1016\/S0020-0255(99)00093-6_BIB2","unstructured":"D.F. Beal, M.C. Smith, Temporal coherence and prediction decay in temporal difference learning, Technical Report no. 756, Department of Computer Science, Queen Mary and Westfield College, University of London, 1998"},{"issue":"3","key":"10.1016\/S0020-0255(99)00093-6_BIB3","first-page":"147","article-title":"Machine learning in computer chess: the next generation","volume":"19","author":"F\u00fcrnkranz","year":"1996","journal-title":"International Computer Chess Association Journal"},{"issue":"4","key":"10.1016\/S0020-0255(99)00093-6_BIB4","first-page":"224","article-title":"Evaluation tuning for computer chess: linear discriminant methods","volume":"20","author":"Anantharaman","year":"1997","journal-title":"International Computer Chess Association Journal"},{"key":"10.1016\/S0020-0255(99)00093-6_BIB5","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF00992697","article-title":"Practical issues in temporal difference learning","volume":"8","author":"Tesauro","year":"1992","journal-title":"Machine Learning"},{"issue":"2","key":"10.1016\/S0020-0255(99)00093-6_BIB6","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1162\/neco.1994.6.2.215","article-title":"TD-Gammon, a self-teaching backgammon program, achieves master level play","volume":"6","author":"Tesauro","year":"1994","journal-title":"Neural Computation"},{"key":"10.1016\/S0020-0255(99)00093-6_BIB7","unstructured":"R.S. Sutton, S.P. Singh, On step-size and bias in temporal-difference learning, in: Proceedings of the Eighth Yale Workshop on Adaptive and Learning Systems, 1994, pp. 91\u201396"},{"key":"10.1016\/S0020-0255(99)00093-6_BIB8","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF00992701","article-title":"The convergence of TD (\u03bb) for general \u03bb","volume":"8","author":"Dayan","year":"1992","journal-title":"Machine Learning"},{"issue":"3","key":"10.1016\/S0020-0255(99)00093-6_BIB9","first-page":"147","article-title":"Learning piece values using temporal differences","volume":"20","author":"Beal","year":"1997","journal-title":"International Computer Chess Association Journal"},{"key":"10.1016\/S0020-0255(99)00093-6_BIB10","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0893-6080(88)90003-2","article-title":"Increased rates of convergence through learning rate adaptation","volume":"1","author":"Jacobs","year":"1988","journal-title":"Neural Networks"},{"key":"10.1016\/S0020-0255(99)00093-6_BIB11","unstructured":"T. Leggett, Shogi: Japan\u2019s Game of Strategy, Charles E. Tuttle Company, 1993 (first published in 1966)"},{"issue":"2","key":"10.1016\/S0020-0255(99)00093-6_BIB12","first-page":"103","article-title":"Natural developments in game research: from chess to shogi to go","volume":"19","author":"Matsubara","year":"1996","journal-title":"International Computer Chess Association Journal"},{"key":"10.1016\/S0020-0255(99)00093-6_BIB13","unstructured":"M. Mutz, Gnu Shogi v1.2p03, 1994 (available from many sources, including ftp:\/\/ftp.uni-passau.de\/pub\/local\/shogi)"},{"key":"10.1016\/S0020-0255(99)00093-6_BIB14","unstructured":"H. Yamashita, YSS: About the Data Structures and the Algorithm, Published on the WWW at http:\/\/plaza15.mbn.or.jp\/\u223cyss, 1997"},{"issue":"1","key":"10.1016\/S0020-0255(99)00093-6_BIB15","first-page":"3","article-title":"Random evaluations in chess","volume":"17","author":"Beal","year":"1994","journal-title":"International Computer Chess Association Journal"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025599000936?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025599000936?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T18:52:13Z","timestamp":1555959133000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025599000936"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["S0020025599000936"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0255(99)00093-6","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}