DocumentCode :
176778
Title :
Analysis of search algorithm in computer game of Amazons
Author :
Qiu Hongkun ; Zhang Peng ; Wang Yajie ; Wu Jiehong ; Li Fei
Author_Institution :
Eng. Training Center, Shenyang Aerosp. Univ., Shenyang, China
fYear :
2014
fDate :
May 31 2014-June 2 2014
Firstpage :
3947
Lastpage :
3950
Abstract :
Computer game is a new research field. This paper described rules of the Amazons and discussed some popular searching technologies in computer game of Amazons, such as the PVS algorithm, MTD-f algorithm and MTD-bi (bisection) algorithm. Then a series of experiments were done to measure their effectiveness and efficiency. The experimental results of performance testing revealed that sorting orders can increase performance of each algorithm in computer game of amazons, but PVS gets faster and performs better comparatively. And it had been verified in the National Computer Games Tournament.
Keywords :
computer games; search problems; sorting; Amazons computer game; MTD-bi algorithm; MTD-bisection algorithm; MTD-f algorithm; PVS algorithm; memory-enhanced test driver algorithm; move order sorting; national computer games tournament; principal variation search algorithm; search algorithm analysis; Computer Game; MTD-bi; MTD-f; PVS;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Control and Decision Conference (2014 CCDC), The 26th Chinese
Conference_Location :
Changsha
Print_ISBN :
978-1-4799-3707-3
Type :
conf
DOI :
10.1109/CCDC.2014.6852870
Filename :
6852870
Link To Document :
بازگشت