Name
Abstract | ||
|---|---|---|
Two papers will be presented and a general discussion period will then follow. The panel members are all members of the ACM Computer Chess Committee. The first paper, which appears elsewhere in the Proceedings, is the work of Tony Marsland. It is entitled “A survey of enhancements to the alpha-beta algorithm.” The paper reviews move ordering and search reduction techniques which improve the effectiveness of the alpha-beta algorithm when used in a chess program. A critical review of these search modifications is provided, and a recursive formula to estimate the search time is proposed, one which reflects the characteristics of the strongly ordered trees produced through improved use of the alpha-beta algorithm. |
Year | DOI | Venue |
|---|---|---|
1981 | 10.1145/800175.809845 | ACM Annual Conference |
Keywords | Field | DocType |
critical review,general discussion period,chess program,search time,alpha-beta algorithm,master level play,computer chess,tony marsland,search modification,search reduction technique,acm computer chess committee,paper review | Computer science,Artificial intelligence,Computer chess,Recursion | Conference |
ISBN | Citations | PageRank |
0-89791-049-4 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ben Mittman | 1 | 0 | 3.72 |
| Tony Marsland | 2 | 0 | 3.38 |
| Monroe M. Newborn | 3 | 177 | 47.49 |
| Kathe Spracklen | 4 | 0 | 0.68 |
| Ken Thompson | 5 | 595 | 218.28 |