A Solving Strategy of Connect6 Based on K-in-a-row Types

摘要

This paper introduces some theories of computer game-theoretical value and proposes a solving strategy of Connect6 based on K-in-a-row types. It also expounds the algorithms that made up the strategy. The strategy includes a move generator based on K-in-a-row types, a calling algorithms strategy (etc. alpha-beta pruning search and threats space search) based on the number of threats and proof-number search. Taking 7×7 Connect6 openings for example, the experimental result shows that the solving strategy is more powerful.