A WORLD CHAMPIONSHIP CALIBER CHECKERS PROGRAM

被引:81
作者
SCHAEFFER, J
CULBERSON, J
TRELOAR, N
KNIGHT, B
LU, P
SZAFRON, D
机构
[1] Department of Computing Science, University of Alberta, Edmonton
关键词
D O I
10.1016/0004-3702(92)90074-8
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The checkers program Chinook has won the right to play a 40-game match for the World Checkers Championship against Dr. Marion Tinsley. This was earned by placing second, after Dr. Tinsley, at the 1990 U.S. National Open, the biennial event used to determine a challenger for the championship. This is the first time a program has earned the right to contest for a human world championship. In an exhibition match played in December 1990, Tinsley narrowly defeated Chinook 7.5-6.5. This paper describes the program, the research problems encountered and our solutions. Many of the techniques used for computer chess are directly applicable to computer checkers. However, the problems of building a world championship caliber program force us to address some issues that have, to date, been largely ignored by the computer chess community.
引用
收藏
页码:273 / 289
页数:17
相关论文
共 35 条
[1]   SINGULAR EXTENSIONS - ADDING SELECTIVITY TO BRUTE-FORCE SEARCHING [J].
ANANTHARAMAN, T ;
CAMPBELL, MS ;
HSU, FH .
ARTIFICIAL INTELLIGENCE, 1990, 43 (01) :99-109
[2]   SINGULAR EXTENSIONS - ADDING SELECTIVITY TO BRUTE-FORCE SEARCHING [J].
ANANTHARAMAN, T ;
CAMPBELL, M ;
HSU, FH .
ICCA JOURNAL, 1988, 11 (04) :135-143
[3]  
ANANTHARAMAN TS, 1990, THESIS CARNEGIE MELL
[4]   A GENERALIZED QUIESCENCE SEARCH ALGORITHM [J].
BEAL, DF .
ARTIFICIAL INTELLIGENCE, 1990, 43 (01) :85-98
[5]  
BEAL DF, 1989, ADV COMPUTER CHESS, P65
[6]  
BERLINER H, 1979, P IJCAI 79 TOKYO, P53
[7]   BACKGAMMON COMPUTER-PROGRAM BEATS WORLD CHAMPION [J].
BERLINER, HJ .
ARTIFICIAL INTELLIGENCE, 1980, 14 (02) :205-220
[8]  
BRYANT M, 1990, COMMUNICATION
[9]  
CHERNEV I, 1981, COMPLEAT DRAUGHTS PL
[10]   FUNDAMENTAL-CONCEPTS IN SEARCH [J].
DONSKOY, MV .
ICCA JOURNAL, 1990, 13 (03) :133-137