This paper presents the recent technical advances in Monte-Carlo Tree Search for the Game of Go, shows the many similarities and the rare differences between the current best programs, and reports the results of the computer-Go event organized at FUZZ-IEEE 2009, in which four main Go programs played against top level humans. We see that in 9x9, computers are very close to the best human level, and can be improved easily for the opening book; whereas in 19x19, handicap 7 is not enough for the computers to win against top level professional players, due to some clearly understood (but not solved) weaknesses of the current algorithms. Applications far from the game of Go are also cited. Importantly, the first ever win of a computer against a 9th Dan professional player in 9x9 Go occurred in this event.