Structures for Knowledge-Based Chess Programs
Conference paper
Abstract
At least since 1973/74, when H.Berliner published his articles, it became apparent to almost every chess programmer that conventional Shannontype chess programs suffer from structural shortcomings. Research on removal or reduction of these weaknesses proceeds into three general directions.
Keywords
Chess Player Abstract Theme Pawn Structure Chess Position Thematic Situation
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
Rerferences
- Berliner, H.J. Chess as Problem Solver Carnegie-Mellon Univ. Comp. Science Dept. 1974Google Scholar
- Botvinnik, M.M. Computers, Chess and Long-range Planning Heidelberg Science Library 1970CrossRefGoogle Scholar
- Chase, G., Simon, H.A. The Mind’s Eye in Chess in: Chase (ed.):Visual Information Processing Academic Press 1973Google Scholar
- DeGroot, A.D. Thought and Choice in Chess The Hague:Mouton 1965Google Scholar
- Euwe, M. Urteil und Plan im Schach de Gruyter 1967Google Scholar
- Kmoch, H. Die Kunst der Bauernführung Siegfried Engelhardt Verlag 1967Google Scholar
- v. Luck, K. Owsnicki, B. Strukturen des strategischen Schachspiels Univ. Hamburg (unpublished) 1980Google Scholar
- Nimzoviĉ, A. Mein System Das Schach-Archiv 1965Google Scholar
- Pitrat, J. A Chess Combination Program which uses Plans Art. Intell. 8 1977Google Scholar
- Schank, R.C. Abelson, R.P. Scripts, Plans, Goals and Understanding Lawrence ErlbaumGoogle Scholar
- Tan, S.T. Describing Pawn Structures in: Clarke (ed.):Advances in Computer Chess 1 Edinburgh Univ. Press 1977Google Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 1981