{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T05:31:32Z","timestamp":1736314292153,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540619949"},{"type":"electronic","value":"9783540495888"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0037408","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T15:15:55Z","timestamp":1138202155000},"page":"255-274","source":"Crossref","is-referenced-by-count":2,"title":["Trends in game tree search"],"prefix":"10.1007","author":[{"given":"Arie","family":"de Bruin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wim","family":"Pijls","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,26]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0004-3702(78)80011-3","volume":"10","author":"G. M. Baudet","year":"1978","unstructured":"G. M. Baudet, On the branching factor of the alpha-beta pruning algorithm. Artificial Intelligence 10 (1978), pp 173\u2013199.","journal-title":"Artificial Intelligence"},{"key":"16_CR2","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0020-0190(93)90034-7","volume":"47","author":"S. Bhattacharya","year":"1993","unstructured":"Subir Bhattacharya and A. Bagchi, A faster alternative to SSS * with extension to variable memory, Information processing letters 47 (1993), 209\u2013214.","journal-title":"Information processing letters"},{"key":"16_CR3","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0004-3702(86)90092-5","volume":"29","author":"T. Ibaraki","year":"1986","unstructured":"Toshihide Ibaraki, Generalization of alpha-beta and SSS * search procedures, Artificial Intelligence 29 (1986), 73\u2013117.","journal-title":"Artificial Intelligence"},{"key":"16_CR4","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0004-3702(83)80009-5","volume":"21","author":"V. Kumar","year":"1983","unstructured":"V. Kumar and L.N. Kanal, A General Branch and Bound Formulation for Understanding and Synthesizing And\/Or Tree Search Procedures, Artificial Intelligence 21 (1983), 179\u2013198.","journal-title":"Artificial Intelligence"},{"issue":"no.4","key":"16_CR5","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","volume":"6","author":"D. E. Knuth","year":"1975","unstructured":"Donald E. Knuth and Ronald W. Moore, An analysis of alpha-beta pruning, Artificial Intelligence 6 (1975), no. 4, 293\u2013326.","journal-title":"Artificial Intelligence"},{"key":"16_CR6","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0004-3702(87)90019-1","volume":"31","author":"T. A. Marsland","year":"1987","unstructured":"T. A. Marsland, A. Reineveld, J. Schaeffer, Low Overhead Alternatives to SSS *, Artificial Intelligence 31 (1987) pp. 185\u2013199.","journal-title":"Artificial Intelligence"},{"key":"16_CR7","first-page":"211","volume-title":"Algorithms, International Symposium SIGAL '90","author":"W. Pijls","year":"1990","unstructured":"Wim Pijls and Arie de Bruin, Another view on the SSS * algorithm, Algorithms, International Symposium SIGAL '90, Tokyo, Japan, August 16\u201318, 1990 Proceedings (T. Asano, T. Ibaraki, H. Imai, and T. Nishizeki, eds.), LNCS, vol. 450, Springer-Verlag, August 1990, pp. 211\u2013220."},{"key":"16_CR8","volume-title":"PhD Thesis","author":"W. Pijls","year":"1991","unstructured":"Wim Pijls. Shortest Paths and Game Trees. PhD Thesis, Erasmus University Rotterdam, The Netherlands, November 1991."},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Wim Pijls and Arie de Bruin, Searching informed game trees, In: Algorithms and Computation, ISAAC 92 (T. Ibaraki, ed), pp. 332\u2013341, LNCS 650.","DOI":"10.1007\/3-540-56279-6_86"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Wim Pijls and Arie de Bruin, A theory of game trees based on solution trees, Tech.Rep. EUR-CS-96-xxx, Erasmus University Rotterdam, 1996.","DOI":"10.1007\/3-540-63774-5_136"},{"key":"16_CR11","volume-title":"PhD Thesis","author":"A. Plaat","year":"1996","unstructured":"Aske Plaat. Research Re:Search & Research. PhD Thesis, Erasmus University Rotterdam, The Netherlands, June 1996."},{"key":"16_CR12","unstructured":"Aske Plaat, Jonathan Schaeffer, Wim Pijls and Arie de Bruin, A Minimax Algorithm Better than SSS *, In: Artificial Intelligence, to appear."},{"key":"16_CR13","volume-title":"Proceedings of the 13th National Conference on Artificial Intelligence (AAAI '96)","author":"A. Plaat","year":"1996","unstructured":"Aske Plaat, Jonathan Schaeffer, Wim Pijls and Arie de Bruin, Exploiting graph properties of game trees. In Proceedings of the 13th National Conference on Artificial Intelligence (AAAI '96), Portland, OR, August 1996. American Association for Artificial Intelligence, AAAI Press."},{"issue":"2","key":"16_CR14","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/0004-3702(94)90049-3","volume":"71","author":"A. Reinefeld","year":"1994","unstructured":"Alexander Reinefeld and Peter Ridinger. Time efficient state space search. Artificial Intelligence, 71 (2), pp. 397\u2013408, 1994.","journal-title":"Artificial Intelligence"},{"key":"16_CR15","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0004-3702(83)80010-1","volume":"21","author":"I. Roizen","year":"1983","unstructured":"Igor Roizen and Judea Pearl, A minimax algorithm better than alpha-beta? yes and no, Artificial Intelligence 21 (1983), 199\u2013230.","journal-title":"Artificial Intelligence"},{"issue":"no.1","key":"16_CR16","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1109\/34.42858","volume":"PAMI-11","author":"J. Schaeffer","year":"1989","unstructured":"Jonathan Schaeffer, The history heuristic and alpha-beta search enhancements in practice, IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-11 (1989), no. 1, 1203\u20131212.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"no.2","key":"16_CR17","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0004-3702(79)90016-X","volume":"12","author":"G. Stockman","year":"1979","unstructured":"G. Stockman, A minimax algorithm better than alpha-beta?, Artificial Intelligence 12 (1979), no. 2, 179\u2013196.","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","SOFSEM'96: Theory and Practice of Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0037408","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T11:46:48Z","timestamp":1736250408000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0037408"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540619949","9783540495888"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0037408","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}