Hacker News Reader

Well, stouset is talking about chess, but in Go, Monte Carlo Tree Search plays out all the way to the end of the game; it just does so in a much less exhaustive way, for exactly the reason you mention.

One of the nice things about Go is that branches rejoin quite a bit, mitigating some of the branching factor concerns.

You can prune more effectively. Download a program like Leela and let it analyze some positions. You'll get very deep mainlines just like in chess.

My comment was in a subthread about computers playing chess in a more human-like manner.