Design and implementation of winning decision algorithm in Hex game system

Hex game is a kind of board game with two players which has the rules that to seek the winner who firstly connect the two boundaries of the board with his own pieces. The decision of winning is the necessary factor of board game, and the effective decision algorithm is the premise to support the whole intelligence level of the game system. Based on the above inference, this article focuses on winning decision process in Hex, and especially for different winning situations to make different strategies. In order to meet the different winning situations, Union-Find Set and Deep-First-Search strategy will be used and hence get a valid algorithm, then, the complexity of algorithm will also be analyzed in the end.