An Algorithm Design and Implementation of Connect6

Abstract

The new Connect6 game was launched and received the widespread attention in recent years. For the problems existing in pattern judgment way and in 6-8 windows in some literatures, the algorithm of Connect6 is studied by considering the attack and defensive characteristics of the Connect6. By the new 6-8 window approach proposed here, the evaluation function which determines the evaluation value is designed and implemented by calculating the changing quantity of the assessed values of the chessboard before and after the falling a stone. Based on this, an optimal Connect6 program is designed and implemented based on the PVS algorithm and the transposition table optimization, history heuristic optimization, null-move pruning optimization as well as iterative deepening optimization. The pruning rate of nodes in game tree comes to more than 98%. The actual playing of the chess indicates that the program has the strong chess strength.