Paper Info
Title
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.
Year
DOI
Venue
1976
10.1145/800191.805656
ACM Annual Conference
Keywords
Field
DocType
model curriculum subcommittee,education committee,current work,computer science,computer chess programming,selective search,panel session,general problem,acm curriculum committee,computer chess championship,earlier curriculum report,future improvement,common ground,seventh annual united states,present level,acm tournament,ieee computer society,correctness,lisp,compilers
Symbolic interpretation,Tournament,Programming language,Championship,Computer science,Correctness,Lisp,Compiler,Theoretical computer science,Heuristics,Computer chess
Conference
Citations 
PageRank 
References 
0
0.34
0
Authors
1
Name
Order
Citations
PageRank
Monroe M. Newborn117747.49