Quantification of search-extension benefits

被引:12
作者
Beal, DF [1 ]
Smith, MC [1 ]
机构
[1] UNIV LONDON QUEEN MARY & WESTFIELD COLL,DEPT COMP SCI,LONDON E1 4NS,ENGLAND
来源
ICCA JOURNAL | 1995年 / 18卷 / 04期
关键词
D O I
10.3233/ICG-1995-18403
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
This paper considers several search-extension rules and one pruning rule that have been described in the literature. An experiment was performed to see how effective each rule was in isolation, and in various combinations. The experiment was performed on a fixed testset of positions, and results measured using node counts. The emphasis of the work was to make repeatable measurements on well-defined tasks, for future comparison with other search-extension rules. In the test domain chosen, some extension rules were strongly advantageous compared with fixed-depth search, but disadvantageous in combination with others. Notably, singular extensions were strongly beneficial if added to a fixed-depth search, but detrimental if added to a search already using check extensions, recaptures and null moves.
引用
收藏
页码:205 / 218
页数:12
相关论文
共 17 条
[1]   SINGULAR EXTENSIONS - ADDING SELECTIVITY TO BRUTE-FORCE SEARCHING [J].
ANANTHARAMAN, T ;
CAMPBELL, M ;
HSU, FH .
ICCA JOURNAL, 1988, 11 (04) :135-143
[2]   EXTENSION HEURISTICS [J].
ANANTHARAMAN, TS .
ICCA JOURNAL, 1991, 14 (02) :47-65
[3]   CONFIDENTLY SELECTING A SEARCH HEURISTIC [J].
ANANTHARAMAN, TS .
ICCA JOURNAL, 1991, 14 (01) :3-16
[4]  
Beal D.F., 1989, ADV COMPUTER CHESS, V5, P65
[5]  
BEAL DF, 1984, ICCA J, V7, P133
[6]  
BERLINER H, 1989, ADV COMPUTER CHESS, V5, P13
[7]  
BERLINER H, 1989, ADV COMPUTER CHESS, V5, P284
[8]  
BERLINER H, 1991, ADV COMPUTER CHESS, V6, P179
[9]   NULL MOVE AND DEEP SEARCH - SELECTIVE-SEARCH HEURISTICS FOR OBTUSE CHESS PROGRAMS [J].
DONNINGER, C .
ICCA JOURNAL, 1993, 16 (03) :137-143
[10]  
Goetsch G., 1990, COMPUTERS CHESS COGN, P159