Inverarity is not a Scottish village

In fact, computer go has been extensively studied and is an active area of research for AI scientists.

Besides the depth problem that tealterror0 mentioned (just using brute-force look-ahead algorithms, go is exponentially more complex than chess), there is the fact that go is strategically more complex than chess as well. Heuristics for evaluating the value of a move in chess can use fairly well-defined metrics (material, positional advantage, etc.) based on the current state of the board. But in go, a stone played on one side of the board can have implications on the other side of the board 20 moves later, and any move might be good for profit but poor for influence, or vice versa, which means whether or not it's a good move depends on which strategy the player is pursuing.