You're right; I apologize. Chess isn't completely brute force but from the Go page on wikipedia:
"There is significant strategy involved in the game, and the number of possible games is vast (10^761 compared, for example, to the estimated 10^120 possible in chess)"
And from the Computer Chess page:
"The Nalimov tablebases, which use state-of-the-art compression techniques, require 7.05 GB of hard disk space for all five-piece endings. To cover all the six-piece endings requires approximately 1.2 TB. It is estimated that seven-piece tablebases will require between 50 and 200 TB of storage space"
Which is just not doable in Go; regardless of the fact that in endgame the match is usually already over or will only change the score by a few points.