yewjin.eth pfp
yewjin.eth
@yewjin
Just read “Defeated by A.I., a Legend in the Board Game Go Warns: Get Ready for What’s Next” https://www.nytimes.com/2024/07/10/world/asia/lee-saedol-go-ai.html?unlocked_article_code=1.6U0.j201.K0_Ul-SfrC0n&smid=url-share As someone who did their PhD in game-tree search, I’ve watched in awe as AI has evolved from mastering board games to tackling some of humanity’s most pressing challenges. The journey from early game-playing algorithms to today’s multifaceted AI systems is nothing short of extraordinary.
1 reply
0 recast
0 reaction

yewjin.eth pfp
yewjin.eth
@yewjin
The Game-Changing Progression The evolution of game AI tells a fascinating story of human ingenuity. We started with simple minimax algorithms and alpha-beta pruning, techniques that seemed cutting-edge at the time. Then came knowledge-based systems, leveraging human expertise to improve performance. A significant leap during my PhD was the advent of Monte Carlo methods, particularly Monte Carlo Tree Search (MCTS). This probabilistic approach opened new horizons, allowing AI to handle the vast complexity of games like Go.
1 reply
0 recast
0 reaction

yewjin.eth pfp
yewjin.eth
@yewjin
In fact, the impact of MCTS on the field was so profound that it accelerated my own academic journey. I was deep into my PhD research on forward pruning and selective search in game-tree search when MCTS emerged. It quickly became clear that complete game-tree search might not be the future of game AI. This realization prompted me to swiftly wrap up my research into a PhD thesis.
1 reply
0 recast
0 reaction

yewjin.eth pfp
yewjin.eth
@yewjin
The last paragraph of my thesis (2007) reflects this pivotal moment: “The game of Go can be considered as the grand challenge of game AI at this point in time. One interesting development in computer Go has been the introduction of Monte Carlo methods that combine game-tree search and randomly generated moves for evaluation [Coulom, 2006, Kocsis and Szepesvári, 2006]. The random nature of Monte Carlo methods corresponds well with the theoretical analysis of the properties of forward pruning presented in this thesis, and should extend to Monte Carlo tree search. More research on how to incorporate risk management strategies in forward pruning can be done to further improve the state of the art for Monte Carlo tree search.” Looking back, it’s remarkable how accurate this assessment was. MCTS indeed became a cornerstone in advanced game AI, particularly in conquering the game of Go.
1 reply
0 recast
0 reaction