{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:33:27Z","timestamp":1761647607690,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":29,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_370","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T10:59:49Z","timestamp":1219661989000},"page":"2079-2087","source":"Crossref","is-referenced-by-count":1,"title":["Minimax Game Tree Searching"],"prefix":"10.1007","author":[{"given":"Claude G.","family":"Diderich","sequence":"first","affiliation":[]},{"given":"Marc","family":"Gengler","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"370_CR1_370","unstructured":"Akl SG, Barnard DT, Doran RJ (1979) Searching game trees in parallel. In: Proc. 3rd Biennial Conf. Canad. Soc. Computation Studies of Intelligence, pp 224\u2013231"},{"issue":"2","key":"370_CR2_370","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1109\/TPAMI.1982.4767226","volume":"PAMI-4","author":"S.G. Akl","year":"1982","unstructured":"Akl SG, Barnard DT, Doran RJ (1982) Design, analysis, and implementation of a\u00a0parallel tree search algorithm. IEEE Trans Pattern Anal Machine Intell PAMI-4(2):192\u2013203","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"370_CR3_370","unstructured":"Almquist K, McKenzie N, Sloan K (1988) An inquiry into parallel algorithms for searching game trees. Techn. Report Univ. Washington, Seattle, WA 12(3)"},{"key":"370_CR4_370","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1016\/0196-6774(88)90016-8","volume":"9","author":"I. Alth\u00f6fer","year":"1988","unstructured":"Alth\u00f6fer I (1988) On the complexity of searching game trees and other recursion trees. J\u00a0Algorithms 9:538\u2013567","journal-title":"J. Algorithms"},{"key":"370_CR5_370","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0004-3702(90)90070-G","volume":"43","author":"I. Alth\u00f6fer","year":"1990","unstructured":"Alth\u00f6fer I (1990) An incremental negamax algorithm. Artif Intell 43:57\u201365","journal-title":"Artif. Intell."},{"key":"370_CR6_370","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/S0004-3702(83)80015-0","volume":"21","author":"B.W. Ballard","year":"1983","unstructured":"Ballard BW (1983) The \u2217 -minimax search procedure for trees containing chance nodes. Artif Intell 21:327\u2013350","journal-title":"Artif. Intell."},{"key":"370_CR7_370","unstructured":"Baudet GM (1978) The design and analysis of algorithms for asynchronous multiprocessors. PhD Thesis Carnegie-Mellon Univ. Pittsburgh, PA, CMU-CS-78-116"},{"key":"370_CR8_370","unstructured":"B\u00f6hm M, Speckenmeyer E (1989) A\u00a0dynamic processor tree for solving game trees in parallel. Proc. SOR'89"},{"key":"370_CR9_370","series-title":"Res. Report INRIA","volume-title":"Parallel minimax tree searching","author":"V.-D Cung","year":"1991","unstructured":"Cung V-D, Roucairol C (1991) Parallel minimax tree searching. Res Report INRIA, vol\u00a01549"},{"key":"370_CR10_370","unstructured":"Diderich CG (1992) Evaluation des performances de l'algorithme SSS\u2217 avec phases de synchronisation sur une machine parall\u00e8le \u00e0 m\u00e9moires distribu\u00e9es. Techn. Report Computer Sci. Dept. Swiss Federal Inst. Techn. Lausanne, Switzerland,  LiTH-99 (In French.)"},{"key":"370_CR11_370","volume-title":"Computers and thought","author":"E.A. Feigenbaum","year":"1963","unstructured":"Feigenbaum EA, Feldman J (1963) Computers and thought. McGraw-Hill, New York"},{"issue":"2","key":"370_CR12_370","first-page":"65","volume":"12","author":"R. Feldmann","year":"1989","unstructured":"Feldmann R, Monien B, Mysliwietz P, Vornberger O (1989) Distributed game tree search. ICCA J 12(2):65\u201373","journal-title":"ICCA J."},{"key":"370_CR13_370","first-page":"203","volume-title":"Advances in Computer Chess, vol\u00a07","author":"R. Feldmann","year":"1994","unstructured":"Feldmann R, Mysliwietz P, Monien B (1994) Game tree search on a\u00a0massively parallel system. In: van den Herik HJ, Herschberg IS, Uiterwijk JWHM (eds) Advances in Computer Chess, vol\u00a07. Univ. Limburg, Maastricht, pp 203\u2013218"},{"key":"370_CR14_370","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0004-3702(82)90022-4","volume":"19","author":"R.A. Finkel","year":"1982","unstructured":"Finkel RA, Fishburn JP (1982) Parallelism in alpha-beta search. Artif Intell 19:89\u2013106","journal-title":"Artif. Intell."},{"key":"370_CR15_370","first-page":"237","volume-title":"Consistent linear speedup in parallel alpha-beta search. Proc. ICCI'92, Computing and Information","author":"R Hewett","year":"1992","unstructured":"Hewett R, Krishnamurthy G (1992) Consistent linear speedup in parallel alpha-beta search. Proc. ICCI'92, Computing and Information. IEEE Computer Soc Press, New York, pp 237\u2013240"},{"key":"370_CR16_370","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0004-3702(86)90092-5","volume":"29","author":"T. Ibaraki","year":"1986","unstructured":"Ibaraki T (1986) Generalization of alpha-beta and {SSS*} search procedures. Artif Intell 29:73\u2013117","journal-title":"Artif. Intell."},{"key":"370_CR17_370","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1145\/72935.72979","volume-title":"ACM Annual Symp. Parallel Algorithms and Architectures (SPAA'89)","author":"RM Karp","year":"1989","unstructured":"Karp RM, Zhang Y (1989) On parallel evaluation of game trees. In: ACM Annual Symp. Parallel Algorithms and Architectures (SPAA'89). ACM, New York, pp 409\u2013420"},{"issue":"4","key":"370_CR18_370","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","volume":"6","author":"D.E. Knuth","year":"1975","unstructured":"Knuth DE, Moore RW (1975) An analysis of alpha-beta pruning. Artif Intell, 6(4):293\u2013326","journal-title":"Artif. Intell."},{"issue":"4","key":"370_CR19_370","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1145\/356893.356895","volume":"14","author":"T.A. Marsland","year":"1982","unstructured":"Marsland TA, Campbell MS (1982) Parallel search of strongly ordered game trees. ACM Computing Surveys 14(4):533\u2013551","journal-title":"ACM Computing Surveys"},{"issue":"4","key":"370_CR20_370","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1109\/TPAMI.1985.4767683","volume":"PAMI-7","author":"T.A. Marsland","year":"1985","unstructured":"Marsland TA, Popowich F (1985) Parallel game-tree search. IEEE Trans Pattern Anal Machine Intell PAMI-7(4):442\u2013452","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"370_CR21_370","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0004-3702(87)90019-1","volume":"31","author":"T.A. Marsland","year":"1987","unstructured":"Marsland TA, Reinefeld A, Schaeffer J (1987) Low overhead alternatives to SSS\u2217. Artif Intell 31:185\u2013199","journal-title":"Artif. Intell."},{"key":"370_CR22_370","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0004-3702(88)90019-7","volume":"35","author":"D.A. McAllester","year":"1988","unstructured":"McAllester DA (1988) Conspiracy numbers for min-max searching. Artif Intell 35:287\u2013310","journal-title":"Artif. Intell."},{"issue":"2","key":"370_CR23_370","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0004-3702(80)90037-5","volume":"14","author":"J. Pearl","year":"1980","unstructured":"Pearl J (1980) Asymptotical properties of minimax trees and game searching procedures. Artif Intell 14(2):113\u2013138","journal-title":"Artif. Intell."},{"key":"370_CR24_370","doi-asserted-by":"crossref","unstructured":"Pijls W, de Bruin A (Aug. 1990) Another view of the SSS\u2217 algorithm. In: Proc. Internat. Symp. (SIGAL'90)","DOI":"10.1007\/3-540-52921-7_70"},{"issue":"1","key":"370_CR25_370","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0004-3702(87)90004-X","volume":"34","author":"R.L. Rivest","year":"1987","unstructured":"Rivest RL (1987) Game tree searching by min\/max approximation. Artif Intell 34(1):77\u201396","journal-title":"Artif. Intell."},{"key":"370_CR26_370","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0004-3702(83)80010-1","volume":"21","author":"I. Roizen","year":"1983","unstructured":"Roizen I, Pearl J (1983) A\u00a0minimax algorithm better than alpha-beta? Yes and no. Artif Intell 21:199\u2013230","journal-title":"Artif. Intell."},{"issue":"2","key":"370_CR27_370","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1145\/321510.321511","volume":"16","author":"J.H. Slagle","year":"1969","unstructured":"Slagle JH, Dixon JK (Apr. 1969) Experiments with some programs that search game trees. J\u00a0ACM 16(2):189\u2013207","journal-title":"J. ACM"},{"key":"370_CR28_370","unstructured":"Steinberg IR, Solomon M (1990) Searching game trees in parallel. Proc. IEEE Internat. Conf. Parallel Processing, III, III\u20139\u2013III\u201317"},{"issue":"2","key":"370_CR29_370","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0004-3702(79)90016-X","volume":"12","author":"G.C. Stockman","year":"1979","unstructured":"Stockman GC (1979) A\u00a0minimax algorithm better than alpha-beta? Artif Intell 12(2):179\u2013196","journal-title":"Artif. Intell."}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_370","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T09:41:11Z","timestamp":1720690871000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_370"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_370","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}