{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:28:16Z","timestamp":1742956096121,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540854500"},{"type":"electronic","value":"9783540854517"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/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":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85451-7_62","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T13:15:29Z","timestamp":1219151729000},"page":"587-598","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Twofold Distributed Game-Tree Search Approach Using Interconnected Clusters"],"prefix":"10.1007","author":[{"given":"Kai","family":"Himstedt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulf","family":"Lorenz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dietmar P. F.","family":"M\u00f6ller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"62_CR1","unstructured":"Feldmann, R.: Game Tree Search on Massively Parallel Systems. PhD Thesis, University of Paderborn, Paderborn (1993)"},{"key":"62_CR2","doi-asserted-by":"crossref","unstructured":"Feldmann, R., Mysliwietz, M., Monien, B.: Studying Overheads in Massively Parallel Min\/Max-Tree Evaluation. In: 6th ACM Annual symposium on parallel algorithms and architectures (SPAA 1994), New York, pp. 94\u2013104 (1994)","DOI":"10.1145\/181014.192325"},{"key":"62_CR3","doi-asserted-by":"crossref","unstructured":"Donninger, C., Kure, A., Lorenz, U.: Parallel Brutus: The First Distributed, FPGA Accelerated Chess Program. In: Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), CD-ROM. Santa Fe, p. 44 (2004)","DOI":"10.1109\/IPDPS.2004.1302962"},{"key":"62_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1007\/978-3-540-30117-2_101","volume-title":"Field Programmable Logic and Application","author":"C. Donninger","year":"2004","unstructured":"Donninger, C., Lorenz, U.: The Chess Monster Hydra. In: Becker, J., Platzner, M., Vernalde, S. (eds.) FPL 2004. LNCS, vol.\u00a03203, pp. 927\u2013932. Springer, Heidelberg (2004)"},{"issue":"2","key":"62_CR5","doi-asserted-by":"crossref","first-page":"77","DOI":"10.3233\/ICG-2005-28203","volume":"28","author":"K. Himstedt","year":"2005","unstructured":"Himstedt, K.: An Optimistic Pondering Approach for Asynchronous Distributed Game-Tree Search. ICGA Journal\u00a028(2), 77\u201390 (2005)","journal-title":"ICGA Journal"},{"key":"62_CR6","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, D.E., Moore, R.W.: An Analysis of Alpha-Beta Pruning. Artificial Intelligence\u00a06, 293\u2013326 (1975)","journal-title":"Artificial Intelligence"},{"key":"62_CR7","first-page":"255","volume":"87","author":"A. de Bruin","year":"1999","unstructured":"de Bruin, A., Plaat, A., Schaeffer, J., Pijls, W.: A minimax Algorithm better than SSS*. Artificial Intelligence\u00a087, 255\u2013293 (1999)","journal-title":"Artificial Intelligence"},{"key":"62_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-74413-6","volume-title":"Spielbaum-Suchverfahren","author":"A. Reinefeld","year":"1989","unstructured":"Reinefeld, A.: Spielbaum-Suchverfahren. Springer, Berlin (1989)"},{"issue":"2","key":"62_CR9","first-page":"47","volume":"14","author":"T.S. Anantharaman","year":"1991","unstructured":"Anantharaman, T.S.: Extension heuristics. ICCA Journal\u00a014(2), 47\u201363 (1991)","journal-title":"ICCA Journal"},{"key":"62_CR10","first-page":"65","volume-title":"Advances in Computer Chess 5","author":"D.F. Beal","year":"1989","unstructured":"Beal, D.F.: Experiments with the Null Move. In: Beal, D.F. (ed.) Advances in Computer Chess 5, pp. 65\u201379. Elsevier Science Publishers B.V., Amsterdam (1989)"},{"issue":"3","key":"62_CR11","first-page":"137","volume":"16","author":"C. Donninger","year":"1993","unstructured":"Donninger, C.: Null Move and Deep Search: Selective-search Heuristics for Obtuse Chess Programs. ICCA Journal\u00a016(3), 137\u2013143 (1993)","journal-title":"ICCA Journal"},{"issue":"1-2","key":"62_CR12","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(00)00081-5","volume":"252","author":"Y. Bj\u00f6rnsson","year":"2001","unstructured":"Bj\u00f6rnsson, Y., Marsland, T.A.: Multi-cut \u03b1\u03b2-pruning in game-tree search. Theoretical Computer Science\u00a0252(1-2), 177\u2013196 (2001)","journal-title":"Theoretical Computer Science"},{"issue":"11","key":"62_CR13","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1109\/34.42858","volume":"11","author":"J. Schaeffer","year":"1989","unstructured":"Schaeffer, J.: The History Heuristic and Alpha-Beta Search Enhancements in Practice. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a011(11), 1203\u20131212 (1989)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"62_CR14","first-page":"256","volume":"41","author":"C.E. Shannon","year":"1950","unstructured":"Shannon, C.E.: Programming a computer for playing chess. Philosophical Magazine\u00a041, 256\u2013275 (1950)","journal-title":"Philosophical Magazine"},{"key":"62_CR15","first-page":"82","volume-title":"Chess Skill in Man and Machine","author":"D.J. Slate","year":"1977","unstructured":"Slate, D.J., Atkin, L.R.: CHESS 4.5 \u2013 The Northwestern University chess program. In: Frey, P.W. (ed.) Chess Skill in Man and Machine, pp. 82\u2013118. Springer, Heidelberg (1977)"},{"key":"62_CR16","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/B978-0-08-026898-9.50007-3","volume-title":"Advances in Computer Chess 3","author":"J.H. Condon","year":"1982","unstructured":"Condon, J.H., Thompson, K.: Belle Chess Hardware. In: Clarke, M.R.B. (ed.) Advances in Computer Chess 3, pp. 45\u201354. Pergamon Press, Oxford (1982)"},{"key":"62_CR17","doi-asserted-by":"crossref","unstructured":"Berliner, H.: Hitech Chess: From Master to Senior Master with no Hardware Change. In: International Workshop on Industrial Applications of Machine Intelligence and Vision (MIV 1989), Tokyo, pp. 12\u201321 (1989)","DOI":"10.1109\/MIV.1989.40515"},{"key":"62_CR18","first-page":"8","volume-title":"Advances in Computer Chess 4","author":"R.M. Hyatt","year":"1986","unstructured":"Hyatt, R.M., Gower, A.E., Nelson, H.L.: Cray Blitz. In: Beal, D.F. (ed.) Advances in Computer Chess 4, pp. 8\u201318. Pergamon Press, Oxford (1986)"},{"issue":"2","key":"62_CR19","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1109\/40.755469","volume":"19","author":"F.-H. Hsu","year":"1999","unstructured":"Hsu, F.-H.: IBM\u2019s Deep Blue Chess grandmaster chips. IEEE Micro\u00a019(2), 70\u201381 (1999)","journal-title":"IEEE Micro"},{"key":"62_CR20","volume-title":"Behind Deep Blue: Building the Computer that Defeated the World Chess Champion","author":"F.-H. Hsu","year":"2002","unstructured":"Hsu, F.-H.: Behind Deep Blue: Building the Computer that Defeated the World Chess Champion. Princeton University Press, Princeton (2002)"},{"key":"62_CR21","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/978-1-4613-9080-0_5","volume-title":"Computers, Chess, and Cognition","author":"F.-H. Hsu","year":"1990","unstructured":"Hsu, F.-H., Anantharaman, T.S., Campbell, M.S., Nowatzyk, A.: Deep Thought. In: Marsland, T.A., Schaeffer, J. (eds.) Computers, Chess, and Cognition, pp. 55\u201378. Springer, Heidelberg (1990)"},{"issue":"3","key":"62_CR22","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1177\/109434200101500302","volume":"15","author":"I. Foster","year":"2001","unstructured":"Foster, I., Kesselman, C., Tuecke, S.: The Anatomy of the Grid: Enabling Scalable Virtual Organizations. International Journal of High Performance Computing Applications\u00a015(3), 200\u2013222 (2001)","journal-title":"International Journal of High Performance Computing Applications"},{"key":"62_CR23","unstructured":"Zobrist, A.L.: A Hashing Method with Applications for Game Playing. Technical Report 88. University of Wisconsin, Computer Sciences Department, Madison (1970)"},{"key":"62_CR24","unstructured":"Lim, Y.J.: On Forward Pruning in Game-Tree Search. PhD Thesis, National University of Singapore, Singapore (2007)"},{"issue":"1","key":"62_CR25","first-page":"4","volume":"7","author":"R.M. Hyatt","year":"1984","unstructured":"Hyatt, R.M.: Using Time Wisely. ICCA Journal\u00a07(1), 4\u20139 (1984)","journal-title":"ICCA Journal"},{"key":"62_CR26","first-page":"285","volume-title":"Advances in Computer Chess 7","author":"I. Alth\u00f6fer","year":"1994","unstructured":"Alth\u00f6fer, I., Donninger, C., Lorenz, U., Rottmann, V.: On Timing, Permanent Brain and Human Intervention. In: van den Herik, H.J., Herschberg, I.S., Uiterwijk, J.W.H.M. (eds.) Advances in Computer Chess 7, pp. 285\u2013296. University of Limburg, Maastricht (1994)"},{"issue":"3","key":"62_CR27","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/5666.5673","volume":"29","author":"P.J. Fleming","year":"1986","unstructured":"Fleming, P.J., Wallace, J.J.: How not to lie with statistics: the correct way to summarize benchmark results. CACM\u00a029(3), 218\u2013221 (1986)","journal-title":"CACM"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2008 \u2013 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85451-7_62","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T15:37:29Z","timestamp":1738337849000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85451-7_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540854500","9783540854517"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85451-7_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}