On: AlphaGo Beats Lee Sedol in Final Game

[thomasahle]

Yes, that's how modern chess engines manage time. If the score suddenly, drastically changes during search, they give themselves much more time.

In all of these games, AlphaGo used close to a constant amount of time per move, while Lee's varied a lot.

Apparently they only recently added a neural net for time management. Seems it is either not the best approach, or just not yet well trained.