{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:03:41Z","timestamp":1725552221999},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540324881"},{"type":"electronic","value":"9783540324898"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11674399_4","type":"book-chapter","created":{"date-parts":[[2006,1,23]],"date-time":"2006-01-23T09:41:59Z","timestamp":1138009319000},"page":"51-66","source":"Crossref","is-referenced-by-count":6,"title":["*-Minimax Performance in Backgammon"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Hauk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Buro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Schaeffer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"GNU\u00a0Backgammon (backgammon software), http:\/\/www.gnubg.org\/"},{"key":"4_CR2","unstructured":"Jellyfish (backgammon software), http:\/\/jelly.effect.no\/"},{"key":"4_CR3","unstructured":"Snowie (backgammon software), http:\/\/www.bgsnowie.com\/"},{"issue":"3","key":"4_CR4","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/S0004-3702(83)80015-0","volume":"21","author":"B.W. Ballard","year":"1983","unstructured":"Ballard, B.W.: The *-Minimax Search Procedure for Trees Containing Chance Nodes. Artificial Intelligence\u00a021(3), 327\u2013350 (1983)","journal-title":"Artificial Intelligence"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0004-3702(80)90041-7","volume":"14","author":"H. Berliner","year":"1980","unstructured":"Berliner, H.: Backgammon Computer Program Beats World Champion. Artificial Intelligence\u00a014, 205\u2013220 (1980)","journal-title":"Artificial Intelligence"},{"key":"4_CR6","unstructured":"Hauk, T.: Search in Trees with Chance Nodes. M.Sc.\u00a0Thesis, Computing Science Department, University of Alberta (2004)"},{"key":"4_CR7","series-title":"Lecture Notes in Artificial Intelligence","first-page":"35","volume-title":"Ambient Intelligence in Everyday Life","author":"T. Hauk","year":"2006","unstructured":"Hauk, T., Buro, M., Schaeffer, J.: Rediscovering *-Minimax. In: Cai, Y., Abascal, J. (eds.) Ambient Intelligence in Everyday Life. LNCS (LNAI), vol.\u00a03864, pp. 35\u201350. Springer, Heidelberg (2006)"},{"key":"4_CR8","unstructured":"Howard, M.: The Duel (August 5, 2003) [Online], http:\/\/www.rec.games.backgammon.org"},{"key":"4_CR9","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/B978-0-08-011356-2.50011-2","volume-title":"Advances in Programming and Non-Numerical Computation","author":"D. Michie","year":"1966","unstructured":"Michie, D.: Game-playing and game-learning automata. In: Fox, L. (ed.) Advances in Programming and Non-Numerical Computation, pp. 183\u2013200. Pergamon, New York (1966)"},{"key":"4_CR10","volume-title":"Reinforcement Learning: An Introduction","author":"R.S. Sutton","year":"1998","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT Press, Cambridge (1998)"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Tesauro, G.: Neurogammon: A neural-network backgammon learning program. In: Levy, D.N., Beal, D.F. (eds.) Heuristic Programming in Artificial Intelligence, pp. 78\u201380. Ellis Horwood (1989)","DOI":"10.1109\/IJCNN.1990.137821"},{"issue":"3","key":"4_CR12","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1145\/203330.203343","volume":"38","author":"Gerald Tesauro","year":"1995","unstructured":"Tesauro, G.: Temporal Difference Learning and TD-Gammon. Communications of the ACM\u00a038(3) (March 1995)","journal-title":"Communications of the ACM"},{"issue":"1-2","key":"4_CR13","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0004-3702(01)00110-2","volume":"134","author":"G. Tesauro","year":"2002","unstructured":"Tesauro, G.: Programming Backgammon Using Self-Teaching Neural Nets. Artificial Intelligence\u00a0134(1-2), 181\u2013199 (2002)","journal-title":"Artificial Intelligence"},{"key":"4_CR14","unstructured":"Tesauro, G., Galperin, G.R.: On-line policy improvement using Monte Carlo search. In: Proc.\u00a0of NIPS, pp. 1068\u20131074 (1996)"},{"key":"4_CR15","unstructured":"Thyssen, J.: Personal Communication (2003)"},{"issue":"2","key":"4_CR16","first-page":"69","volume":"13","author":"A.L. Zobrist","year":"1990","unstructured":"Zobrist, A.L.: A New Hashing Method with Applications for Game Playing. ICCA Journal\u00a013(2), 69\u201373 (1990)","journal-title":"ICCA Journal"}],"container-title":["Lecture Notes in Computer Science","Computers and Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11674399_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,12]],"date-time":"2020-04-12T06:52:38Z","timestamp":1586674358000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11674399_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540324881","9783540324898"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11674399_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}