The sacrifice move

JC Yan*, SC Hsu, HJ van den Herik

*Corresponding author for this work

    Research output: Contribution to journalArticleAcademicpeer-review

    Abstract

    Computer Go has been a noticeable subject in the field of artificial intelligence. Go has simple rules, but call create enormous unpredictable results. It is difficult to epitomize the results into principles, because there are many exceptions. If a computer-Go designer has not a highly ranked competence of playing Go, he(4) Will Suggest poor principles and make algorithms with many flaws. In the design Of a computer-Go program, block-capturing search plays an important role. This article explores one kind of move called the sacrifice move, which usually occurs in a block-capturing search. A sacrifice move means that when we want to attack an opponent's block and play a squeezing-liberty move, the opponent will capture this move at once. When the sacrifice condition occurs, we usually have to be alert and Counteract. But sometimes the sacrifice move (i.e., permitting the opponent to capture the stone just played) is a good and smart move. It is very important to differentiate between the existing sacrifice moves. There are two conditions which correctly and rapidly may guide LIS in order to achieve a better performance in block-capturing search. They will be explored and analyzed carefully in this article.

    Original languageEnglish
    Pages (from-to)223-234
    Number of pages12
    JournalICGA Journal
    Volume28
    Issue number4
    DOIs
    Publication statusPublished - Dec 2005

    Cite this