{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T11:31:01Z","timestamp":1673350261842},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1986,4,1]],"date-time":"1986-04-01T00:00:00Z","timestamp":512697600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[1986,4]]},"DOI":"10.1007\/bf01414444","type":"journal-article","created":{"date-parts":[[2005,4,3]],"date-time":"2005-04-03T08:32:46Z","timestamp":1112517166000},"page":"163-183","source":"Crossref","is-referenced-by-count":5,"title":["Experiments on alternatives to minimax"],"prefix":"10.1007","volume":"15","author":[{"given":"Dana","family":"Nau","sequence":"first","affiliation":[]},{"given":"Paul","family":"Purdom","sequence":"additional","affiliation":[]},{"given":"Chun-Hung","family":"Tzeng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"T. R. Truscott, Minimum Variance Tree Searching,Proc. First Intl. Symp. on Policy Analysis and Infor. Systems; Durham, NC, pp. 203?209 (1979)."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1145\/2157.322400","volume":"30","author":"D. S. Nau","year":"1983","unstructured":"D. S. Nau, Decision Quality as a Function of Search Depth on Game Trees,J. of the ACM 30:687?708 (October 1983).","journal-title":"J. of the ACM"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0004-3702(82)90010-8","volume":"18","author":"D. S. Nau","year":"1982","unstructured":"D. S. Nau, The Last Player Theorem,Artificial Intelligence 18:53?65 (1982).","journal-title":"Artificial Intelligence"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/0004-3702(83)90004-8","volume":"20","author":"J. Pearl","year":"1983","unstructured":"J. Pearl, On the Nature of Pathology in Game Searching,Artificial Intelligence 20:427?453 (1983).","journal-title":"Artificial Intelligence"},{"key":"CR5","unstructured":"H. C. Tzeng and P. W. Purdom, A Theory of Game Trees,Proc. of the National Conf. on Artificial Intelligence, Washington, D.C., pp. 416?419 (1983)."},{"key":"CR6","unstructured":"H. C. Tzeng, Ph.D. thesis, Computer Science Department, Indiana University (1983)."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0004-3702(83)80011-3","volume":"21","author":"D. S. Nau","year":"1983","unstructured":"D. S. Nau, Pathology on Game Trees Revisited, and an Alternative to Minimaxing,Artificial Intelligence 21:221?244 (1983).","journal-title":"Artificial Intelligence"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"A. L. Reibman and B. W. Ballard, Non-Minimax Search Strategies for Use against Fallible Opponents, National Conference on Artificial Intelligence, Washington, D.C., pp. 338?342 (1983).","DOI":"10.21236\/ADA127487"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0004-3702(80)90037-5","volume":"14","author":"J. Pearl","year":"1980","unstructured":"J. Pearl, Asymptotic Properties of Minimax Trees and Game-Searching Procedures,Artificial Intelligence 14:13?138 (1980).","journal-title":"Artificial Intelligence"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF00977966","volume":"12","author":"D. S. Nau","year":"1983","unstructured":"D. S. Nau, On Game Graph Structure and its Influence on Pathology,Intl. J. Computer and Info. Sciences 12:367?383 (1983).","journal-title":"Intl. J. Computer and Info. Sciences"},{"key":"CR11","volume-title":"Fundamentals of Decision Analysis","author":"I. H. LaValle","year":"1978","unstructured":"I. H. LaValle,Fundamentals of Decision Analysis, Holt, Rinehart, and Winston, New York (1978)."},{"key":"CR12","unstructured":"P. C. Chi and D. S. Nau, Predicting the Performance of Minimax and Product in Game Tree Searching,Second Workshop on Uncertainty in Artificial Intelligence, Philadelphia (to appear)."},{"key":"CR13","unstructured":"B. Abramson, A Cure for Pathological Behavior in Games that Use Minimax,Proc. Workshop on Uncertainty and Probability in Artificial Intelligence, Los Angeles, pp. 225?231 (1985)."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0004-3702(82)90002-9","volume":"19","author":"D. S. Nau","year":"1982","unstructured":"D. S. Nau, An Investigation of the Causes of Pathology in Games,Artificial Intelligence 19:257?278 (1982).","journal-title":"Artificial Intelligence"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01414444.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01414444\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01414444","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T17:14:05Z","timestamp":1586193245000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01414444"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,4]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,4]]}},"alternative-id":["BF01414444"],"URL":"https:\/\/doi.org\/10.1007\/bf01414444","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,4]]}}}