Application and design of attack and defense algorithms in WTN chess of computer games

Abstract

The WTN Chess is a kind of important chess game in computer games. The attack and defense algorithms are the key points of WTN chess which are lacked of relative detail research at present. The paper provides practical and effective algorithms for making the relatively right choices to move chess pieces based on digital enumerations and static analysis strategies. At the same time, it also achieves an algorithm of situation assessment. According to many experimental data and results, attack and defense algorithms are demonstrated to be useful and effective in WTN chess.