基於工作層級運算系統開發主動式開局庫之研究

Computer Chinese chess programs usually a passive opening book in the opening phase. One important issue is early drop-out due to some moves rarely played. This thesis focuses on improving this situation. We use Job-Level Alpha-Beta Search (JL-ABS) to verify an opening book that is based on a tree structure, and propose a method that actively adds nodes to the tree. The method is run on a job-level computation system to increase the construction efficiency. The experiment result shows that more moves we add to an opening book, less serious the early drop-out situation is.

並列關鍵字

Job-level computation system ； Active opening book

參考文獻

[1] Chen, J.-C., Wu, I.-C., Tseng, W.-J., Lin, B.-H., Chang, C.-H., "Job-Level Alpha-Beta Search," IEEE Transactions on Computational Intelligence and AI in Games, vol. 7(1), pp. 28-38, 2005.

[3] Knuth, D.E. and Moore, R.W., "An Analysis of Alpha-Beta Pruning," Artificial Intelligence, vol. 6(4), pp. 293-326, 1975.

[4] Lincke T.R., "Strategies for the Automatic Construction of Opening Books," the International Conference on Computers and Games (CG 2000), LNCS, vol. 2063, pp. 74-86. Springer, 2000.

[5] Wu, I.-C., Chen, C.-P., Lin, P.-H., Huang, K.-C., Chen, L.-P., Sun, D.-J., Chan, Y.-C., and Tsou, H.-Y., "A Volunteer-Computing-Based Grid Environment for Connect6 Applications," the 12th IEEE International Conference on Computational Science and Engineering (CSE-09), August 29-31, Vancouver, Canada, 2009.

參考文獻

Google Scholar

國際替代計量

基於工作層級運算系統開發主動式開局庫之研究

未授權

主題瀏覽