{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T13:11:36Z","timestamp":1767705096265},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540554882"},{"type":"electronic","value":"9783540471035"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55488-2_32","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:07:35Z","timestamp":1330250855000},"page":"270-288","source":"Crossref","is-referenced-by-count":15,"title":["Distributed game tree search on a massively parallel system"],"prefix":"10.1007","author":[{"given":"R.","family":"Feldmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Mysliwietz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Monien","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"14_CR1","unstructured":"S.G. Akl, D.T. Barnard, and R.J. Doran. Simulation and analysis in deriving time and storage requirements for a parallel alpha-beta pruning algorithm. IEEE International Conference on Parallel Processing, pages 231\u2013234, 1980."},{"key":"14_CR2","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):pp 173\u2013199, 1978.","journal-title":"Artificial Intelligence"},{"key":"14_CR3","unstructured":"I. Bratko and D. Kopec. A Test for Comparison of Human and Computer Performance in Chess, in Advances in Computer Chess 3, M.R.B. Clarke (editor), pages 31\u201356. Pergamon Press, 1982."},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0004-3702(83)90001-2","volume":"20","author":"M. S. Campbell","year":"1983","unstructured":"M.S. Campbell and T.A. Marsland. A comparison of minmax tree search algorithms. Artificial Intelligence, (20):pp 347\u2013367, 1983.","journal-title":"Artificial Intelligence"},{"key":"14_CR5","first-page":"461","volume":"8","author":"N. G. deBruijn","year":"1946","unstructured":"N.G. deBruijn. A combinatorial problem. Indagationes Math., 8:pp 461\u2013467, 1946.","journal-title":"Indagationes Math."},{"key":"14_CR6","unstructured":"R.A. Finkel and J.P. Fishburn. Parallel alpha-beta search on arachne. IEEE International Conference on Parallel Processing, pages pp 235\u2013243, 1980."},{"key":"14_CR7","first-page":"128","volume":"2","author":"Ch. Ferguson","year":"1988","unstructured":"Ch. Ferguson and R.E. Korf. Distributed tree search and its application to alpha-beta pruning. Proceedings AAAI-88, Seventh National Conference on Artificial Intelligence, 2:pp 128\u2013132, 1988.","journal-title":"Proceedings AAAI-88, Seventh National Conference on Artificial Intelligence"},{"key":"14_CR8","unstructured":"R. Feldmann, B. Monien, and P. Mysliwietz. A fully distributed chess program. Advances in Computer Chess VI (D. Beal ed.), pages pp 1\u201327, 1990."},{"issue":"2","key":"14_CR9","first-page":"65","volume":"12","author":"R. Feldmann","year":"1989","unstructured":"R. Feldmann, B. Monien, P. Mysliwietz, and O. Vornberger. Distributed game-tree search. ICCA Journal, 12(2):pp 65\u201373, 1989.","journal-title":"ICCA Journal"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"R. Feldmann, B. Monien, P. Mysliwietz, and O. Vornberger. Distributed Game Tree Seach, in Parallel Algorithms for Machine Intelligence and Pattern Recognition, V. Kumar, L.N. Kanal and P.S. Gopalakrishnan (editors). Springer Verlag, 1990.","DOI":"10.1007\/978-1-4612-3390-9_3"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0167-8191(89)90102-6","volume":"10","author":"M. Hyatt","year":"1989","unstructured":"M. Hyatt, B.W. Suter, and H.L. Nelson. A parallel alpha\/beta searching algorithm. Parallel Computing, (10):pp 299\u2013308, 1989.","journal-title":"Parallel Computing"},{"key":"14_CR12","volume-title":"PhD thesis","author":"F. H. Hsu","year":"1990","unstructured":"F.H. Hsu. Large Scale Parallelization of Alpha-Beta Search: An Algorithmic Architectural Study with Computer Chess. PhD thesis, Carnegie Mellon University, Pittsburgh, USA, 1990."},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","volume":"6","author":"D. E. Knuth","year":"1975","unstructured":"D.E. Knuth and R.W. Moore. An analysis of alpha \u2014 beta pruning. Artificial Intelligence, (6):pp 293\u2013326, 1975.","journal-title":"Artificial Intelligence"},{"issue":"4","key":"14_CR14","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1145\/356893.356895","volume":"14","author":"T. A. Marsland","year":"1982","unstructured":"T.A. Marsland and M.S. Campbell. Parallel search of strongly ordered game trees. Computing Surveys, 14(4):pp 533\u2013551, 1982.","journal-title":"Computing Surveys"},{"key":"14_CR15","unstructured":"T.A. Marsland, M. Olafsson, and J. Schaeffer. Multiprocessor Tree-Search Experiments, in Advances in Computer Chess 4 D.F. Beal (editor), pages 37\u201351. Pergamon Press, 1986"},{"issue":"4","key":"14_CR16","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1109\/TPAMI.1985.4767683","volume":"7","author":"T. A. Marsland","year":"1985","unstructured":"T.A. Marsland and F. Popowich. Parallel game tree search. IEEE Transactions on Pattern Analysis and Machine Intelligence, 7(4):pp 442\u2013452, 1985.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"14_CR17","first-page":"60","volume-title":"Math. Research Nr. 38","author":"B. Monien","year":"1987","unstructured":"B. Monien and O. Vornberger. Parallel processing of combinatorial search trees. Proceedings International Workshop on Parallel Algorithms and Architectures, Math. Research Nr. 38, Akademie-Verlag Berlin, pages 60\u201369, 1987."},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"M. Newborn. Unsynchronized iterative deepening parallel alpha-beta search. IEEE Transactions on Pattern Analysis and Machine Intelligence, pages 687\u2013694, 1988.","DOI":"10.1109\/34.6777"},{"key":"14_CR19","volume-title":"Technical report","author":"S. W. Otto","year":"1988","unstructured":"S.W. Otto and E.W. Felten. Chess on a hypercube. Technical report, California Institute of Technology, USA, 1988."},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0004-3702(80)90037-5","volume":"14","author":"J. Pearl","year":"1980","unstructured":"J. Pearl. Assymptotic properties of minmax trees and game searching procedures. Artificial Intelligence, (14):pp 113\u2013139, 1980.","journal-title":"Artificial Intelligence"},{"issue":"4","key":"14_CR21","first-page":"216","volume":"12","author":"J. Schaeffer","year":"1989","unstructured":"J. Schaeffer. Comment on\u2019 distributed game tree search'. ICCA Journal, 12(4):pp 216\u2013217, 1989.","journal-title":"ICCA Journal"},{"issue":"2","key":"14_CR22","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/0743-7315(89)90044-0","volume":"6","author":"J. Schaeffer","year":"1989","unstructured":"J. Schaeffer. Distributed game-tree searching. Journal of Parallel and Distributed Computing, 6(2):pp 90\u2013114, 1989.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"14_CR23","unstructured":"J. Schaeffer. Personal communication. 1990."},{"key":"14_CR24","unstructured":"O. Vornberger and B. Monien. Parallel alpha-beta versus parallel sss*. Proceedings IFIP Conference on Distributed Processing, Distributed Processing, North Holland, pages pp 613\u2013625, 1987."}],"container-title":["Lecture Notes in Computer Science","Data structures and efficient algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55488-2_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:31:23Z","timestamp":1619573483000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55488-2_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540554882","9783540471035"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-55488-2_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}