基于价值评估的NoGo博弈人工智能算法

Qianyu Guo, Youguang Chen
{"title":"基于价值评估的NoGo博弈人工智能算法","authors":"Qianyu Guo, Youguang Chen","doi":"10.1109/ICISCAE.2018.8666845","DOIUrl":null,"url":null,"abstract":"The game of NoGo is one of the chesses for machine game, and is a variation of go-chess. NoGo and its related rules are firstly introduced with demonstration on recent researches on artificial intelligence for the game. Then a model function of value evaluation for arbitrary chessboard is proposed through analysis of characteristics of NoGo, and one or more candidate points with the highest evaluation value shall be given. Hence, an optimal solution can be given if the candidate point is sole, otherwise, the optimal solution can be given via scattering rule or the algorithm of Monte Carlo tree search (MCTS) according to different cases. Finally, the game result between the proposed algorithm by this paper and the famous open source software (OSS)——OASE-NOGO is obtained, and the proposed algorithm gives 95% of win rate, which, comparing with previous researches, proves to be feasible and efficient.","PeriodicalId":129861,"journal":{"name":"2018 International Conference on Information Systems and Computer Aided Education (ICISCAE)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Artificial Intelligence Algorithm for the Game of NoGo based on Value Evaluation\",\"authors\":\"Qianyu Guo, Youguang Chen\",\"doi\":\"10.1109/ICISCAE.2018.8666845\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The game of NoGo is one of the chesses for machine game, and is a variation of go-chess. NoGo and its related rules are firstly introduced with demonstration on recent researches on artificial intelligence for the game. Then a model function of value evaluation for arbitrary chessboard is proposed through analysis of characteristics of NoGo, and one or more candidate points with the highest evaluation value shall be given. Hence, an optimal solution can be given if the candidate point is sole, otherwise, the optimal solution can be given via scattering rule or the algorithm of Monte Carlo tree search (MCTS) according to different cases. Finally, the game result between the proposed algorithm by this paper and the famous open source software (OSS)——OASE-NOGO is obtained, and the proposed algorithm gives 95% of win rate, which, comparing with previous researches, proves to be feasible and efficient.\",\"PeriodicalId\":129861,\"journal\":{\"name\":\"2018 International Conference on Information Systems and Computer Aided Education (ICISCAE)\",\"volume\":\"82 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 International Conference on Information Systems and Computer Aided Education (ICISCAE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICISCAE.2018.8666845\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Information Systems and Computer Aided Education (ICISCAE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICISCAE.2018.8666845","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

NoGo是机器游戏中的一种棋类,是围棋的变体。本文首先介绍了NoGo及其相关规则,并对人工智能在该游戏中的最新研究进行了论证。然后通过分析NoGo的特点,提出任意棋盘价值评价的模型函数,并给出评价价值最高的一个或多个候选点。因此,如果候选点是唯一的,则可以给出最优解,否则,根据不同情况,可以通过散射规则或蒙特卡罗树搜索算法(MCTS)给出最优解。最后,将本文提出的算法与著名的开源软件OASE-NOGO进行博弈,结果表明,本文提出的算法胜率为95%,与前人的研究结果相比,证明了该算法的可行性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Artificial Intelligence Algorithm for the Game of NoGo based on Value Evaluation
The game of NoGo is one of the chesses for machine game, and is a variation of go-chess. NoGo and its related rules are firstly introduced with demonstration on recent researches on artificial intelligence for the game. Then a model function of value evaluation for arbitrary chessboard is proposed through analysis of characteristics of NoGo, and one or more candidate points with the highest evaluation value shall be given. Hence, an optimal solution can be given if the candidate point is sole, otherwise, the optimal solution can be given via scattering rule or the algorithm of Monte Carlo tree search (MCTS) according to different cases. Finally, the game result between the proposed algorithm by this paper and the famous open source software (OSS)——OASE-NOGO is obtained, and the proposed algorithm gives 95% of win rate, which, comparing with previous researches, proves to be feasible and efficient.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信