{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:31:23Z","timestamp":1725467483342},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540637745"},{"type":"electronic","value":"9783540696452"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63774-5_136","type":"book-chapter","created":{"date-parts":[[2006,7,17]],"date-time":"2006-07-17T14:30:57Z","timestamp":1153146657000},"page":"539-546","source":"Crossref","is-referenced-by-count":0,"title":["A theory of game trees, based on solution trees"],"prefix":"10.1007","author":[{"given":"Wim","family":"Pijls","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arie","family":"de Bruin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,29]]},"reference":[{"key":"43_CR1","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0004-3702(94)90004-3","volume":"66","author":"L. V. Allis","year":"1994","unstructured":"L. Victor Allis, Maarten van der Meulen, and H. Jaap van den Herik, Proofnumber search, Artificial Intelligence 66 (1994), pp. 91\u2013124.","journal-title":"Artificial Intelligence"},{"key":"43_CR2","doi-asserted-by":"crossref","unstructured":"A. de Bruin, W. Pijls, Trends in Game Tree Search, Proceedings Sofsem '96, Theory and Practice of Informatics (Keith G. Jeffery et al. eds.), LNCS vol. 1175, 1996, pp. 255\u2013274.","DOI":"10.1007\/BFb0037408"},{"key":"43_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), pp. 73\u2013117.","journal-title":"Artificial Intelligence"},{"key":"43_CR4","unstructured":"Toshihide Ibaraki, Search Algorithms for Minimax Game Trees, Conference paper Twenty years NP-completeness, Sicily, June 1991."},{"key":"43_CR5","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), pp. 179\u2013198.","journal-title":"Artificial Intelligence"},{"issue":"no.4","key":"43_CR6","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, pp. 293\u2013326.","journal-title":"Artificial Intelligence"},{"key":"43_CR7","unstructured":"Wim Pijls, Arie de Bruin, Aske Plaat, A theory of game trees, based on solution trees, Tech. Report EUR-CS-96-06, Erasmus University Rotterdam, December 1996, also available as: http:\/\/www. cs. few. eur.nl\/few\/inf\/publicaties\/rapporten.eur-few-cs-96-06. ps"},{"key":"43_CR8","unstructured":"Aske Plaat, Jonathan Schaeffer, Wim Pijls and Arie de Bruin, Best-first fixed depth game tree search in practice, Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95), vol. 1, pp. 273\u2013279."},{"key":"43_CR9","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0004-3702(95)00096-8","volume":"84","author":"A. Plaat","year":"1996","unstructured":"Aske Plaat, Jonathan Schaeffer, Wim Pijls and Arie de Bruin, A Minimax Algorithm Better than SSS*, Artificial Intelligence 84 (1996) pp. 299\u2013337.","journal-title":"Artificial Intelligence"},{"issue":"no.2","key":"43_CR10","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, pp. 179\u2013196.","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","SOFSEM'97: Theory and Practice of Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63774-5_136","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T16:26:48Z","timestamp":1549211208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63774-5_136"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637745","9783540696452"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-63774-5_136","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}