The great Ken Regan on AlphaZero

A must-read for anyone who has been following this issue, Ken considers how close to God AlphaZero actually came:

We must pause to reflect on how clarifying it is that this single heuristic suffices to master complex games—games that also represent a concrete face of asymptotic complexity insofar as their size n-by-ngeneralizations are polynomial-space hard…

It may be that we can heuristically solve some NP-type problems better by infusing an adversary—to make a PSPACE-type problem that hits back—and running AlphaZero.

That sort of thing.  And don’t neglect the comments.