Recently, Monte Carlo tree search (MCTS) has become a well-known game search method,
and has been successfully applied to many games. This method performs well in solving …

Efficiency is critical for game programs. This paper improves the search efficiency of
Connect6 program by encoding connection patterns and computing the inherent information …

The problem of finding the optimal correspondence between two sets of geometric entities or
features is known to be NP-hard in the worst case. This problem appears in many real …

The selection of individuals with similar characteristics from a given population have always
been a matter of interest in several scientific areas: data privacy, genetics, art, among others …

One important trend in edge detection starts from current knowledge about the Human
Visual System (HVS) in order to mimic some of its components. We follow this trend and …

为了提高连珠棋局面的表示效率, 给出了一种基于棋形来描述棋子间联系的表示方法,
并在六子棋程序NEUConn6 中成功运用. 该方法不但紧凑, 高效地描述了局面状态 …

In any k-in-a-row game, the player should always analyze each consecutive sequence in 4
directions, which consists of either the void intersections or the intersections occupied by the …

Parallel high-performance computing relies on cache-efficient, branch-free algorithms that
are often expressed as imperative computations over multidimensional arrays. Numerous …

Connect6 is becoming more and more populous in those years. It possesses three
characteristics that is a fair and highly complex game with simple rules. Searching is an …

This paper proposes a new search mechanism called Conservative Relevance Zone Search
(CRZS), and it surveys numerous candidate moves to prove or disprove a sudden-death …