Alpha-Beta-Conspiracy Search
暂无分享,去创建一个
We introduce a variant of-search in which each node is associated with two depths rather than one. The purpose of-search is to nd strategies for each player that together establish a value for the root position. A max strategy establishes a lower bound and the min strategy establishes an upper bound. It has long been observed that forced moves should be searched more deeply. Here we make the observation that in the max strategy we are only concerned with the forcedness of max moves and in the min strategy we are only concerned with the forcedness of min moves. This leads to two measures of depth | one for each strategy | and to a two depth variant of-called ABC search. The two depth approach can be formally derived from conspiracy theory and the structure of the ABC procedure is justiied by two theorems relating ABC search and conspiracy numbers.
[1] A. V. Uskov,et al. Programming a computer to play chess , 1970 .
[2] Hermann Kaindl,et al. Searching to Variable Depth in Computer Chess , 1983, IJCAI.
[3] Murray Campbell,et al. Singular Extensions: Adding Selectivity to Brute-Force Searching , 1990, Artif. Intell..
[4] David A. McAllester. Conspiracy Numbers for Min-Max Search , 1988, Artif. Intell..
[5] D. Kopec. Advances in Man-Machine Play , 1990 .