Computer-Go programs have high computational costs for static analysis, even though most intersections of the board remain unchanged after one move. Therefore, we introduced the method of incremental computation as an essential feature in Go programming. This paper explores how incremental computation is applied to the static analysis in Go programs, and describes two types of analysis and pattern recognition. One type is determination in cases where the territories of groups are almost determined. This includes (1) the methods of determining the life and death of a group by numerical features and (2) the method of finding the numbers of regions enclosed by the groups based on Euler’s formula. The other type is estimation of groups of stones and territories by analysing the influence of stones using an “electric charge model” in cases where the density of stones is rather low. In the analysis, operations on sets of intersections are used for mathematical descriptions when applying incremental computation as well as definitions of the notions on the Go board.