The Computational Intelligence of MoGo Revealed in Taiwan's Computer Go Tournaments

The Computational Intelligence of MoGo Revealed in Taiwan's Computer Go Tournaments. Lee, C., Wang, M., Chaslot, Jean-Bernard, G. M., Hoock, J.B., Rimmel, A., Teytaud, O., Tsai, S., Hsu, S., & Hong, T. IEEE Trans. Comp. Intell. AI Games, 1(1):73--89, IEEE, 2009.

Paper abstract bibtex

In order to promote computer Go and stimulate fur- ther development and research in the field, the event activities, Computational Intelligence Forum andWorld 9 9 Computer Go Championship, were held in Taiwan. This study focuses on the in- vited games played in the tournamentTaiwaneseGoPlayersVersus the Computer Program MoGo held at the National University of Tainan (NUTN), Tainan, Taiwan. Several Taiwanese Go players, including one 9-Dan (9D) professional Go player and eight am- ateur Go players, were invited by NUTN to play against MoGo from August 26 to October 4, 2008. The MoGo program combines all-moves-as-first (AMAF)/rapid action value estimation (RAVE) values, online “upper confidence tree (UCT)-like” values, offline values extracted from databases, and expert rules. Additionally, four properties of MoGo are analyzed including: 1) the weakness in corners, 2) the scaling over time, 3) the behavior in handicap games, and 4) the main strength of MoGo in contact fights. The results reveal that MoGo can reach the level of 3 Dan (3D) with: 1) good skills for fights, 2) weaknesses in corners, in particular, for “semeai” situations, and 3) weaknesses in favorable situations such as handicap games. It is hoped that the advances in AI and com- putational power will enable considerable progress in the field of computer Go, with the aim of achieving the same levels as com- puter Chess or Chinese Chess in the future.

@article{ Lee2009,
  abstract = {In order to promote computer Go and stimulate fur- ther development and research in the field, the event activities, Computational Intelligence Forum andWorld 9 9 Computer Go Championship, were held in Taiwan. This study focuses on the in- vited games played in the tournamentTaiwaneseGoPlayersVersus the Computer Program MoGo held at the National University of Tainan (NUTN), Tainan, Taiwan. Several Taiwanese Go players, including one 9-Dan (9D) professional Go player and eight am- ateur Go players, were invited by NUTN to play against MoGo from August 26 to October 4, 2008. The MoGo program combines all-moves-as-first (AMAF)/rapid action value estimation (RAVE) values, online “upper confidence tree (UCT)-like” values, offline values extracted from databases, and expert rules. Additionally, four properties of MoGo are analyzed including: 1) the weakness in corners, 2) the scaling over time, 3) the behavior in handicap games, and 4) the main strength of MoGo in contact fights. The results reveal that MoGo can reach the level of 3 Dan (3D) with: 1) good skills for fights, 2) weaknesses in corners, in particular, for “semeai” situations, and 3) weaknesses in favorable situations such as handicap games. It is hoped that the advances in AI and com- putational power will enable considerable progress in the field of computer Go, with the aim of achieving the same levels as com- puter Chess or Chinese Chess in the future.},
  author = {Lee, Chang-Shing and Wang, Mei-Hui and Chaslot, Guillaume Maurice Jean-Bernard and Hoock, Jean-Baptiste and Rimmel, Arpad and Teytaud, Olivier and Tsai, Shang-Rong and Hsu, Shun-Chin and Hong, Tzung-Pei},
  file = {::},
  issn = {1943-068X},
  journal = {IEEE Trans. Comp. Intell. AI Games},
  keywords = {Computational intelligence,MCTS,MoGo,Monte Carlo tree search,computer Go,game},
  number = {1},
  pages = {73--89},
  publisher = {IEEE},
  title = {{The Computational Intelligence of MoGo Revealed in Taiwan's Computer Go Tournaments}},
  url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4804732},
  volume = {1},
  year = {2009}
}

Downloads: 0

{"_id":{"_str":"52b1a5b99eb585cc26003d82"},"__v":0,"authorIDs":[],"author_short":["Lee, C.","Wang, M.","Chaslot","Jean-Bernard, G.<nbsp>M.","Hoock, J.B.","Rimmel, A.","Teytaud, O.","Tsai, S.","Hsu, S.","Hong, T."],"bibbaseid":"lee-wang-chaslot-jeanbernard-hoock-rimmel-teytaud-tsai-hsu-hong-thecomputationalintelligenceofmogorevealedintaiwanscomputergotournaments-2009","bibdata":{"html":"<div class=\"bibbase_paper\"> \n\n\n<span class=\"bibbase_paper_titleauthoryear\">\n\t<span class=\"bibbase_paper_title\"><a name=\"Lee2009\"> </a>The Computational Intelligence of MoGo Revealed in Taiwan's Computer Go Tournaments.</span>\n\t<span class=\"bibbase_paper_author\">\nLee, C.; Wang, M.; Chaslot; Jean-Bernard, G. M.; Hoock, J.B.; Rimmel, A.; Teytaud, O.; Tsai, S.; Hsu, S.; and Hong, T.</span>\n\t\n</span>\n\n\n\n<i>IEEE Trans. Comp. Intell. AI Games</i>,\n\n1(1):73--89.\n\n 2009.\n\n\n\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content\">\n \n \n \n \n \n\n <a href=\"http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4804732\"\n onclick=\"javascript:log_download('lee-wang-chaslot-jeanbernard-hoock-rimmel-teytaud-tsai-hsu-hong-thecomputationalintelligenceofmogorevealedintaiwanscomputergotournaments-2009', 'http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4804732')\">\n <img src=\"http://www.bibbase.org/img/filetypes/blank.png\"\n\t alt=\"The Computational Intelligence of MoGo Revealed in Taiwan's Computer Go Tournaments [.jsp?arnumber=4804732]\" \n\t class=\"bibbase_icon\"\n\t style=\"width: 24px; height: 24px; border: 0px; vertical-align: text-top\" ><span class=\"bibbase_icon_text\">Paper</span></a> \n  \n \n \n <a href=\"javascript:showBib('Lee2009')\"\n class=\"bibbase link\">\n \n\t\n\t\n\t\n BibTeX\n <i class=\"fa fa-caret-down\"></i></a>\n \n \n  \n <a class=\"bibbase_abstract_link bibbase link\"\n href=\"javascript:showAbstract('Lee2009')\">\n Abstract\n <i class=\"fa fa-caret-down\"></i></a>\n \n \n \n\n \n \n \n</span>\n\n<div class=\"well well-small bibbase\" id=\"bib_Lee2009\"\n style=\"display:none\">\n <pre>@article{ Lee2009,\n abstract = {In order to promote computer Go and stimulate fur- ther development and research in the field, the event activities, Computational Intelligence Forum andWorld 9 9 Computer Go Championship, were held in Taiwan. This study focuses on the in- vited games played in the tournamentTaiwaneseGoPlayersVersus the Computer Program MoGo held at the National University of Tainan (NUTN), Tainan, Taiwan. Several Taiwanese Go players, including one 9-Dan (9D) professional Go player and eight am- ateur Go players, were invited by NUTN to play against MoGo from August 26 to October 4, 2008. The MoGo program combines all-moves-as-first (AMAF)/rapid action value estimation (RAVE) values, online “upper confidence tree (UCT)-like” values, offline values extracted from databases, and expert rules. Additionally, four properties of MoGo are analyzed including: 1) the weakness in corners, 2) the scaling over time, 3) the behavior in handicap games, and 4) the main strength of MoGo in contact fights. The results reveal that MoGo can reach the level of 3 Dan (3D) with: 1) good skills for fights, 2) weaknesses in corners, in particular, for “semeai” situations, and 3) weaknesses in favorable situations such as handicap games. It is hoped that the advances in AI and com- putational power will enable considerable progress in the field of computer Go, with the aim of achieving the same levels as com- puter Chess or Chinese Chess in the future.},\n author = {Lee, Chang-Shing and Wang, Mei-Hui and Chaslot, Guillaume Maurice Jean-Bernard and Hoock, Jean-Baptiste and Rimmel, Arpad and Teytaud, Olivier and Tsai, Shang-Rong and Hsu, Shun-Chin and Hong, Tzung-Pei},\n file = {::},\n issn = {1943-068X},\n journal = {IEEE Trans. Comp. Intell. AI Games},\n keywords = {Computational intelligence,MCTS,MoGo,Monte Carlo tree search,computer Go,game},\n number = {1},\n pages = {73--89},\n publisher = {IEEE},\n title = {{The Computational Intelligence of MoGo Revealed in Taiwan's Computer Go Tournaments}},\n url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4804732},\n volume = {1},\n year = {2009}\n}</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" id=\"abstract_Lee2009\"\n style=\"display:none\">\n In order to promote computer Go and stimulate fur- ther development and research in the field, the event activities, Computational Intelligence Forum andWorld 9 9 Computer Go Championship, were held in Taiwan. This study focuses on the in- vited games played in the tournamentTaiwaneseGoPlayersVersus the Computer Program MoGo held at the National University of Tainan (NUTN), Tainan, Taiwan. Several Taiwanese Go players, including one 9-Dan (9D) professional Go player and eight am- ateur Go players, were invited by NUTN to play against MoGo from August 26 to October 4, 2008. The MoGo program combines all-moves-as-first (AMAF)/rapid action value estimation (RAVE) values, online “upper confidence tree (UCT)-like” values, offline values extracted from databases, and expert rules. Additionally, four properties of MoGo are analyzed including: 1) the weakness in corners, 2) the scaling over time, 3) the behavior in handicap games, and 4) the main strength of MoGo in contact fights. The results reveal that MoGo can reach the level of 3 Dan (3D) with: 1) good skills for fights, 2) weaknesses in corners, in particular, for “semeai” situations, and 3) weaknesses in favorable situations such as handicap games. It is hoped that the advances in AI and com- putational power will enable considerable progress in the field of computer Go, with the aim of achieving the same levels as com- puter Chess or Chinese Chess in the future.\n</div>\n\n\n</div>\n","downloads":0,"keyword":["Computational intelligence","MCTS","MoGo","Monte Carlo tree search","computer Go","game"],"bibbaseid":"lee-wang-chaslot-jeanbernard-hoock-rimmel-teytaud-tsai-hsu-hong-thecomputationalintelligenceofmogorevealedintaiwanscomputergotournaments-2009","urls":{"Paper":"http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4804732"},"role":"author","year":"2009","volume":"1","url":"http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4804732","type":"article","title":"The Computational Intelligence of MoGo Revealed in Taiwan's Computer Go Tournaments","publisher":"IEEE","pages":"73--89","number":"1","keywords":"Computational intelligence,MCTS,MoGo,Monte Carlo tree search,computer Go,game","key":"Lee2009","journal":"IEEE Trans. Comp. Intell. AI Games","issn":"1943-068X","id":"Lee2009","file":"::","bibtype":"article","bibtex":"@article{ Lee2009,\n abstract = {In order to promote computer Go and stimulate fur- ther development and research in the field, the event activities, Computational Intelligence Forum andWorld 9 9 Computer Go Championship, were held in Taiwan. This study focuses on the in- vited games played in the tournamentTaiwaneseGoPlayersVersus the Computer Program MoGo held at the National University of Tainan (NUTN), Tainan, Taiwan. Several Taiwanese Go players, including one 9-Dan (9D) professional Go player and eight am- ateur Go players, were invited by NUTN to play against MoGo from August 26 to October 4, 2008. The MoGo program combines all-moves-as-first (AMAF)/rapid action value estimation (RAVE) values, online “upper confidence tree (UCT)-like” values, offline values extracted from databases, and expert rules. Additionally, four properties of MoGo are analyzed including: 1) the weakness in corners, 2) the scaling over time, 3) the behavior in handicap games, and 4) the main strength of MoGo in contact fights. The results reveal that MoGo can reach the level of 3 Dan (3D) with: 1) good skills for fights, 2) weaknesses in corners, in particular, for “semeai” situations, and 3) weaknesses in favorable situations such as handicap games. It is hoped that the advances in AI and com- putational power will enable considerable progress in the field of computer Go, with the aim of achieving the same levels as com- puter Chess or Chinese Chess in the future.},\n author = {Lee, Chang-Shing and Wang, Mei-Hui and Chaslot, Guillaume Maurice Jean-Bernard and Hoock, Jean-Baptiste and Rimmel, Arpad and Teytaud, Olivier and Tsai, Shang-Rong and Hsu, Shun-Chin and Hong, Tzung-Pei},\n file = {::},\n issn = {1943-068X},\n journal = {IEEE Trans. Comp. Intell. AI Games},\n keywords = {Computational intelligence,MCTS,MoGo,Monte Carlo tree search,computer Go,game},\n number = {1},\n pages = {73--89},\n publisher = {IEEE},\n title = {{The Computational Intelligence of MoGo Revealed in Taiwan's Computer Go Tournaments}},\n url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4804732},\n volume = {1},\n year = {2009}\n}","author_short":["Lee, C.","Wang, M.","Chaslot","Jean-Bernard, G.<nbsp>M.","Hoock, J.B.","Rimmel, A.","Teytaud, O.","Tsai, S.","Hsu, S.","Hong, T."],"author":["Lee, Chang-Shing","Wang, Mei-Hui","Chaslot","Jean-Bernard, Guillaume Maurice","Hoock, Jean-Baptiste","Rimmel, Arpad","Teytaud, Olivier","Tsai, Shang-Rong","Hsu, Shun-Chin","Hong, Tzung-Pei"],"abstract":"In order to promote computer Go and stimulate fur- ther development and research in the field, the event activities, Computational Intelligence Forum andWorld 9 9 Computer Go Championship, were held in Taiwan. This study focuses on the in- vited games played in the tournamentTaiwaneseGoPlayersVersus the Computer Program MoGo held at the National University of Tainan (NUTN), Tainan, Taiwan. Several Taiwanese Go players, including one 9-Dan (9D) professional Go player and eight am- ateur Go players, were invited by NUTN to play against MoGo from August 26 to October 4, 2008. The MoGo program combines all-moves-as-first (AMAF)/rapid action value estimation (RAVE) values, online “upper confidence tree (UCT)-like” values, offline values extracted from databases, and expert rules. Additionally, four properties of MoGo are analyzed including: 1) the weakness in corners, 2) the scaling over time, 3) the behavior in handicap games, and 4) the main strength of MoGo in contact fights. The results reveal that MoGo can reach the level of 3 Dan (3D) with: 1) good skills for fights, 2) weaknesses in corners, in particular, for “semeai” situations, and 3) weaknesses in favorable situations such as handicap games. It is hoped that the advances in AI and com- putational power will enable considerable progress in the field of computer Go, with the aim of achieving the same levels as com- puter Chess or Chinese Chess in the future."},"bibtype":"article","biburl":"http://mcts.ai/bib/MendeleyMCTSCollection_28032013.bib","downloads":0,"search_terms":["computational","intelligence","mogo","revealed","taiwan","computer","tournaments","lee","wang","chaslot","jean-bernard","hoock","rimmel","teytaud","tsai","hsu","hong"],"title":"The Computational Intelligence of MoGo Revealed in Taiwan's Computer Go Tournaments","year":2009,"dataSources":["kShoLeSRQfAaM4J9K"]}