The Analysis and Design of WTN Chess Algorithm

Article Preview

Abstract:

Recently,WTN chess is just emerging as a computer game of Artificial Intelligence Competition in China which lacks of algorithm research. This article attempts to research how to get rid of randomness in the game of WTN chess and lets the program make the right choice to analysis and return a relatively best solution.This article also achieves a greedy algorithm based on enumeration and offensive strategies, and provides an algorithm of situation assessment.It is demonstrated that the algorithm is effective.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1696-1700

Citation:

Online since:

February 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Xinhe Xu, Jiao Wang. Key Technologies Analysis of Chinese Chess Computer Game. [J], 2006, 27(6): 961-969.

Google Scholar

[2] Xinhe Xu. From Computer Game To Robot Soccer: The Long and Durable Challenge of Artificial Intelligence[J]. The Technology and Application Of Robot, 2010(1): 10-13. In Chinese.

Google Scholar

[3] Althöfer, I. On the origins of EinStein würfelt nicht![EB/OL]. Http: /www. althofer. de/origins-of-ewn. html.

Google Scholar

[4] Jiao Wang, Xinhe Xu. Computer Game: The Frontier Field Of Artificial Intelligence: University Computer Games Championship & National Computer Games Tournament[J]. Computer Education, 2012(7): 14-18. In Chinese.

Google Scholar

[5] Li shuqin, Li Dongming Yuan xiaohua. Research and Implementation of Dots-and-Boxes Game System. Journal of software, 2012, 7(2): 256-262.

Google Scholar