A pattern based incremental model in K-in-a-row games

This paper designs an elegant model in k-in-a-row games, Connect6 as an example. In this model, domain knowledge is involved in the special pattern called Connection. A Connection covers several consecutive intersections of a line on the board, and is also the basic element of the data structure sketching the blueprint of the model. Based on Connection, we can show how to construct a complete database containing the knowledge of each possible Connection, and then explain how to design the data structure of such a model. As a result, the speed of searching the same tree in the model is as about 3 times as that in the regular method. Finally, because of the inherent character of the modal, the incremental method is easy to taken to enhance it further, which is used to reduce the updating cost of each tree node. The experiments show about more than 1.9 times improvements are achieved if incremental applies.