PROBCUT - AN EFFECTIVE SELECTIVE EXTENSION OF THE ALPHA-BETA ALGORITHM

被引:32
作者
BURO, M [1 ]
机构
[1] UNIV GESAMTHSCH PADERBORN,DEPT MATH & COMP SCI,D-33095 PADERBORN,GERMANY
来源
ICCA JOURNAL | 1995年 / 18卷 / 02期
关键词
D O I
10.3233/ICG-1995-18202
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
This article presents a new, game-independent selective extension of the alpha-beta algorithm. Based on the strong correlation between evaluations obtained from searches at different depths, it is shown how the result of a shallow search can be used to decide with a prescribed likelihood whether a deep search would yield a value outside the current search window. In its application to Othello, the technique is shown to be effective in investigating the relevant variations more deeply. It significantly increases the playing strength of an already strong brute-force Othello program.
引用
收藏
页码:71 / 76
页数:6
相关论文
共 10 条
[1]   SINGULAR EXTENSIONS - ADDING SELECTIVITY TO BRUTE-FORCE SEARCHING [J].
ANANTHARAMAN, T ;
CAMPBELL, MS ;
HSU, FH .
ARTIFICIAL INTELLIGENCE, 1990, 43 (01) :99-109
[2]  
ANANTHARAMAN T, 1990, ICCA J, V11, P135
[3]   A GENERALIZED QUIESCENCE SEARCH ALGORITHM [J].
BEAL, DF .
ARTIFICIAL INTELLIGENCE, 1990, 43 (01) :85-98
[4]  
BURO M, 1994, THESIS U PADERBORN G
[5]   ANALYSIS OF ALPHA-BETA PRUNING [J].
KNUTH, DE ;
MOORE, RW .
ARTIFICIAL INTELLIGENCE, 1975, 6 (04) :293-326
[6]   CONSPIRACY NUMBERS FOR MIN-MAX SEARCH [J].
MCALLESTER, DA .
ARTIFICIAL INTELLIGENCE, 1988, 35 (03) :287-310
[7]  
PALAY AJ, 1983, THESIS CARNEGIEMELLO
[8]  
PALAY AJ, 1985, SEARCHING PROBABILIT
[9]  
RIVEST R, 1988, ARTIF INTELL, V34, P77
[10]   A WORLD CHAMPIONSHIP CALIBER CHECKERS PROGRAM [J].
SCHAEFFER, J ;
CULBERSON, J ;
TRELOAR, N ;
KNIGHT, B ;
LU, P ;
SZAFRON, D .
ARTIFICIAL INTELLIGENCE, 1992, 53 (2-3) :273-289