Research on connect 6 programming based on MTD(F) and Deeper-Always Transposition Table

Abstract

Chess computer game has always been the hot research topic in the field of artificial intelligence. Connect 6 as an emerging types of chess, has some characteristics such as simple rules, complex changes and fair play. Search engine is the core part on computer game programming. This paper introduces some of the traditional search algorithm in chess computer game, and introduced emphatically a search algorithm based on the MTD(F) and Deeper-Always Transposition Table. Then take Connect 6 as an example, experiments prove its efficiency is higher than alpha-beta pruning algorithm.