Study on the algorithm based on the important region of board

Hex is a board game with simple rules and complex strategy. In the recent years, hex is becoming more and more popular. (Hex is a game with simple rules and complex strategies which is becoming more and more popular recent years.) Although we have used Min-max tree search[1]and Alpha-Beta pruning[2]during game , the program still has a difficulty to dealing with some situations well . In this paper, we will instruct(describe) a condition which is difficult to deal with existed in hex. By analyzing this situation we found a special and important area called 'connected-region' and we will apply it to the evaluation function. Our experiment found that we will make program get win easier by using this strategy.