Advances in Computer Chess 6
The 6th Advances in Computer Chess Conference was held at Queen Mary & Westfield College, London, United Kingdom, on August 23 and 24, 1990, in connection with the 2nd Computer Olympiad. ACC is the conference of the ICCA.
- Advances in Computer Chess 6
- Don Beal, Editor Juli 1991
- (Ellis Horwood Series in Artificial Intelligence)
- ISBN-13: 978-0130065377
 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.
- Rainer Feldmann, Peter Mysliwietz, Burkhard Monien (1991). A Fully Distributed Chess Program. pdf
- Mikhail Donskoy (1991). Fundamental Concepts in Search.
- Ingo Althöfer (1991). Selective trees and majority systems: two experiments with commercial chess computers.
- Dap Hartmann, Peter Kouwenhoven (1991). Sundry Computer Chess Topics.
- Victor Allis, Maarten van der Meulen, Jaap van den Herik (1991). Conspiracy-Number Search.
- László Lindner, Michael Schlosser (1991). New Ideas in Problem Solving and Composing Programs.
- Michael Schlosser (1991). Can a Computer Compose Chess Problems?
- Michael George, Jonathan Schaeffer (1991). Chunking for Experience.
- Nico Kuijf, Peter van Diepen (1991). Chess Database instead of Chess Literature.
- John Roycroft, Don Beal (1991). To Make Dumb Endgame Databases Speak.
- Alex van Tiggelen, Jaap van den Herik (1991). ALEXS: An Optimization Approach for the Endgame KNNKP(h).
- Hans Berliner, Danny Kopec, Ed Northam (1991). A taxonomy of concepts for evaluating chess strength: examples from two difficult categories. pdf preprint