{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,30]],"date-time":"2024-06-30T15:14:09Z","timestamp":1719760449298},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4549,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,2]]},"DOI":"10.1016\/s0304-3975(00)00078-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:41:58Z","timestamp":1027593718000},"page":"105-119","source":"Crossref","is-referenced-by-count":11,"title":["Temporal difference learning applied to game playing and the results of application to shogi"],"prefix":"10.1016","volume":"252","author":[{"given":"Donald F.","family":"Beal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin C.","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00078-5_BIB1","unstructured":"J. Baxter, A. Tridgell, L. Weaver, KnightCap: A chess program that learns by combining TD(lambda) with game-tree search, in: Machine Learning, Proceedings of the 15th International Conference, ICML \u201998, Madison, 1998, pp. 28\u201336."},{"key":"10.1016\/S0304-3975(00)00078-5_BIB2","unstructured":"D.F. Beal, Experiments with the Null Move, in: D.F. Beal (Ed.), Advances in Computer Chess 5, Elsevier, Amsterdam, 1989, pp. 65\u201379."},{"key":"10.1016\/S0304-3975(00)00078-5_BIB3","first-page":"147","article-title":"Learning piece values using temporal differences","volume":"20","author":"Beal","year":"1997","journal-title":"Internat. Comp. Chess Ass. J."},{"key":"10.1016\/S0304-3975(00)00078-5_BIB4","unstructured":"J. Christensen, R. Korf, A unified theory of heuristic evaluation functions and its application to learning, AAAI-86, Morgan-Kaufman, Los Altos, CA, 1986, pp. 148\u2013152."},{"key":"10.1016\/S0304-3975(00)00078-5_BIB5","first-page":"137","article-title":"Null move and deep search","volume":"16","author":"Donninger","year":"1993","journal-title":"Internat. Comp. Chess Ass. J."},{"key":"10.1016\/S0304-3975(00)00078-5_BIB6","series-title":"Shogi for Beginners","author":"Fairbairn","year":"1989"},{"key":"10.1016\/S0304-3975(00)00078-5_BIB7","unstructured":"T. Leggett, Shogi: Japan's game of strategy, Charles E. Tuttle Company, reprinted 1993, first published 1966."},{"key":"10.1016\/S0304-3975(00)00078-5_BIB8","doi-asserted-by":"crossref","unstructured":"R. Levinson, R. Snyder, Adaptive pattern oriented chess, Proceedings of AAAI-91, Morgan-Kaufman, Los Altos, CA, 1991, pp. 601\u2013605.","DOI":"10.1016\/B978-1-55860-200-7.50021-0"},{"key":"10.1016\/S0304-3975(00)00078-5_BIB9","series-title":"Encyclopaedia of artificial intelligence","article-title":"Computer Chess and Search","author":"Marsland","year":"1992"},{"key":"10.1016\/S0304-3975(00)00078-5_BIB10","first-page":"103","article-title":"Natural developments in game research: from chess to shogi to go","volume":"19","author":"Matsubara","year":"1996","journal-title":"Internat. Comp. Chess Ass. J."},{"key":"10.1016\/S0304-3975(00)00078-5_BIB11","unstructured":"M. Mutz, Gnu Shogi, vol. 2, p. 3 (Available from many sources, including ftp:\/\/ftp.uni-passau.de\/pub\/local\/shogi, 1994)."},{"key":"10.1016\/S0304-3975(00)00078-5_BIB12","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 comput."},{"key":"10.1016\/S0304-3975(00)00078-5_BIB13","doi-asserted-by":"crossref","unstructured":"A.L. Samuel, Some studies in machine learning using the game of checkers, IBM J. Res. Dev. 3 (1959) 210\u2013229. Reprinted in E.A. Feigenbaum, J. Feldman (Eds.), Computers and Thought, McGraw-Hill, New York.","DOI":"10.1147\/rd.33.0210"},{"key":"10.1016\/S0304-3975(00)00078-5_BIB14","doi-asserted-by":"crossref","unstructured":"R.S. Sutton, Learning to predict by the methods of temporal differences, Machine Learning 1988 (9\u201344).","DOI":"10.1007\/BF00115009"},{"key":"10.1016\/S0304-3975(00)00078-5_BIB15","unstructured":"H. Yamashita, YSS: About the Data Structures and the Algorithm, published on the WWW at http:\/\/plaza15.mbn.or.jp\/\u00a0\u0303yss, 1997."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000785?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000785?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T22:54:32Z","timestamp":1556405672000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500000785"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,2]]}},"alternative-id":["S0304397500000785"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00078-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,2]]}}}