Kokolo Ikeda, Daisuke Tomizawa, Simon Viennot, Yuu Tanaka
{"title":"Playing PuyoPuyo: Two search algorithms for constructing chain and tactical heuristics","authors":"Kokolo Ikeda, Daisuke Tomizawa, Simon Viennot, Yuu Tanaka","doi":"10.1109/CIG.2012.6374140","DOIUrl":null,"url":null,"abstract":"Tetris is one of the most famous tile-matching video games, and has been used as a test bed for artificial intelligence techniques such as machine learning. Many games have been derived from such early tile-matching games, in this paper we discuss how to develop AI players of \"PuyoPuyo\". PuyoPuyo is a popular two-player game, and where the main point is to construct a \"chain\" longer than the opponent. We introduce two tree search algorithms and some tactical heuristics for improving the performance. We were able to reach an average chain length of 11, notably higher than that of the commercial Als.","PeriodicalId":288052,"journal":{"name":"2012 IEEE Conference on Computational Intelligence and Games (CIG)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Conference on Computational Intelligence and Games (CIG)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIG.2012.6374140","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Tetris is one of the most famous tile-matching video games, and has been used as a test bed for artificial intelligence techniques such as machine learning. Many games have been derived from such early tile-matching games, in this paper we discuss how to develop AI players of "PuyoPuyo". PuyoPuyo is a popular two-player game, and where the main point is to construct a "chain" longer than the opponent. We introduce two tree search algorithms and some tactical heuristics for improving the performance. We were able to reach an average chain length of 11, notably higher than that of the commercial Als.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
