{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:25:21Z","timestamp":1761647121999},"reference-count":11,"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)00097-3","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:32:24Z","timestamp":1049722344000},"page":"23-41","source":"Crossref","is-referenced-by-count":5,"title":["Risk management in game-tree pruning"],"prefix":"10.1016","volume":"122","author":[{"given":"Y.","family":"Bj\u00f6rnsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.A.","family":"Marsland","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0020-0255(99)00097-3_BIB1","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/0004-3702(75)90021-1","article-title":"Some methods of controlling the tree search in chess programs","volume":"6","author":"Adelson-Velskiy","year":"1975","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0020-0255(99)00097-3_BIB2","doi-asserted-by":"crossref","unstructured":"D.F. Beal, A generalized quiescence search algorithm, Artificial Intelligence 43 (1990) 85\u201398; see also: Experiments with the null move, Advances in Computer Chess 5 (1989) 65\u201379","DOI":"10.1016\/0004-3702(90)90072-8"},{"issue":"2","key":"10.1016\/S0020-0255(99)00097-3_BIB3","first-page":"71","article-title":"ProbCut: An effective selective extension of the alpha\u2013beta algorithm","volume":"18","author":"Buro","year":"1995","journal-title":"ICCA Journal"},{"key":"10.1016\/S0020-0255(99)00097-3_BIB4","series-title":"Thought and Choice in Chess","author":"de Groot","year":"1978"},{"key":"10.1016\/S0020-0255(99)00097-3_BIB5","unstructured":"G. Goetsch, M.S. Campbell, Experimenting with the null move heuristic, in: T. Marsland, J. Schaeffer (Eds.), Computers Chess and Cognition, 1990, pp. 158\u2013168. See also: AAAI Spring Symposium Proceedings, 1988, pp. 14\u201318"},{"key":"10.1016\/S0020-0255(99)00097-3_BIB6","first-page":"53","article-title":"Diminishing returns for additional search in chess","volume":"8","author":"Junghanns","year":"1997","journal-title":"Advances in Computer Chess"},{"key":"10.1016\/S0020-0255(99)00097-3_BIB7","unstructured":"T.A. Marsland, Single-agent and game-tree search, in: A. Kent, J. Williams (Eds.), Encyclopedia of Computer Science and Technology, vol. 27, Marcel Dekker, New York, 1993 pp. 317\u2013336"},{"issue":"4","key":"10.1016\/S0020-0255(99)00097-3_BIB8","first-page":"4","article-title":"An Improvement to the Scout tree search algorithm","volume":"6","author":"Reinefeld","year":"1993","journal-title":"ICCA Journal"},{"key":"10.1016\/S0020-0255(99)00097-3_BIB9","unstructured":"F. Reinfeld, 1001 Brilliant Ways to Checkmate, Sterling Publishing Co., New York, 1955 (Reprinted by Melvin Powers Wilshire Book Company)"},{"issue":"1","key":"10.1016\/S0020-0255(99)00097-3_BIB10","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1109\/34.42858","article-title":"The history heuristic and alpha-beta search enhancements in practice","volume":"11","author":"Schaeffer","year":"1989","journal-title":"IEEE Transcations on Pattern Analysis and Machine Intelligence"},{"key":"10.1016\/S0020-0255(99)00097-3_BIB11","unstructured":"S.J.J. Smith, D.S. Nau, An analysis of forward pruning, in: Proceedings of the Twelth National Conference on Artificial Intelligence AAAI-94, vol. 2, 1994, pp. 1386\u20131391"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025599000973?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025599000973?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T15:35:46Z","timestamp":1579016146000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025599000973"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["S0020025599000973"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0255(99)00097-3","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}