{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:30:56Z","timestamp":1725467456186},"publisher-location":"Berlin, Heidelberg","reference-count":67,"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_94","type":"book-chapter","created":{"date-parts":[[2006,7,17]],"date-time":"2006-07-17T10:30:57Z","timestamp":1153132257000},"page":"1-18","source":"Crossref","is-referenced-by-count":1,"title":["Computer chess: Algorithms and heuristics for a deep look into the future"],"prefix":"10.1007","author":[{"given":"Rainer","family":"Feldmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,29]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"S.G. Akl, M. NewbornThe principal continuation and the killer heuristic ACM Annual Conference, pp 466\u2013473, 1977.","DOI":"10.1145\/800179.810240"},{"issue":"2","key":"1_CR2","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1109\/TPAMI.1982.4767226","volume":"14","author":"S. G. Akl","year":"1982","unstructured":"S. G. Akl, D. T. Barnard, R. J DoranDesign, Analysis and Implementation of a Parallel Tree Search Algorithm IEEE Transactions on Pattern Analysis and Machine Intelligence, 14(2), pp 192\u2013203, 1982","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"1_CR3","volume-title":"On Pathology in Game Tree and Other Recursion Tree Models","author":"I. Alth\u00f6fer","year":"1991","unstructured":"I. Alth\u00f6ferOn Pathology in Game Tree and Other Recursion Tree Models Habilitation thesis, University of Bielefeld, Germany, 1991"},{"issue":"2","key":"1_CR4","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1006\/jagm.1993.1037","volume":"15","author":"I. Alth\u00f6fer","year":"1993","unstructured":"I. Alth\u00f6ferA Parallel Game Tree Search Algorithm with a Linear Speedup Journal of Algorithms, 15(2), pp 175\u2013198, 1993","journal-title":"Journal of Algorithms"},{"issue":"4","key":"1_CR5","first-page":"135","volume":"11","author":"T.S. Anantharaman","year":"1988","unstructured":"T.S. Anantharaman, M. Campbell, F.H. HsuSingular Extensions: Adding Selectivity to Brute-Force Searching ICCA Journal, 11(4), pp 135\u2013143, 1988.","journal-title":"ICCA Journal"},{"issue":"2","key":"1_CR6","first-page":"47","volume":"14","author":"T. S. Anantharaman","year":"1991","unstructured":"T. S. AnantharamanExtension Heuristics ICCA Journal, 14(2), pp 47\u201363, 1991.","journal-title":"ICCA Journal"},{"key":"1_CR7","volume-title":"The Design and Analysis of Algorithms for Asynchronous Multiprocessors","author":"G. Baudet","year":"1978","unstructured":"G. BaudetThe Design and Analysis of Algorithms for Asynchronous Multiprocessors Phd thesis, Carnegie-Mellon University, Pittsburgh, USA, 1978"},{"key":"1_CR8","unstructured":"D.F. BealExperiments with the Null Move Advances in Computer Chess V, D.F. Beal (ed.), pp 65\u201379, 1989."},{"issue":"4","key":"1_CR9","first-page":"205","volume":"18","author":"D.F. Beal","year":"1995","unstructured":"D.F. Beal, M.C. SmithQuantification of Search-Extension Benefits ICCA Journal, 18(4), pp 205\u2013218, 1995.","journal-title":"ICCA Journal"},{"issue":"4","key":"1_CR10","first-page":"227","volume":"19","author":"D.F. Beal","year":"1995","unstructured":"D.F. Beal, M. C. SmithMultiple Probes of Transposition Tables ICCA Journal, 19(4), pp 227\u2013233, 1995.","journal-title":"ICCA Journal"},{"key":"1_CR11","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0004-3702(79)90003-1","volume":"12","author":"H. J. Berliner","year":"1979","unstructured":"H. J. BerlinerThe B* Tree Search Algorithm: A Best-First Proof Procedure Artificial Intelligence, 12, pp 23\u201340, 1979","journal-title":"Artificial Intelligence"},{"key":"1_CR12","unstructured":"I. Bratko, D. KopecA Test for Comparison of Human and Computer Performance in Chess Advances in Computer Chess III, M.R.B. Clarke (ed.), Pergamon Press, pp 31\u201356, 1982"},{"issue":"4","key":"1_CR13","first-page":"183","volume":"17","author":"D.M. Breuker","year":"1994","unstructured":"D.M. Breuker, J.W.H.M. Uiterwijk, H.J. van den HerikReplacement Schemes for Transposition Tables ICCA Journal, 17(4), pp 183\u2013193, 1994.","journal-title":"ICCA Journal"},{"issue":"3","key":"1_CR14","first-page":"175","volume":"19","author":"D.M. Breuker","year":"1996","unstructured":"D.M. Breuker, J.W.H.M. Uiterwijk, H.J. van den HerikReplacement Schemes and Two-Level Tables ICCA Journal, 19(3), pp 175\u2013180, 1996","journal-title":"ICCA Journal"},{"issue":"2","key":"1_CR15","first-page":"71","volume":"18","author":"M. Buro","year":"1995","unstructured":"M. Buro ProbCut: An Effective Selective Extension of the \u03b1\u03b2-Algorithm ICCA Journal, 18(2), pp 71\u201376, 1995","journal-title":"ICCA Journal"},{"issue":"3","key":"1_CR16","first-page":"137","volume":"16","author":"C. Donninger","year":"1993","unstructured":"C. DonningerNull Move and Deep Search ICCA Journal, 16(3), pp 137\u2013143, 1993.","journal-title":"ICCA Journal"},{"key":"1_CR17","volume-title":"The Rating of Chess-players, Past and Present","author":"A.E. Elo","year":"1978","unstructured":"A.E. EloThe Rating of Chess-players, Past and Present Arco Publishing, New York, 1978"},{"issue":"2","key":"1_CR18","first-page":"65","volume":"12","author":"R. Feldmann","year":"1989","unstructured":"R. Feldmann, B. Monien, P. Mysliwietz, O. VornbergerDistributed Game-Tree Search ICCA Journal, 12(2), pp 65\u201373, 1989","journal-title":"ICCA Journal"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"R. Feldmann, B. Monien, P. Mysliwietz, O. VornbergerDistributed Game Tree Search Parallel Algorithms for Machine Intelligence and Vision, V. Kumar, L.N. Kanal, P.S. Gopalakrishnan (eds.), Springer, pp 66\u2013101, 1990","DOI":"10.1007\/978-1-4612-3390-9_3"},{"key":"1_CR20","unstructured":"R. Feldmann, B. Monien, P. MysliwietzA Fully Distributed Chess Program Advances in Computer Chess VI, D.F. Beal (ed.), pp 1\u201327, 1991"},{"key":"1_CR21","unstructured":"R. Feldmann, P. Mysliwietz, B. MonienExperiments with a Fully Distributed Chess Program Heuristic Programming in Artificial Intelligence 3, J. van den Herik, V. Allis (eds.), pp 72\u201387, 1992"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"R. Feldmann, P. Mysliwietz, B. MonienDistributed Game Tree Search on a Massively Parallel System in: Data structures and efficient algorithms: Final report on the DFG special joint initiative, Springer, Lecture Notes on Computer Science 594, B. Monien, T. Ottmann (eds.), pp 270\u2013288, 1991","DOI":"10.1007\/3-540-55488-2_32"},{"key":"1_CR23","volume-title":"Game Tree Search on Massively Parallel Systems","author":"R. Feldmann","year":"1993","unstructured":"R. FeldmannGame Tree Search on Massively Parallel Systems Doctoral thesis, University of Paderborn, Germany, 1993"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"R. Feldmann, P. Mysliwietz, B. MonienStudying Overheads in Massively Parallel MIN\/MAX-Tree Evaluation Proceedings of SPAA'94, pp. 94\u2013103, 1994","DOI":"10.1145\/181014.192325"},{"key":"1_CR25","first-page":"111","volume-title":"Advances in Computer Chess VIII","author":"R. Feldmann","year":"1997","unstructured":"R. FeldmannFail High Reductions Advances in Computer Chess VIII, H.J. van den Herik, J.W.H.M. Uiterwijk (eds.), University of Maastrich, The Netherlands, pp 111\u2013127, 1997"},{"key":"1_CR26","first-page":"128","volume":"2","author":"C. Ferguson","year":"1988","unstructured":"C. Ferguson, R.E. KorfDistributed Tree Search and its Application to Alpha-Beta Pruning Proceedings AAAI-88, 7th National Conference on Artificial Intelligence, 2, pp 128\u2013132, 1988","journal-title":"Proceedings AAAI-88, 7th National Conference on Artificial Intelligence"},{"key":"1_CR27","unstructured":"R.A. Finkel, J.P. FishburnParallel Alpha-Beta Search on Arachne IEEE International Conference on Parallel Processing, pp 235\u2013243, 1980"},{"key":"1_CR28","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0004-3702(82)90022-4","volume":"19","author":"R.A. Finkel","year":"1982","unstructured":"R.A. Finkel, J.P. FishburnParallelism in Alpha-Beta Search Artificial Intelligence, 19, pp 89\u2013106, 1982","journal-title":"Artificial Intelligence"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"G. Goetsch, M.S. CampbellExperiments with the Null-Move Heuristic Computers, Chess, and Cognition, T.A. Marsland and J. Schaeffer (eds.), Springer, pp 159\u2013168, 1990","DOI":"10.1007\/978-1-4613-9080-0_9"},{"key":"1_CR30","volume-title":"Large Scale Parallelization of Alpha-Beta Search: An Algorithmic Architectural Study with Computer Chess","author":"F.H. Hsu","year":"1990","unstructured":"F.H. HsuLarge Scale Parallelization of Alpha-Beta Search: An Algorithmic Architectural Study with Computer Chess Phd. thesis, Carnegie Mellon University, Pittsburgh, USA, 1990"},{"key":"1_CR31","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0020-0255(88)90054-0","volume":"44","author":"M. M. Huntbach","year":"1988","unstructured":"M. M. Huntbach, F. W. BurtonAlpha \u2014 Beta Search on Virtual Tree Machines Information Sciences, 44, pp 3\u201317, 1988","journal-title":"Machines Information Sciences"},{"issue":"2","key":"1_CR32","first-page":"90","volume":"8","author":"R.M. Hyatt","year":"1985","unstructured":"R.M. HyattParallel Chess on the Cray X-MP\/48 ICCA Journal, 8(2), pp 90\u201399, 1985","journal-title":"ICCA Journal"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"R.M. Hyatt, B. W. Suter, H.L. NelsonA parallel alpha\/beta tree searching algorithm Parallel Computing, No. 10, pp 299\u2013308, 1989","DOI":"10.1016\/0167-8191(89)90102-6"},{"key":"1_CR34","unstructured":"G. Isenberg (author of Isichess), personal communication, February 1997"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"R. M. Karp, Y. ZhangOn Parallel Evaluation of Game Trees Proceedings of SPAA'89, pp 409-420, 1989","DOI":"10.1145\/72935.72979"},{"key":"1_CR36","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","volume":"6","author":"D.E. Knuth","year":"1975","unstructured":"D.E. Knuth, R. W. MooreAn Analysis of Alpha \u2014 Beta Pruning Artificial Intelligence, 6, pp 293\u2013326, 1975","journal-title":"Artificial Intelligence"},{"key":"1_CR37","volume-title":"Zur Parallelisierung des SSS*-Algorithmus","author":"H.-J. Kraas","year":"1990","unstructured":"H.-J. KraasZur Parallelisierung des SSS*-Algorithmus Doctoral thesis, University of Braunschweig, Germany, 1990"},{"issue":"1","key":"1_CR38","first-page":"3","volume":"18","author":"B. C. Kuszmaul","year":"1995","unstructured":"B. C. KuszmaulThe Startech Massively-Parallel Chess Program ICCA Journal, 18(1), pp 3\u201319, 1995","journal-title":"ICCA Journal"},{"key":"1_CR39","unstructured":"R. Levinson, F-h. Hsu, J Schaeffer, T.A. Marsland, D.E. WilkinsThe Role of Chess in Artificial Intelligence Research Proc. of the 12th IJCAI, Morgan Kaufman Publishers, pp 557\u2013562, 1991"},{"key":"1_CR40","unstructured":"D. Levy, M. NewbornHow Computers Play Chess Computer Science Press, 1991"},{"issue":"2","key":"1_CR41","first-page":"71","volume":"20","author":"D. Levy","year":"1997","unstructured":"D. LevyCrystal Balls: The Meta-Science of Prediction in Computer Chess ICCA Journal, 20(2), pp 71\u201378, 1997","journal-title":"ICCA Journal"},{"issue":"3","key":"1_CR42","first-page":"135","volume":"18","author":"U. Lorenz","year":"1997","unstructured":"U. Lorenz, V. Rottmann, R. Feldmann, P. MysliwietzControlled Conspiracy-Number Search ICCA Journal, 18(3), pp 135\u2013147, 1997","journal-title":"ICCA Journal"},{"key":"1_CR43","unstructured":"U. Lorenz (author of Ulysses, Cheiron, Conny), personal communication, 1997"},{"issue":"4","key":"1_CR44","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/356893.356895","volume":"14","author":"T.A. Marsland","year":"1982","unstructured":"T.A. Marsland, M.S. CampbellParallel Search of Strongly Ordered Game Trees Computing Surveys, 14(4), pp 533\u2013551, 1982","journal-title":"Computing Surveys"},{"issue":"4","key":"1_CR45","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, F. PopowichParallel 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":"1_CR46","unstructured":"T.A. Marsland, M. Olafsson, J. SchaefferMultiprocessor Tree-Search Experiments Advances in Computer Chess IV, D.F. Beal (ed.), Pergamon Press, pp 37\u201351, 1986"},{"issue":"3","key":"1_CR47","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0004-3702(88)90019-7","volume":"35","author":"D.A. McAllester","year":"1988","unstructured":"D.A. McAllesterA New Procedure for Growing Min-Max Trees Artificial Intelligence, 35(3), pp 287\u2013310, 1988","journal-title":"Artificial Intelligence"},{"key":"1_CR48","volume-title":"Konstruktion und Optimierung von Bewertungsfunktionen beim Schach","author":"P. Mysliwietz","year":"1994","unstructured":"P. MysliwietzKonstruktion und Optimierung von Bewertungsfunktionen beim Schach Doctoral thesis, University of Paderborn, Germany, 1994"},{"key":"1_CR49","doi-asserted-by":"crossref","unstructured":"M. NewbornA Parallel Search Chess Program ACM Annual Conference 1985, pp 272\u2013277, 1985","DOI":"10.1145\/320435.320515"},{"issue":"5","key":"1_CR50","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1109\/34.6777","volume":"10","author":"M. Newborn","year":"1988","unstructured":"M. NewbornUnsynchronized Iterative Deepening Parallel Alpha-Beta Search IEEE Transactions on Pattern Analysis and Machine Intelligence, 10(5), pp 687\u2013694, 1988","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"1_CR51","doi-asserted-by":"crossref","first-page":"1329","DOI":"10.1145\/63047.63088","volume":"2","author":"S. W. Otto","year":"1988","unstructured":"S. W. Otto, E. W. FeltenChess on a Hypercube The Third Conference on Hypercube Concurrent Computers and Applications, 2, pp 1329\u20131341, 1988","journal-title":"The Third Conference on Hypercube Concurrent Computers and Applications"},{"key":"1_CR52","unstructured":"J. PearlHeuristics: Intelligent Search Strategies for Computer Problem Solving Addison-Wesley Publishing Company, 1984"},{"key":"1_CR53","doi-asserted-by":"crossref","unstructured":"A. ReinefeldSpielbaum \u2014 Suchverfahren Springer, 1989","DOI":"10.1007\/978-3-642-74413-6"},{"issue":"11","key":"1_CR54","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1109\/34.42858","volume":"11","author":"J. Schaeffer","year":"1989","unstructured":"J. SchaefferThe History Heuristic and Alpha-Beta Search Enhancements in Practice IEEE Transactions on Pattern Analysis and Machine Intelligence, 11(11), pp 1203\u20131212, 1989","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"2","key":"1_CR55","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0743-7315(89)90044-0","volume":"6","author":"J. Schaeffer","year":"1989","unstructured":"J. SchaefferDistributed Game-Tree Searching Journal of Parallel and Distributed Computing, 6(2), pp 90\u2013114, 1989","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"1_CR56","first-page":"256","volume":"41","author":"C.E. Shannon","year":"1950","unstructured":"C.E. ShannonProgramming a Computer for Playing Chess Philosophical Magazine 41, pp 256\u2013275, 1950","journal-title":"Chess Philosophical Magazine"},{"key":"1_CR57","volume-title":"Minimax-Suchen Kosten, Qualit\u00e4t und Algorithmen","author":"G. Schr\u00fcfer","year":"1988","unstructured":"G. Schr\u00fcferMinimax-Suchen Kosten, Qualit\u00e4t und Algorithmen Doctoral thesis, University of Braunschweig, Germany, 1988"},{"key":"1_CR58","unstructured":"A.M. TuringDigital Computers Applied to Games in B.V. Bowden: Faster than Thought: A Symposium on Digital Computing Machines, Pitman, pp 286\u2013310, 1953"},{"key":"1_CR59","doi-asserted-by":"crossref","unstructured":"K. ThompsonComputer Chess Strength Advances in Computer Chess III, M.R.B. Clarke (ed.), Pergamon Press, pp 55\u201356, 1982","DOI":"10.1016\/B978-0-08-026898-9.50008-5"},{"key":"1_CR60","doi-asserted-by":"crossref","unstructured":"A. Szabo, B. SzaboThe technology curve revised ICCA Journal 11(1), 1988","DOI":"10.3233\/ICG-1988-11104"},{"key":"1_CR61","volume-title":"Theory of Games and Economic Behavior","author":"J. Neumann v.","year":"1944","unstructured":"J. v. Neumann, O. MorgensternTheory of Games and Economic Behavior Princeton University Press, Princeton, USA, 1944"},{"issue":"1","key":"1_CR62","first-page":"8","volume":"15","author":"J.W.H.M. Uiterwijk","year":"1992","unstructured":"J.W.H.M. UiterwijkThe Countermove Heuristic ICCA Journal 15(1), pp 8\u201315, 1992","journal-title":"ICCA Journal"},{"key":"1_CR63","unstructured":"O. Vornberger, B. MonienParallel Alpha-Beta versus Parallel SSS* Proceedings IFIP Conference on Distributed Processing, North Holland, pp 613\u2013625, 1987"},{"issue":"1","key":"1_CR64","first-page":"10","volume":"11","author":"T. Warnock","year":"1988","unstructured":"T. Warnock, B. WendroffSearch Tables in Computer Chess ICCA Journal, 11(1), pp 10\u201313, 1988","journal-title":"ICCA Journal"},{"issue":"1","key":"1_CR65","first-page":"3","volume":"19","author":"J.-C. Weill","year":"1996","unstructured":"J.-C. WeillThe ABDADA Distributed Minimax-Search Algorithm ICCA Journal, 19(1), pp 3\u201316, 1996","journal-title":"ICCA Journal"},{"key":"1_CR66","first-page":"510","volume":"2","author":"E. Zermelo","year":"1912","unstructured":"E. Zermelo \u00dcber eine Anwendung der Mengenlehre auf die Theorie des Schachspiels 5. Int. Mathematikerkongre\u00df, Cambridge, 2, pp 510\u2013504, 1912","journal-title":"5. Int. Mathematikerkongre\u00df, Cambridge"},{"key":"1_CR67","doi-asserted-by":"crossref","unstructured":"A.L. ZobristA New Hashing Method with Applications for Game Playing TR-88, University of Wisconsin, Computer Science Department Reprint in ICCA Journal 13(2), pp 69\u201373, 1990","DOI":"10.3233\/ICG-1990-13203"}],"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_94","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T22:05:19Z","timestamp":1555711519000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63774-5_94"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637745","9783540696452"],"references-count":67,"URL":"https:\/\/doi.org\/10.1007\/3-540-63774-5_94","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}