Well, it's a bit more complicated than that. Neither chess engines nor go engines use brute-force (that is, exhaustive search). Although go does have a much higher branching factor and that does affect the search algorithm used, the biggest challenge is being able to write good evaluation and move-guessing heuristics.