EXTENSION HEURISTICS

被引:20
作者
ANANTHARAMAN, TS [1 ]
机构
[1] TUDOR INVEST CORP,GREENWICH,CT
来源
ICCA JOURNAL | 1991年 / 14卷 / 02期
关键词
D O I
10.3233/ICG-1991-14202
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
This article lists a number of extension heuristics which will be evaluated in terms of the performance metric described in Anantharaman (1991), specifically that of line 11 in Table 2. The heuristics have all been implemented in the Deep Thought program used for the experiments, but not all are present in the (older) version of Deep Thought that was used to earn a USCF rating of 2551 in tournament games against human players. After describing each heuristic algorithmically, some implementation details are provided where appropriate, and finally the experimental result for the heuristic is discussed. All experimental results are tabulated in an Appendix.
引用
收藏
页码:47 / 65
页数:19
相关论文
共 15 条
[1]   SINGULAR EXTENSIONS - ADDING SELECTIVITY TO BRUTE-FORCE SEARCHING [J].
ANANTHARAMAN, T ;
CAMPBELL, M ;
HSU, FH .
ICCA JOURNAL, 1988, 11 (04) :135-143
[2]   CONFIDENTLY SELECTING A SEARCH HEURISTIC [J].
ANANTHARAMAN, TS .
ICCA JOURNAL, 1991, 14 (01) :3-16
[3]  
ANANTHARAMAN TS, 1988, ICCA J, V43, P99
[4]  
ANANTHARAMAN TS, 1990, CMUCS90173 CARN U RE
[5]  
Beal D.F., 1989, ADV COMPUTER CHESS, V5, P65
[6]   B-STAR TREE SEARCH ALGORITHM - BEST-1ST PROOF PROCEDURE [J].
BERLINER, H .
ARTIFICIAL INTELLIGENCE, 1979, 12 (01) :23-40
[7]  
BERLINER H, 1989, ADV COMPUTER CHESS, V5, P13
[8]  
ENDERTON B, 1987, COMMUNICATION
[9]   HOW TO EXTRACT RELEVANT KNOWLEDGE FROM GRANDMASTER GAMES .1. GRANDMASTERS HAVE INSIGHTS - THE PROBLEM IS WHAT TO INCORPORATE INTO PRACTICAL PROGRAMS [J].
HARTMANN, D .
ICCA JOURNAL, 1987, 10 (01) :14-36
[10]  
HSU FH, 1987, COMMUNICATION