Chinese chess-QT

Because I was very interested in chess AI at that time, I simply re-developed one by practicing QT.

This version has been thoroughly written from start to end by referring to the library's (C ++ Chinese chess getting started and improved). Although no heuristic algorithms have been written in the end of the article, in general, it is quite easy to beat cainiao.

In fact, the workload is really huge, and the UI + background is all designed by yourself.

Algorithm: 1. The way the chess pieces are played-the generation of the handsome elephant carriage artillery. Efficient generation and routing using bitwise operations and auxiliary Arrays

2. Search Algorithm: α-β pruning algorithm + History Table + replacement table

3. evaluation function: simple position sub-force score + flexibility sub-force score + stress score between chess pieces, etc.

Http://pan.baidu.com/s/1sjtyyJj

 

Chinese chess-QT