Games Playing with Computers

Overview

Contents

Introduction

1. Algorithms

2. Card Games

3. Board Games

4. Heuristics

5. Some Chess Programs

6. Practical Problems

7. Future Developments

Answers

References

Index

Return

This site is best viewed using a browser with either native SVG support or an SVG Plug-in

Access Key Details

References

1. C. L. Bouton; Annals of Mathematics, 1902, Series 2, vol. III, pp. 35-9.

2 E. H. Moore; Annals of Mathematics, 1910, Series 2, vol. XI, pp. 90-4.

3 D. Michie; 'Machines that play games', New Scientist, 1961, vol. 12, p. 367.

4 D. Michie; 'Mathematical Games', Scientific American, March 1962, pp. 138-44 (ed. M. Gardner).

5 R. Isaacs; 'Mathematical Games', Scientific American, December 1967, pp. 129-31 (ed. M. Gardner).

6 W. Riley; 'A Matching pennies demonstration program' (see also 5), ACM SICART Newsletter, February 1968, No.8, p.22.

7 F. G. Foster; 'Chemin-de-Fer ana1ysed', The Computer Journal, vol. 7, pp. 124-30.

8 E. Thorp; 'Beat the Dealer', TABS, 1967.

9 A. Samuel; 'Programming computers to play games', Advances in Computers, Academic Press, 1960, pp. 190-1.

10 A. G. Bell; 'How to program a computer to play legal chess', The Computer Journal, May 1970, vol. 13, No.2.

11 A. L. Samuel; 'Some Studies in Machine Learning using the Game of Checkers', IBM Journal of Research and Development, 1959, pp. 211-29, and 1967, pp. 601-17.

12 A. L. Zobrist; 'A Model of Visual Organisation for the game of GO', AFIPS, 1969, vol. 34, pp. 103-12.

13 H. Remus; 'Simulation of a learning machine for playing GO', Proc. IFlP Congress, 1962.

14 E. Thorp and W. Walden; 'A partial analysis of GO', The Computer Journal, 1964, vol. 7, No.3.

15 A. Bernstein and M. Roberts; 'Computer v. Chess-Player', Scientific American, June 1958.

16 H. Golombek; The Game Chess, Penguin, 1963.

17 A. Newell, H. Simon, and T. Shaw; 'Chess Playing Programs and the Problem of Complexity', IBM Journal of Research and Development, 1958, pp. 320-35.

18 A. Turing; Faster than Thought (ed. K. V. Bowden), Pitman, 1953, pp. 286-310.

19 J. Slagle and J. Dixon; 'Experiments with the M & N Tree-Searching Program', Comm. ACM., March 1970, vol. 13, No.3, pp. 147-54 (useful list of references).

20 F. R. A. Hopgood; Compiling Techniques, MacDonald Computer Monographs, 1969, pp. 19-28.

21 E. W. Elcock and A. M. Murray; 'Automatic description and recognition of board patterns', in Machine Intelligence 2 (eds E. Dale and D. Michie), Oliver and Boyd, 1968, pp. 75-88.

22 A. G. Bell; 'Kalah on Atlas', in Machine Intelligence 3 (ed. D. Michie), Oliver and Boyd, 1968, pp. 181-93.

23 N. A. Barricelli; 'Numerical Testing of Evolution Theories', parts 1,2, Acta Biotheor., Leiden XVI, pp. 69-98 and 100-26.

24 M. Gardner; Mathematical Puzzles and Diversions, G. Bell and Sons Ltd, 1961, pp. 143-5.

25 R. M. Freidberg; 'Learning Machine', parts 1 and 2, IBM Journal of Research and Development, 1958-9, vols 2 and 3, pp. 2-13 and 282-7.

26 L. Fogel; Artificial Intelligence through Simulated Evolution, John Wiley & Sons, 1966.

27 C. Shannon; 'Programming a Computer for Playing Chess', Philosophy Magazine, March 1950, pp. 356-75.

28 R. Greenblatt, D. Eastlake and S. Crocker; 'The Greenblatt Chess Program', AFlPS; FJCG, 31, pp. 801-10.

29 J. Scott; 'A Chess Playing Program', in Machine Intelligence 4 (ed. D. Michie), Oliver and Boyd, 1969, pp. 255-65.

30 1. J. Good; 'Analysis of the Machine Chess Game', in Machine Intelligence 4 (ed. D. Michie), Oliver and Boyd, 1969, pp. 267-9.

31 B. Huberman; A Program to Play Chess End Games, Computer Science Dept. Stanford University, Technical Report No. CS 106, August 1968.

32 J. W. L. Glaisher; Philosophical Magazine, December 1874.

33 A. G. Bell; 'Partitioning Integers in N dimensions', The Computer Journal, August 1970, pp. 278-83.

34 B. Fowler; 'Mathematical Games', Scientific American, pp. 163-6 (ed. M. Gardner), April 1963.

35 T. H. O'Beirne; 'Puzzle and Paradoxes', New Scientist, 27 July 1961, pp. 240-1.

36 H. E. Dudeney; Puzzles and Curious Problems (ed. M. Gardner), Fontana, 1967, p. 77.

37 S. Lin and T. Rado; 'Computer Studies of Turing Machine Problems', Journal ACM, April 1965, vol. 12, No.2, pp. 196-212.

38 M. W. Green; Proceedings of the 5th Annual Symposium on Switching Circuit and Logical Design, October 1964, pp. 91-4.

39 D. Gabor; Nature, 217, 584 and 1288 (1968).

40 C. Green; 'Application of theorem proving to problem solving' in Proc. Internat. Joint Corif. Artificial Intelligence, Washington, DC., May 1969.

41 G. Ernst and A. Newell; GPS: A case Study in Generality and Problem Solving, Academic Press, New York, 1969.

42 R. Fikes; 'REF-ARF: A System for Solving Problems Stated as Procedures', in Artificial Intelligence, 1970, vol. 1, pp. 27-120.

43 J. R. Manning; 'Algorithm 68', The Computer Journal, May 1971.