{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:45:23Z","timestamp":1771703123626,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540324881","type":"print"},{"value":"9783540324898","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11674399_3","type":"book-chapter","created":{"date-parts":[[2006,1,23]],"date-time":"2006-01-23T04:41:59Z","timestamp":1137991319000},"page":"35-50","source":"Crossref","is-referenced-by-count":6,"title":["Rediscovering *-Minimax Search"],"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":[{"issue":"3","key":"3_CR1","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/S0004-3702(83)80015-0","volume":"21","author":"B. Ballard","year":"1983","unstructured":"Ballard, B.: The *-Minimax search procedure for trees containing chance nodes. Artificial Intelligence\u00a021(3), 327\u2013350 (1983)","journal-title":"Artificial Intelligence"},{"issue":"1\u20132","key":"3_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0004-3702(01)00130-8","volume":"134","author":"D. Billings","year":"2002","unstructured":"Billings, D., Davidson, A., Schaeffer, J., Szafron, D.: The challenge of poker. Artificial Intelligence\u00a0134(1\u20132), 201\u2013240 (2002)","journal-title":"Artificial Intelligence"},{"key":"3_CR3","unstructured":"Ginsberg, M.: GIB: Steps toward an expert-level bridge-playing program. In: International Joint Conference on Artificial Intelligence, pp. 584\u2013589 (1999)"},{"key":"3_CR4","unstructured":"Hauk, T.: Search in trees with chance nodes. Master\u2019s thesis, Computing Science, University of Alberta (2004)"},{"key":"3_CR5","series-title":"Lecture Notes in Artificial Intelligence","first-page":"51","volume-title":"Ambient Intelligence in Everyday Life","author":"T. Hauk","year":"2006","unstructured":"Hauk, T., Buro, M., Schaeffer, J.: *-Minimax performance in backgammon. In: Cai, Y., Abascal, J. (eds.) Ambient Intelligence in Everyday Life. LNCS (LNAI), vol.\u00a03864, pp. 51\u201366. Springer, Heidelberg (2006)"},{"key":"3_CR6","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":"3_CR7","unstructured":"Sheppard, B.: Towards Perfect Play of Scrabble. PhD thesis, Institute for Knowledge and Agent Technology (IKAT), Universiteit Maastricht (2002)"},{"issue":"3","key":"3_CR8","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/203330.203343","volume":"38","author":"G. Tesauro","year":"1995","unstructured":"Tesauro, G.: Temporal difference learning and TD-Gammon. Communications of the ACM\u00a038(3), 58\u201368 (1995)","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Computers and Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11674399_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T13:08:54Z","timestamp":1552482534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11674399_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540324881","9783540324898"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11674399_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}