Abstract
Following the success of the Kotok/McCarthy Program at MIT, a new effort was initiated there by undergraduate Richard Greenblatt. When visiting Stanford in late 1966, Greenblatt saw a listing of the moves from one of the games of the match between the Kotok/McCarthy program and the Itep program and he became inspired to write a program of his own. He had a working program in a month, receiving help from Donald Eastlake and Stephen Crocker. In the spring of 1967, his creation, Mac Hack, participated in several tournaments against humans in the Boston area, earning a rating in the low fifteen-hundreds. In the middle 1960s, time sharing was in its infancy, and MIT had a large government grant to carry on research in this area. It was called “Project MAC,” where the MAC stood for “multiple access computing.”
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. D. Greenblatt, D. E. Eastlake, and S. D. Crocker, “The Greenblatt chess program,” Proceedings of the Fall Joint Computer Conference (Montvale, NJ: AFIPS Press, 1967), 801–10.
J. Moussouris, J. Holloway, and R. Greenblatt, “Cheops: a chess-oriented processing system,” in Machine Intelligence 9, eds. J. E. Hayes, D. Michie, and L. Mikulich (Chichester: Ellis Horwood, 1979), 351–60.
H. J. van den Herik, “An interview with Richard D. Greenblatt,” ICC A Journal 15, no. 4 (December 1992): 200–7.
R. D. Greenblatt, “Wedgeitude,” ICCA Journal 15, no. 4 (December 1992): 192–98.
D. Penrod, ed., Computer Chess Newsletter, Issue #1, 1977, p. 3 and Issue #2, 1977, p. 18.
A. L. Zobrist, “A hashing method with applications for game playing,” Technical Report 88, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, 1970. Reprinted in the ICCA Journal 13, no. 2 (1990): 69–73.
H. L. Nelson, “Hash tables in Cray Blitz,” ICCA Journal 8, no. 1 (March 1985): 3–13.
D. M. Breuker, J. W. H. M. Uiterwijk, and H. J. van den Herik, “Replacement schemes for transposition tables,” ICCA Journal 17, no. 4 (December 1994): 183–93.
T. Warnock and B. Wendroff, “Search tables in computer chess,” ICCA Journal 11, no. 1 (March 1988): 10–13.
S. S. Skiena, “An overview of machine learning in the context of chess,” ICCA Journal 9, no. 1 (March 1986): 20–28.
A. L. Zobrist and F. R. Carlson, “An advice-taking chess computer,” Scientific American 228, no. 6 (1973): 92–105.
R. S. Michalski and R G. Negri, “An experiment on inductive learning in chess endgames,” in Machine Intelligence 8, eds. E. W. Elcock and D. Michie, Ellis Horwood-Wiley, (1977): 175–192.
A. Shapiro and T. Niblett, “Automatic induction of classification rules for a chess endgame,” Advances in Computer Chess 3, ed. M. R. B. Clarke (New York: Pergamon Press, 1982): 73–92.
M. A. Bramer, “Machine-aided refinement of correct strategies for the endgame in chess,” Advances in Computer Chess 3, ed. M. R. B. Clarke (New York: Pergamon Press, 1982): 93–112.
A. D. de Groot, Thought and Choice in Chess, (The Hague: Mouton, 1965).
R. A. Levinson, “A self-learning pattern-oriented chess program,” ICCA Journal 12, no. 4 (December 1989): 207–15.
A. L. Samuel, “Some studies in machine learning using the game of checkers,” IBM Journal of Research and Development 3, no. 3 (1959): 211–29.
A. L. Samuel, “Some studies in machine learning using the game of checkers, II-Recent progress,” IBM Journal of Research and Development 11, no. 6 (1967): 801–17.
F.-h. Hsu, T. A. Anantharaman, M. S. Campbell, and A. Nowatzyk, “Deep Thought,” in Computers, Chess and Cognition, eds. T. A. Marsland and J. Schaeffer (New York: Springer-Verlag, 1990), 55–78.
A. van Tiggelen, “Neural networks as a guide to optimization,” ICCA Journal 14, no. 3 (September 1991): 115–18.
W. Tunstall-Pedoe, “Genetic algorithms optimizing evaluation functions,” ICCA Journal 14, no. 3 (September 1991): 119–28.
D. Slate, “A chess program that uses the transposition table to learn from experience,” ICCA Journal 10, no. 2 (1987): 59–71.
T Scherzer, L. Scherzer, and D. Tjaden Jr., “Learning in Bebe,” ICCA Journal 14, no. 4 (December 1991): 183–91.
R. Fine, Chess Endings (Philadelphia: David McKay, 1914).
Rights and permissions
Copyright information
© 1997 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Newborn, M. (1997). Mac Hack and Transposition Tables. In: Kasparov versus Deep Blue. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2260-6_4
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2260-6_4
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7477-3
Online ISBN: 978-1-4612-2260-6
eBook Packages: Springer Book Archive