Advances in computer chess 6
Author(s)
Bibliographic Information
Advances in computer chess 6
Ellis Horwood, 1991
Available at / 1 libraries
-
No Libraries matched.
- Remove all filters.
Note
Ellis Horwood series in artificial intelligence
Bibliography: p190-191
Description and Table of Contents
Description
This book is based on the proceedings of the latest international conference on computer chess which was held in London in August 1990. It includes discussions on search algorithms, evaluation techniques, learning by simulated genetic evolution, computer composition of elegant chess problems, and looks at attempts to use human-like pattern recognition in place of brute-force computation. Aimed at a wide readership it will be of interest not only to the scientific community in artificial intelligence and cognition but also to chess players and those who create their own chess-playing programs - whether for competitive purposes or as a hobby.
Table of Contents
- A fully distributed chess program
- fundamental concepts in search
- selective trees and majority systems - two experiments with commercial chess computers
- sundry computer chess topics
- alpha-beta conspiracy number search
- new ideas in the field of problem-solving and composing programs
- can a computer compose chess problems?
- chunking for experience
- to make dumb endgame databases speak
- ALEXS - genetic-learning optimization for KNNKP(h)
- a taxonomy of concepts for evaluating chess strength - examples from two difficult categories.
by "Nielsen BookData"