Skip to main content

What Happened with AI’s Drosophila?

  • Conference paper
Österreichische Artificial Intelligence-Tagung

Part of the book series: Informatik-Fachberichte ((2252,volume 106))

  • 30 Accesses

Abstract

This paper analyses the relations of artificial inteLLigence and computer chess (its former “drosophila”). First, it reviews the recent history. Then some controversial issues are discussed (search paradigms, benefits of minimax Lookahead and. if programs understand the game of chess). Moreover, the experience with our own chess program (MERLIN) is used to give some insight into the role of knowledge here, cLassifiying it into “dynamic” and “static” knowledge.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Beal. D.F. (1982) Benefits of minimax search, in: Advances in Computer Chess 3 (ed. M.R.B. Clarke). pp. 17–24. Pergamon Press. 1982.

    Google Scholar 

  • Berliner. H.J. (1973) Some Necessary Conditions for a Master Chess Program. in Proc. IJCAI-73. Stanford. August 1973. 77–85.

    Google Scholar 

  • Berliner. H.J. (1974) Chess as problem solving: The development of a tactics analyser. Ph.D.Dissertation. Computer Science Dep.. Carnegie-Mellon University. Pittsburgh.

    Google Scholar 

  • Berliner. H.J. (1978) A chronology of computer chess and its Literature. in Artificial Intelligence 10. 201–214.

    Google Scholar 

  • Berliner, H.J. (1979) The B Tree Search Algorithm: A Best-First Proof Procedure. in Artificial Intelligence 12. 23–40.

    Google Scholar 

  • Berliner, H.J. (1981) An Examination of Brute Force Intelligence. in Proc. IJCAI-81. Vancouver. August 1981. 581–587.

    Google Scholar 

  • Berliner. H.J., M.Campbell (1984) Using Chunking to Solve Chess Pawn Endgames. in Artificial Intelligence 23. 97–120.

    Google Scholar 

  • Condon. J.H., K.Thompson (1982) Belle Chess Hardware. in Advances in Computer Chess 3 (ed.M.R.B.CLarke). Pergamon Press Ltd. 45–54.

    Google Scholar 

  • Greenblatt. R.D., D.E.Eastlake, S.D.Crocker (1967) The Greenblatt Chess Program. FJCC. vol 31. pp. 801–810.

    Google Scholar 

  • Horacek. H. (1983) Knowledge-based move selection and evaluation to guide the search in chess pawn endings, in ICCA Journal 6(3). August 1983. 20–37.

    Google Scholar 

  • Hyatt. R.M. (1984) Cray Blitz versus David Levy. in ICCA Journal 7(2). June 1984. 102–105.

    Google Scholar 

  • Kaindl. H. (1982a) Positional Long-range planning in computer chess. in Advances in Computer Chess 3 (ed.M.R.B.CLarke). Pergamon Press Ltd. 145–167.

    Google Scholar 

  • Kaindl, H. (1982b) Dynamic Control of the Quiescence Search in Computer Chess, in Proc. EMCSR-82. Vienna, April 1982, 973–978.

    Google Scholar 

  • Kaindi, H. (1983) Searching to Variable Depth in Computer Chess, in Proc. IJCAI-83. Karlsruhe, August 1983, 760–762.

    Google Scholar 

  • Knuth, D.E., R.W.Moore (1975) An Analysis of Alpha-Beta Pruning, in Artificial Intelligence 6, 293–326.

    Google Scholar 

  • Kopec, D., I.Bratko (1982) The Bratko-Kopec experiment: a test of some well-known hypothesis about computer chess, in Advances in Computer Chess 3 (ed.M.R.B.CLarke). Pergamon Press Ltd.

    Google Scholar 

  • Levy, D.N.L. (1984) Chess Master versus Computer, in ICCA Journal 7(2), June 1984, 106–117.

    Google Scholar 

  • Minsky, M. (1963) Steps Toward Artificial Intelligence, in Computers and Thought, (eds. Feigenbaum, Feldman ), McGraw-Hill.

    Google Scholar 

  • Neu, D.S. (1982) An investigation of the causes of pathology in games, Artificial Intelligence 19 (1982) 257–278.

    Article  Google Scholar 

  • Palay, A.J. (1983) Searching with Probabilities, Ph. D. Dissertation, Computer Science Department, Carnegie Mellon University, May 1983.

    Google Scholar 

  • Pearl, J. (1983) On the nature of pathology in game searching, Artificial Intelligence 20 (1983) 427–453.

    Article  MathSciNet  MATH  Google Scholar 

  • Reinfeld, F. (1945) Win at Chess, Dover Books, 1945.

    Google Scholar 

  • Shannon, C.E. (1950) Programming a computer for playing chess. Phil.Mag. 41, 256–275.

    MathSciNet  MATH  Google Scholar 

  • Slate, D.J., L.R.Atkin (1977) CHESS 4.5 - The Northwestern University chess program, in Chess skill in man and machine (ed.P.W.Frey) Springer-Verlag, N.Y.

    Google Scholar 

  • Szabo, A (1984) Computer Chess Tactics and Strategy, Master’s Thesis, University of British Columbia, February 1984.

    Google Scholar 

  • Wilkins, D. (1980) Using Patterns and Plans in Chess, in Artificial Intelligence 14, 165–203.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kaindl, H. (1985). What Happened with AI’s Drosophila?. In: Trost, H., Retti, J. (eds) Österreichische Artificial Intelligence-Tagung. Informatik-Fachberichte, vol 106. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46552-9_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-46552-9_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15695-6

  • Online ISBN: 978-3-642-46552-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics