Google achieves AI 'breakthrough' by beating Go champion

Re:Google achieves AI 'breakthrough' by beating Go champion by Terribledactyl on Wednesday January 27, 2016 @03:32PM (#10983025)

I wrote a MCTS backgammon move recommendation engine/AI for a class in college. It was a lot of fun.

It was easy to ramp up to many many cores.

I have no idea how to play the game well, never learned, but because the win/lose rules are so clear and using this method, no need to build in game/move theory. Still got great results compared to "advanced" players' games.

[ Parent | on HN ]

Re:Google achieves AI 'breakthrough' by beating Go champion by putterson on Wednesday January 27, 2016 @05:47PM (#10984188)

I wrote a MCTS Ultimate tic-tac-toe engine[0] over the last little while, and likewise don't know how to play the game well. Once thing I have been mulling over in my mind but haven't really explored is training an NN on the game tree produced by long searches and somehow extracting strategies a la DeepDream. I don't have much experience with NNs though so no idea if it even possible or what the extracts would look like.

If anyone would find this interesting work to collaborate on feel free to contact me. The MCTS part is done.

0. https://github.com/putterson/uxobot

[ Parent | on HN ]