Previous [ 1] [ 2] [ 3] [ 4] [ 5] [ 6] [ 7] [ 8] [ 9] [ 10] [ 11] [ 12] [ 13] [ 14] [ 15] [ 16] [ 17] [ 18] [ 19] [ 20] [ 21]

@

Journal of Information Science and Engineering, Vol. 30 No. 3, pp. 701-712 (May 2014)


Analysis of Performance of Consultation Methods in Computer Chess


KUNIHITO HOKI1, SEIYA OMORI2 AND TAKESHI ITO3
1The Center for Frontier Science and Engineering
2Department of Communication Engineering and Informatics
3Department of Information and Communication Engineering
University of Electro-Communications
Chofu, Tokyo 182-8585, Japan

The performance of consultation methods, i.e., majority voting, the optimistic selection rule, and the pseudo-random number (PRN) ensemble method, are examined in computer chess using 2180 chess problems. Here, the optimistic selection rule selects a program that returns the highest search value, and the PRN ensemble consists of multiple individual copies of one base program, and each copy is diversified by adding random numbers to the evaluation function of the base program. We carried out empirical experiments by using state-of-the-art chess-program Crafty as the base program. We found that the percentage of correct answers increased from 55.6 to 57.1% using optimistic selection from the PRN ensemble. The experimental results indicated that the consultation methods allowed simple yet effective distributed computing in chess.

Keywords: computer chess, chess problem, consultation method, majority voting, optimistic selection, pseudo-random number (PRN) ensemble

Full Text () Retrieve PDF document (201405_10.pdf)

Received February 28, 2013; accepted June 15, 2013.
Communicated by Hung-Yu Kao, Tzung-Pei Hong, Takahira Yamaguchi, Yau-Hwang Kuo, and Vincent Shin- Mu Tseng.