[Aroutcheff 85] Atari en BASIC. Aroutcheff, P. Jeux et Stratégie, 31 (1985), 18-19.
[Becker 87] An Algorithm for Determining Certain Group Properties in the Game of Go. Becker, I. [CG], 5 (Winter 1987/88), 14-19.
[Benson 76] Life in the Game of Go. Benson, D. B. Information Sciences 10, (1976), 17-29. Also in [Levy 88], 203-213.
[Benson / Starkey 76] The Game of Go on the Computer. Benson, D. B.; Starkey, D. J. [NWACM 76], 216-221. (Also: Computerizing the Game of Go. Tech. rep. CS-76-31, Computer Science Dept., Washington State Univ., Pullman, 1976).
[Benson / Soule 77] Legal Go: A Formal Program Specification. Benson, D. B.; Soule, S. P. Tech. rep. CS-78-45, -46, -47, -49, Comp. Sci. Dept., Washington St. Univ., Pullman, 1977.
[Benson / Soule 79] The Formal Specification of a Database. Benson, D. B.; Soule, S. P. Tech. rep. CS-79-55, Comp. Sci. Dept., Washington St. Univ., Pullman, 1979.
[Benson / Hilditch / Starkey 79] Tree Analysis Techniques in Tsumego. Benson, D. B.; Hilditch, B. R.; Starkey, J. D. [IJCAI 79], 50-52. Also in
[Levy 88], 265-269.
[Benson 80] A Mathematical Analysis of Go. Benson, D. B. [Heine 80], 55-64.
[Beus 88] Local Iterated Analysis in Go. Beus, H. L. AAAI 1988 Spring Symp. on Computer Game Playing, Stanford Univ., 1988.
[Block 75] Axioms for Go. Block, H. C. SIGART Newsletter, 51 (April 1975), 13-14.
[Bradley 79] The Game of Go - The Ultimate Programming Challenge? Bradley, M. B. Creative Computing 5, 3 (March 1979), 89-99.
[Bramer 83] Computer Game-Playing: Theory and Practice. Bramer, M. A. (Ed.) Ellis Horwood Ltd., Chichester, West Sussex, 1983. (An extended and revised edition of the ACM SIGART Special Issue on Game-Playing, 80 (April 1982)). Æ [Brown 83], [Campbell 83], [Green 83], [Lehner 83], [Sander / Davies 83].
[Brown 77] A Computational Model of Reasoning. Brown, D. J. H. Report on Conf., Computer Society of South-Africa, 1977 (79?).
[Brown 78] Reasoning about Games. Brown, D. J. H. AISB Newsletter 32, (1978), 14-17.
[Brown 79a] Is Go Harder than Chess? Brown, D. J. H. Personal Computing 3, 12 (1979), 81-83.
[Brown 79b] Hierarchical Reasoning and the Game of Go. Brown, D. J. H.
[IJCAI 79], 114-116.
[Brown / Dowsey 79] The Challenge of Go. Brown, D. J. H.; Dowsey, S. New Scientist 81, (1979), 303-305.
[Brown 83] Seeing is Believing (or How to Make Sabaki). Brown, D. J. H.
[Bramer 83], 177-184.
[Campbell 83] Introduction to Go. Campbell, J. A. [Bramer 83], 136-140.
[CG] Computer Go. Erbach, D. W. (ed.). 71 Brixford Crescent, Winnipeg, Manitoba R2N 1E1, Canada. Æ [Becker 87], [Cobb 89], [Fotland 86], [Fotland 87], [Harker 87], [Hsu / Lin 89], [Kierulf 87a], [Kierulf 87b], [Kierulf 88], [Kraszek 88], [Langston 88], [Levy 87], [Ream 86], [Scarff 87],
[Shirayanagi 89], [White 88], [Wilcox 87], [Zimmerman 88].
[Chen 89] Group Identification in Computer Go. Chen, K. In [Levy / Beal 89], 195-210.
[Chen / Kierulf / Müller / Nievergelt 90] The Evolution of Go Explorer. Chen, K.; Kierulf, A.; Müller, M.; Nievergelt, J. In Computers, Chess, and Cognition, Springer Verlag, 1990.
[Cobb 89] Can You Play Go Against a Computer? A Philosophical Reflection. Cobb, W. S. [CG], 10 (Spring 1989), 22-23.
[DGZ] Deutsche Go-Zeitung. Deutscher Go Bund e.V., Postfach 60 54 54, D-2000 Hamburg 60, West Germany. Computer Go articles in issues 5/85, 2-3/86, 4-6/87, 3-4/88.
[Dowsey 73] Go and the Computer. Dowsey, S. Go Review 13, 3 (March 1973), 72-74. (In abbreviated form in SIGART Newsletter, 44 (Feb. 1974)).
[Evers 76] The Planning Structure for the Beginning Game of Go. Evers, P. V. [NWACM 76], 222-227.
[Fairbairn 84] 1984 Acornsoft Computer Go Tournament. Fairbairn, J. [GW], 35 (Spring 1984), 8-11.
[Fotland 86] The Program G2. Fotland, D. [CG] 1, 1 (Winter 1986/87), 10-16.
[Fotland 87] An Algorithm for Simple Ladders. Fotland, D. [CG] 1, 2 (Spring 1987), 5-7.
[Fraenkel 78] From Nim to Go. Fraenkel, A. S. Annals of Discrete Mathematics 6, (1978), 137-156. (Proc. Symp. on Combinatorial Math., Optimal Designs and their Applications, Colorado State University, Fort Collins; Srivastava, J. (Ed.))
[Friedenbach 80] Abstraction Hierarchies: A Model of Perception and Cognition in the Game of Go. Friedenbach, K. J. Ph.D. Thesis, Univ. of California, Santa Cruz, 1980 (Microfilm).
[Ginzberg 82] Decision Support Systems. Ginzberg, M. J.; Reitman, W.; Stohr, E. A. (Eds.) North-Holland Publ. Co., 1982. Æ [Reitman 82].
[Good 65] The mystery of Go. Good, I. J. New Scientist, 427 (January 21st, 1965), 172-174. Also in [Levy 88], 87-93.
[Gottschalk 72] Game Playing - The Ancient Game of Go. Gottschalk, G. F. Naval Postgraduate School, Monterey, CA, M.Sc. Thesis, (1971), 1-44 (Microfilm AD 741134).
[Green 83] Go and Artificial Intelligence. Green, H. S. [Bramer 83], 141-151.
[GW] Go World. Ishi Press, Tokyo, Japan. Æ [Fairbairn 84], [Kierulf / Nievergelt 85], [Wood 87].
[Haider 88] Anwendung von Verfahren des Maschinellen Lernens auf das japanische Brettspiel Go. Haider, C. Diplomarbeit, TU Berlin, 1988.
[Hamann 85a] Chronologie der Programmierung des japanischen Brettspiels GO - Eine Herausforderung an die Künstliche Intelligenz. Hamann, C. M. Angewandte Informatik (Vieweg, Braunschweig), 12 (1985), 501-511.
[Hamann 85b] Go-Spiel Projekt. Hamann, C. M. In: Einführung in das Programmieren in LISP. De Gruyter, Berlin-New York, (1985), 245-266.
[Hanner 59] Mean Play of Sums of Positional Games. Hanner, O. Pacific Journal of Mathematics 9, 1, 81-99, 1959.
[Harker 87] An Efficient Chain Search Algorithm. Harker, W. H. [CG] 1, 3 (Summer 1987), 8-11.
[Heine 80] Proc. of the 2nd Seminar on Scientific Go-Theory. Heine, K. (ed.) Institut für Strahlenchemie, Mühlheim a. d. Ruhr (1979), 1-126. Æ
[Benson 80], [Reitman / Wilcox 80].
[Hsu / Liu 89] The Design and Construction of the Computer Go Program Dragon II. Hsu, Sun-Chin; Liu, Dong-Yeh. [CG], 10 (Spring 1989), 10-19.
[IJCAI 79] Proc. of the 6th International Joint Conference on Artificial Intelligence (Tokyo, Japan, August 20-23, 1979). Æ [Benson / Hilditch / Starkey 79], [Brown 79b], [Reitman / Wilcox 80].
[Kerwin / Reitman 73] Video game #3: A Go protocol with comments. Kerwin, J.; Reitman, W. Unpubl. paper, Univ. of Michigan, Mental Health Research Institute, Communication No. 300, (1973).
[Kierulf / Merkle 84] A Smart Go Board. Kierulf, A.; Merkle, M. Unpubl. paper, Term Project ETH Zürich (April 1984).
[Kierulf / Nievergelt 85] Computer Go: A Smart Board and its Applications. Kierulf, A.; Nievergelt, J. [GW], 42 (Winter 1985/86), 62-64 & 53-54.
[Kierulf 85a] Smart Go Board: Algorithms for the Tactical Calculator. Kierulf, A. Diploma thesis (unpubl.), ETH Zürich (March 1985).
[Kierulf 87a] Computer Go Bibliography. Kierulf, A. Part 1 in [CG] 1, 1 (Winter 1986/87), 17-19; part 2 in [CG] 1, 3 (Summer 1987), 15-19.
[Kierulf 87b] Proposed Standard File Format for Go Games. Kierulf, A.
[CG] 1, 2 (Spring 1987), 10-23.
[Kierulf 87c] Human-Computer Interaction in the Game of Go. Kierulf, A. In "Methodologies for Intelligent Systems", Z. W. Ras, M. Zemankova (Eds.), North Holland, 1987 (Proc. 2nd International Symp. on Methodologies for Intelligent Systems, Charlotte, North Carolina, October 14-17, 1987), 481-487.
[Kierulf 88] Move Inversions in the Game of Go. Kierulf, A. [CG], 7 (Summer 1988), 12-16.
[Kierulf / Gasser / Geiser / Müller / Nievergelt / Wirth 91] A.Kierulf, R.Gasser, P.Geiser, M.Müller, J.Nievergelt, C.Wirth,Every interactive system evolves into hyperspace: The case of the Smart Game Board. Kierulf, A.; Gasser, R.; Geiser, P.; Müller, M.; Nievergelt, J. In: Proc. Hypertext / Hypermedia 1991, Maurer, H. (Ed.), Springer.
[Kierulf / Nievergelt 89] Swiss Explorer blunders its way into winning the first Computer Go Olympiad. Kierulf, A.; Nievergelt, J. In [Levy / Beal 89], 51-55.
[Kierulf / Chen / Nievergelt 90] Smart Game Board and Go Explorer: A case study in software and knowledge engineering. Kierulf, A.; Chen, K.; Nievergelt, J. To be published in Comm. ACM, (February 1990).
[Kim 78] On the Game of Go. Kim, J. B. Kyungpook Math. Journal, 1 (1978), 125-134.
[Kraszek 88] Heuristics in the Life and Death Algorithm of a Go-playing Program. Kraszek, J. [CG], 9 (Winter 1988-89), 13-24.
[Langston 88] Perception in Go as a Problem in Artificial Intelligence. Langston, R. [CG], 6 (Spring 88), 19-23.
[Lefkovitz 60] A Strategic Pattern Recognition Program for the Game Go. Lefkovitz, D. Univ. of Pennsylvania, The Moore School of Electrical Engineering, Wright Air Development Division, Tech. note 60 - 243 (1960), 1-92.
[Lehner 81] Planning in Adversity: A Computational Model of Strategic Planning in the Game of Go. Lehner, P. E. Univ. of Michigan, Ph.D. Thesis, (1981), 1-86 (Microfilm 8116280).
[Lehner 83] Strategic Planning in Go. Lehner, P. E. [Bramer 83], 167-176.
[Lenz 82] Die Semeai-Formel. Lenz, K.F. [DGZ] 57, 4 (July/August 1982).
[Levy 87] Computer Go Rules, A First Draft. Levy, D.N.L. [CG], 5 (Winter 1987/88), 20-24.
[Levy 88] Computer Games II. Levy, D.N.L. (Ed.) Springer Verlag, New York, 1988. Æ [Benson 76], [Benson / Hilditch / Starkey 79], [Good 65], [Mano 84], [Reitman 74], [Reitman / Wilcox 75, 78, 80], [Remus 62], [Thorp / Walden 64, 72], [Wilcox 78-84].
[Levy / Beal 89] Heuristic Programming in Artificial Intelligence - The First Computer Olympiad. Levy, D.N.L.; Beal, D.F. (Eds.) Ellis Horwood Ltd., Chichester, West Sussex, 1989. Æ [Chen 89], [Kierulf / Nievergelt 89].
[Lichtenstein / Sipser 78] GO is Polynomial-Space Hard. Lichtenstein, D.; Sipser, M. Journal ACM 27, 2 (April 1980), 393-401. (Also: IEEE Symp. on Foundations of Computer Science, (1978), 48-54).
[Liu 76] A Mathematical Theory of Wei-Chi (or the Game of Go). Liu, S. C. In: Memorial Volume to President Chiang Kai-Shek, Academia Sinica, Taipei, Taiwan, Rep. of China, (1976), 75-108.
[Liu 78] Discussion on an Earlier Paper on a Mathematical Theory of the Game of Wei-Chi (Go). Liu, S. C. In: Studies and Essays in Commemoration of the Golden Jubilee of Academia Sinica, Taipei, Taiwan, Rep. of China, (1978), 133-188.
[Mann 79] Computer Games - Analysis of a Game. Mann, B. Personal Computing 3, 6 (June 1979), 83-86.
[Mano 84] An Approach to Conquer Difficulties in Developing a Go Playing Program. Mano, Y. Journal of Information Processing 7, 2 (1984), 81-88. Also in [Levy 88], 248-264.
[Millen 81] Programming the Game of Go. Millen, J. K. BYT E 6, 4 (April 1981), 102-120.
[Miller 76] The End Game of Go. Miller, J. [NWACM 76], 228-233.
[Müller 90] The Smart Game Board as a Tool for Game Programmers. Müller, M. In: Heuristic Programming in Artificial Intelligence 2, Levy, D.N.L.; Beal, D.F. (Eds.), London 1990
[Müller 91] Measuring the performance of Go programs. Müller, M. In: Proc. International Go Congress, Beijing (to appear)
[NWACM 76] Proc. Northwest 76 ACM/CIPS Pacific Regional Symposium (Seattle Pacific College, Seattle, Washington, June 24-25, 1976). Æ [Benson / Starkey 76], [Evers 76], [Miller 76], [Tackett 76].
[Ream 86] Smart Go Boards. Ream, E. K. [CG] 1, 1 (Winter 1986/87), 8-9 & 16.
[Reitman 74] Goals and Plans in a Program for Playing Go. Reitman, W.; Kerwin, J.; Nado, R.; Reitman, J.; Wilcox, B. Proc. 29th Nat. Conf. ACM, (San Diego, California, Nov. 1974), 123-127. Also in [Levy 88], 182-191.
[Reitman / Wilcox 75] Perception and Representation of Spatial Relation in a Program for Playing Go. Reitman, W.; Wilcox, B. Proc. 30th Nat. Conf. ACM, (Minneapolis, Minnesota, October 20-22, 1975), 37-41. Also in [Levy 88], 192-202.
[Reitman / Wilcox 76] A Program for Playing Go: Interim Report. Reitman, W.; Wilcox, B. Univ. of Michigan, Ann Arbor, 1976.
[Reitman / Nado 78] Machine Perception: What Makes It So Hard for Computers to See? Reitman, W.; Nado, R.; Wilcox, B. [Savage 78], 65-87.
[Reitman / Wilcox 78] Pattern Recognition and Pattern-Directed Inference in a Program for Playing Go. Reitman, W.; Wilcox, B. [Waterman / Hayes 78], 503-523. Also in [Levy 88], 214-233.
[Reitman / Wilcox 79] Artificial Intelligence System for Policy Analysis and Planning: Modeling Tactical Analysis and Problem Solving in Go. Reitman, W.; Wilcox, B. Proc. of the 10th Annual Conference on Modeling and Simulation, Instrument Society of America, (Pittsburgh, 1979), 2133-2148. (Also: Univ. of Michigan, 1979).
[Reitman / Wilcox 80] The Structure and Performance of the Interim.2 Go Program. Reitman, W.; Wilcox, B. [Heine 80], 105-124. (Also [IJCAI 79], 711-719, and in [Levy 88], 234-247).
[Reitman 82] Applying Artificial Intelligence to Decision Support: Where do Good Alternatives come from? Reitman, W. [Ginzberg 82], 155-174.
[Remus 61] Lernversuche an der IBM 704. Remus, H. Lernende Automaten, (1961), 144-154.
[Remus 62] Simulation of a Learning Machine for Playing Go. Remus, H. Proc. of the International Federation of Information Processing Congress (Munich, Aug. 27-Sept. 1, 1962), 428-432. North-Holland Publ. Co., Amsterdam, 1963. Also in [Levy 88], 136-142.
[Robson 83] The Complexity of Go. Robson, J. M. Proc. IFIP (International Federation of Information Processing), (1983), 413-417.
[Ryder 71] Heuristic Analysis of Large Trees as Generated in the Game of Go. Ryder, J. L. Stanford Univ., Ph.D. Thesis, (1971), 1-298 (Microfilm 72-11, 654).
[Sander 79] A Strategic Approach to the Game of Go. Sander, P. T. M.Sc. Thesis, Univ. of Western Ontario, Dept. of Computer Science.
[Sander / Davies 83] A Strategic Approach to the Game of Go. Sander, P. T.; Davies, D. J. M. [Bramer 83], 152-166.
[Sanechika 79] Recent Development in Game Playing Programs. Sanechika, N. Information Processing 20, 7 (July 1979), 601-611 (in Japanese).
[Sanechika 81a] Notes on Modelling and Implementation of the Human Player's Decision Processes in the Game of Go. Sanechika, N.; Ohigashi, H.; Mano, Y.; Sugawara, Y.; Torii, K. Bul. Electrotech. Lab. 45, 1/2 (1981), 1-11.
[Sanechika 81b] A model of evaluating moves in the Game of Go. Sanechika, N. Proc. of the 22nd Convention of the Information Processing Society of Japan, 1981.
[Sanechika 82] Programming the Decision Processes in Go. Sanechika, N. Tech. rep. of IPSJ (June 1982) (in Japanese).
[Savage 78] Perception and Cognition. Savage, C. W. (Ed.) Univ. of Minnesota Press, Minneapolis, 1978. Æ [Reitman / Nado 78].
[Scarff 85] Intelligentes Go? Scarff, A. [DGZ], 5 (1985), 20-23.
[Scarff 87] Diary of a Professional Go Programmer. Scarff, A. [CG], 5 (Winter 1987/88), 14-19.
[Shirayanagi 89] A New Approach to Programming Go: Knowledge Representation and its Refinement. Shirayanagi, K. [CG], 11 (Summer 1989), 10-24.
[Soule 78a] The Implementation of a Go Board. Soule, S. Information Sciences 16, (1978), 31-40.
[Soule 78b] User-Directions of Go-Program. Soule, S. Univ. Calgari, 1978.
[Starkey 76] The X-O-O Heuristic in Game Tree Search. Starkey, J. D. Comp. Sc. Dept., Washington State Univ., Pullman, WA 99164.
[Starkey 81] An evaluation of the x-o-o heuristic. Starkey, J. D. Proc. of 1981 ACM Computer Science Conference (St. Louis, Missouri, Feb. 24-26, 1981), p. 27. ACM, New York, 1981, 77 pages.
[Stockmeyer / Chandra 79] Provably Difficult Combinatorial Games. Stockmeyer, L. J.; Chandra, A. K. SIAM Journal on Computing 8, (1979), 151-174.
[Sugawara / Sanechika 81] A Method to Recognize the Strength Situation in Go Program. Sugawara, Y.; Sanechika, N. 23rd National Conf. of IPSJ, (Oct. 1981) (in Japanese).
[Tackett 76] Pattern Recognition Approach to Tesuji Programming in Go. Tackett, M. [NWACM 76].
[Thorp / Walden 64] A Partial Analysis of Go. Thorp, E.; Walden, W. E. Computer Journal 7, 3 (1964), 203-207. Also in [Levy 88], 143-151.
[Thorp / Walden 70] A Computer Assisted Study of Go on M*N Boards. Thorp, E.; Walden, W. E. In: Theoretical Approaches to Non-Numerical Problem Solving. Banjerji, R.B.; Mesarovic, M.D. (Eds.) Springer, Berlin-Heidelberg-New York, (1970), 303-343.
[Thorp / Walden 72] A Computer Assisted Study of Go on M*N Boards. Thorp, E.; Walden, W. E. Information Sciences 4, 1 (1972), 1-33. Also in [Levy 88], 153-181.
[Ting 83] Go in Forth. Ting, C. H. Dr. Dobb's Journal, 83 (Sept. 1983), 54-60.
[Uhr 73] Programs for the Japanese Game Go. Uhr, L. In: Pattern Recognition, Learning, and Thought. Prentice-Hall, Englewood Cliffs, NJ, (1973), 230-248.
[Waterman / Hayes 78] Pattern-Directed Inference Systems. Waterman, D. A.; Hayes-Roth, F. (Eds.) Academic Press, New York, 1978. Æ [Reitman / Wilcox 78].
[Webster 84] A Go Board for the Macintosh. Webster, B. F. BYTE 9, 11 (Nov. 1984), 125-128 & 434-448.
[White 88] The Tele-Tsuke Story: History. White, R. [CG], 7 (Summer 1988), 17-20.
[Wilcox 77-79] Instant Go. Wilcox, B. [AGJ] 12, 5 (1977) - 14, 5/6 (1979).
[Wilcox 78-84] Computer Go. Wilcox, B. Reprint of [Wilcox 78a, 78b, 79a, 79b] in [Levy 88], 94-135.
[Wilcox 78a] You Think Programming Chess is Hard? Wilcox, B. [AGJ] 13, 4/6 (1978), 44-47.
[Wilcox 78b] Zobrist's Program. Wilcox, B. [AGJ] 13, 4/6 (1978), 48-51.
[Wilcox 79a] Ryder's Program. Wilcox, B. [AGJ] 14, 1 (1979), 23-28.
[Wilcox 79b] Computer Go - The Reitman-Wilcox Program. Wilcox, B. [AGJ] 14, 5/6 (1979), 23-41.
[Wilcox 85a] NEMESIS? He's the one not eating a sandwich. Wilcox, B.
[AGJ], (Spring 1985).
[Wilcox 85b] Reflections on Building Two Go Programs. Wilcox, B. SIGART Newsletter, 94 (Oct. 1985), 29-43.
[Wilcox 87] Issues in Joseki Processing. Wilcox, B. [CG] 1, 4 (Fall 1987), 18-23.
[Wilkins 79] Using Patterns and Plans to Solve Problems and Control Search. Wilkins, D. E. Stanford Univ., 1979.
[Wimmer 70] Programmierung von Go: Die Treppe. Wimmer, M. Österreichische Go-Zeitung, (1970).
[Wood 87] Interview with A. Scarff: The Bard of Computer Go. Wood, J.
[GW], 46 (Winter 1986/87), 9-13.
[Zimmerman 88] The Tele-Tsuke Story: Communications. Zimmerman, S. [CG], 7 (Summer 1988), 20-23.
[Zobrist 69] A Model of Visual Organization for the Game of Go. Zobrist, A. L. Proc. AFIPS 1969 Spring Joint Computer Conf. 34 (Boston, Mass., May 14-16, 1969), 103-112. AFIPS Press, Montvale, NJ, 1969.
[Zobrist 70a] Feature Extraction and Representation for Pattern Recognition and the Game of Go. Zobrist, A. L. Ph.D. Thesis, Univ. of Wisconsin, 1970, 1-152. (Microfilm 71-03, 162).
[Zobrist 70b] A New Hashing Method with Application for Game Playing. Zobrist, A. L. Tech. rep. 88, Univ. of Wisconsin, April 1970.
[Anantharaman 90] A Statistical Study of Selective Min-Max Search. Anantharaman, T.S. PhD thesis, Department of Computer Science, Carnegie-Mellon University, 1990.
[Beal 89] Advances in Computer Chess 5. Beal, D.F. (Ed.), North Holland, Amsterdam, 1989.
[Beal 90] A generalized Quiescence Search Algorithm. Beal, D.F. Artif. Intell. 43, 1 (1990), 85-98.
[Berliner / Goetsch / Campbell / Ebeling 89] Measuring the Performance Potential of Chess Programs. Berliner, H., Goetsch, G., Campbell, M. and Ebeling, C. [Beal 89].
[Clarke 82] Advances in Computer Chess 3. Clarke, M.R.B. (Ed.), Pergamon Press, Oxford, 1982.
[Hartmann 89] Notions of Evaluation Functions Tested Against Grandmaster Games. D.Hartmann. [Beal 89].
[Hsu 90] Deep Thought. Hsu, F.-h, Anantharaman, T.S., Campbell, M.S.and Nowatzyk, A. [Marsland 90].
[Hsu 90b] Large Scale Parallelisation of Alpha-Beta search: An Algorithmic and Architectural Study with Computer Chess. Hsu, F.-h. PhD thesis, Department of Computer Science, Carnegie-Mellon University, CMU-CS-90-108, 1990.
[Kaindl 88] Comparing Various Pruning Algorithms on Very Strongly Ordered Game Trees. Kaindl, H., Wagner, M., and Horacek, H., tech. report 50, Institut für Statistik und Informatik, University of Vienna, 1988.
[Kato 78] Kato's Attack and Kill. Kato, M., Ishi Press, Tokio, 1978.
[Kopec / Bratko 82] The Bratko-Kopec Experiment: A Comparison of Human and Computer Performance in Chess. Kopec, D., and Bratko, I. [Clarke 82]
[Marsland 85] Evaluation Function Factors. ICCA 8,2,47-57, 1985.
[Marsland 90] Computers, Chess, and Cognition. T.A.Marsland and J.Schaeffer (Editors).Springer Verlag,New York, 1990.
[Meulen 89] Weight Assessment in Evaluation Functions. M.v.d.Meulen. In
[Beal 89].
[Nitsche 82] A Learning Chess Program. In: [Clarke 82].
[Reinfeld 45] Win at Chess. Reinfeld, F., Dover Books, 1945.
[Schaeffer 86] Experiments in Search and Knowledge. J.Schaeffer .PhD thesis, Dept. of CS, Waterloo, 1986.
[Scheucher 89] Scheucher, A. and H.Kaindl, The Reason for the Benefits of Minimax Search. 11th IJCAI, 1989.
[Thompson 82] Computer Chess Strength, Thompson, K.[Clarke 82].