SIGTPC (Panel Session)

Abstract

Authors of the programs competing in the Seventh Annual United States Computer Chess Championship will discuss the state of computer chess programming. Topics to be considered include chess oriented tree searching heuristics, tree searching heuristics that can also be used for more general problems, the pros and cons of exhaustive and selective searches, the present level of play and prospects for future improvement. An attempt will be made to summarize progress to date covering the time since the ACM tournament began in 1970.