MC tree search isn't specific to Go, no. It's been used for other games including imperfect information ones like poker. I believe that the main reasons for using MC search is that it does not require an evaluation function, and it acts as an anytime algorithm so you can get a "good enough" answer within arbitrary time constraints.