Now the question is, how applicable are the approaches developed for AlphaGo to other tree search problems? The beating a professional Go player with less evaluations than it took Deep Blue to beat Kasparov is certainly very exciting.