For example, a brute force search of a 19x19 Go board to a depth of 20 would yield on the order of 361^20 = 1.4E51 game states. With a reduction in search depth and better algorithms, state-of-the-art engines might cut this down by ten orders of magnitude, but can still be beaten by rank amateurs.
Deepmind's approach to board game engines blows all previous approaches out of the water. The claim that their success is incidental to Moore's law is categorically false.