Computer chess: Algorithms and heuristics for a deep look into the future

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1338, Issue , 1997, Pages 1-18

  Feldmann, Rainer ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER HARDWARE; HARDWARE; INFORMATION SCIENCE; LEARNING ALGORITHMS; RECONFIGURABLE HARDWARE;

CHESS PROGRAM; COMPUTER CHESS; MADRID , SPAIN; MASSIVELY PARALLELS; PARALLEL SEARCH ALGORITHM; PARALLELIZATIONS; SEQUENTIAL ALGORITHM; SEQUENTIAL SEARCH ALGORITHM;

ALGORITHMS;

EID: 84958058890     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63774-5_94     Document Type: Conference Paper

References (67)

1. S. G. Akl, M. Newborn The principal continuation and the killer heuristic ACM Annual Conference, pp 466-473, 1977
2. S. G. Akl, D. T. Barnard, R. J Doran Design, Analysis and Implementation of a Parallel Tree Search Algorithm IEEE Transactions on Pattern Analysis and Machine Intelligence, 14(2), pp 192-2032 1982
3. L Althöfer On Pathology in Game Tree and Other Recursion Tree Models Habilitation thesis, University of Bielefeld, Germany, 1991
4. I. Althöfer A Parallel Game Tree Search Algorithm with a Linear Speedup Journal of Algorithms, 15(2), pp 175-198, 1993
5. T. S. Anantharaman, M. Campbell, F. H. Hsu Singular Extensions: Adding Selectivity to Brute-Force Searching ICCA Journal, 11(4), pp 135-143-1988.
6. T. S. Anantharaman Extension Heuristics ICCA Journal, 14(2), pp 47-63, 1991.
7. G. Baudet The Design and Analysis of Algorithms for Asynchronous Multiprocessors Phd thesis, Carnegie-Mellon University, Pittsburgh, USA, 1978
8. D. F. Beal Experiments with the Null Move Advances in Computer Chess V, D. F. Beal (ed.), pp 65-79, 1989.
9. D. F. Beal, M. C. Smith Quantification of Search-Extension Benefits ICCA Journal, 18(4), pp 205-218, 1995.
10. D. F. Beal, M. C. Smith Multiple Probes of Transposition Tables ICCA Journal, 19(4), pp 227-233, 1995.
11. H. J. Berliner The B Tree Search Algorithm: A Best-First Proof Procedure Artificial Intelligence, 12, pp 23-40, 1979
12. I Bratko, D. Kopec A Test for Comparison of Human and Computer Performance in Chess Advances in Computer Chess III, M. R. B. Clarke (ed.), Pergamon Press, pp 31-56, 1982
13. D. M. Breuker, J. W. H. M. Uiterwijk, H. J. van den Herik Replacement Schemes for Transposition Tables ICCA Journal, 17(4), pp 183-193, 1994.
14. D. M. Breuker, J. W. H. M. Uiterwijk, H. J. van den Herik Replacement Schemes and Two-Level Tables ICCA Journal, 19(3), pp 175-180, 1996
15. M. Buro ProbCut: An Effective Selective Extension of the (αβ – Algorithm tCCA Journal, 18(2), pp 71-76, 1995
16. C. Donninger Null Move and Deep Search ICCA Journal, 16(3), pp 137-143, 1993.
17. A. E. Elo The Rating of Chessplayers- Past and Present Arco Publishing, New York, 1978
18. R. Feldmann, B. Monien, P. Mysliwietz, O. Vornberger Distributed Game-Tree Search ICCA Journal, 12(2), pp 65-73, 1989
19. R. Feldmann, B. Monien, P. Mysliwietz, O. Vornberger Distributed Game Tree Search Parallel Algorithms for Machine Intelligence and Vision, V. Kumar, L. N. Kanal, P. S. Gopalakrishnan (eds.), Springer, pp 66-101, 1990
20. R. Feldmann, B. Monien, P. Mysliwietz A Fully Distributed Chess Program Advances in Computer Chess VI, D. F. Beal (ed.), pp 1-27, 1991
21. R. Feldmann, P. Mysliwietz, B. Monien Experiments with a Fully Distributed Chess Program Heuristic Programming in Artificial Intelligence 3, J. van den Herik, V. Allis (eds.), pp 72-87, 1992
22. R. Fetdmann, P. Mysliwietz, B. Monien Distributed 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-288, 1991
23. R. Feldmann Game Tree Search on Massively Parallel Systems Doctoral thesis, University of Paderborn, Germany, 1993
24. R. Feldmann, P. Mysliwietz, B. Monien Studying Overheads in Massively Parallel MIN/MAX-Tree Evaluation Proceedings of SPAA'94, pp. 94-103, 1994
25. R. Feldmann Fail 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-127, 1997
26. C. Ferguson, R. E. Korf Distributed Tree Search and its Application to Alpha-Beta Pruning Proceedings AAAI-88, 7th National Conference on Artificial Intelligence, 2, pp 128-132, 1988
27. R. A. Finkel, J. P. Fishburn Parallel Alpha-Beta Search on Arachne IEEE International Conference on Parallel Processing, pp 235-243, 1980
28. R. A. Finkel, J. P. Fishburn Parallelism in Alpha-Beta Search Artificial Intelligence, 19, pp 89-106, 1982
29. G. Goetsch, M. S. Campbell Experiments with the Null-Move Heuristic Computers, Chess, and Cognition, T. A. Marsland and J. Schaeffer (eds.), Springer, pp 159-168, 1990
30. F. H. Hsu Large Scale Parallellzation of Alpha-Beta Search: An Algorithmic Architectural Study with Computer Chess Phd. thesis, Carnegie Mellon University, Pittsburgh, USA, 1990
31. M. M. Huntbach, F. W. Burton Alpha-Beta Search on Virtual Tree Machines Information Sciences, 44, pp 3-17, 1988
32. R. M. Hyatt Parallel Chess on the Cray X-MP/48 ICCA Journal, 8(2), pp 90-99, 1985
33. R. M. Hyatt, B. W. Suter, H. L. Nelson A parallel alpha/beta tree searching algorithm Parallel Computing, No. 10, pp 299-308, 1989
34. G. Isenberg (author of IStCHESS), personal communication, February 1997
35. R. M. Karp, Y. Zhang On Parallel Evaluation of Game Trees Proceedings of SPAA'89, pp 409-420, 1989
36. D. E. Knuth, R. W. Moore An Analysis of Alpha-Beta Pruning Artificial Intelligence, 6, pp 293-326, 1975
37. H.-J. Kraas Zur Parallelislerung des SSS-Algorithmus Doctoral thesis, University of Braunschweig, Germany, 1990
38. B. C. Kuszmaul The Startech Massively-Parallel Chess Program ICCA Journal, 18(1), pp 3-19, 1995
39. R. Levinson, F-h. Hsu, J Schaeffer, T. A. Marsland, D. E. Wilkins The Role of Chess in Artificial Intelligence Research Proc. of the 12th IJCAI, Morgan Kaufman Publishers, pp 557-562, 1991
40. D. Levy, M. Newborn How Computers Play Chess Computer Science Press, 1991
41. D. Levy Crystal Balls: The Meta-Science of Prediction in Computer Chess ICCA Journal, 20(2), pp 71-78, 1997
42. U. Lorenz, V. Rottmann, R. Feldmann, P. Mysliwietz Controlled Conspiracy-Number Search ICCA Journal, 18(3), pp 135-147, 1997
43. U. Lorenz (author of ULYSSES, CHEIRON, CONNY), personal communication, 1997
44. T. A. Marsland, M. S. Campbell Parallel Search of Strongly Ordered Game Trees Computing Surveys, 14(4), pp 533-551, 1982
45. T. A. Marsland, F. Popowich Parallel Game Tree Search IEEE Transactions on Pattern Analysis and Machine Intelligence, 7(4), pp 442-452, 1985
46. T. A. Marsland, M. Olafsson, J. Schaeffer Multlprocessor Tree-Search Experiments Advances in Computer Chess IV, D. F. Beal (ed.), Pergamon Press, pp 37-51, 1986
47. D. A. McAtlester A New Procedure for Growing Min-Max Trees Artificial Intelligence, 35(3), pp 287-310, 1988
48. P. Mysliwietz Konstruktion und Optimierung yon Bewertungsfunktionen beim Schach Doctoral thesis, University of Paderborn, Germany, 1994
49. M. Newborn A Parallel Search Chess Program ACM Annual Conference 1985, pp 272-277, 1985
50. M. Newborn Unsynchronized Iterative Deepening Parallel Alpha-Beta Search IEEE Transactions on Pattern Analysis and Machine Intelligence, 10(5), pp 687-694, 1988
51. S. W. Otto, E. W. Felten Chess on a Hypercube The Third Conference on Hypercube Concurrent Computers and Applications, 2, pp 1329-1341, 1988
52. J. Pearl Heuristics: Intelligent Search Strategies for Computer Problem Solving Addison-Wesley Publishing Company, 1984
53. A. Reinefeld Spielbaum-Suchverfahren Springer, 1989
54. J. Schaeffer The History Heuristic and Alpha-Beta Search Enhancements in Practice IEEE Transactions on Pattern Analysis and Machine Intelligence, 11(11), pp 1203-1212, 1989
55. J. Schaeffer Distributed Game-Tree Searching Journal of Parallel and Distributed Computing, 6(2), pp 90-114, 1989
56. C. E. Shannon Programming a Computer for Playing Chess Philosophical Magazine 41, pp 256-275, 1950
57. G. Schriifer Minimax-Suchen Kosten, Qualitäit und Algorithmen Doctoral thesis, University of Braunschweig, Germany, 1988
58. A. M. Taring Digital Computers Applied to Games in B. V. Bowden: Faster than Thought: A Symposium on Digital Computing Machines, Pitman, pp 286-310, 1953
59. K. Thompson Computer Chess Strength Advances in Computer Chess III, M. R. B. Clarke (ed.), Pergamon Press, pp 55-56, 1982
60. A. Szabo, B. Szabo The technology curve revised ICCA Journal 11(1), 1988
61. J. v. Neumann, O. Morgenstern Theory of Games and Economic Behavior Princeton University Press, Princeton, USA, 1944
62. J. W. H. M. Uiterwijk The Countermove Heuristic ICCA Journal 15(1), pp 8-15, 1992
63. O. Vornberger, B. Monien Parallel Alpha-Beta versus Parallel SSS Proceedings IFIP Conference on Distributed Processing, North Holland, pp 613-625, 1987
64. T. Warnock, B. Wendroff Search Tables in Computer Chess ICCA Journal, 11(1), pp 10-13, 1988
65. J.-C. Weill The ABDADA Distributed Minlmax-Search Algorithm ICCA Journal, 19(1), pp 3-16, 1996
66. E. Zermelo Uber eine Anwendung der Mengenlehre auf die Theorie des Schachspiels 5. Int. Mathematikerkongrefi, Cambridge, 2, pp 510-504, 1912
67. A. L. Zobrist A New Hashing Method with Applications for Game Playing TR-88, University of Wisconsin, Computer Science Department Reprint in ICCA Journal 13(2), pp 69-73, 1990