Grammatical inference for the construction of opening books

Wojciech Wieczorek, Arkadiusz Nowakowski
{"title":"Grammatical inference for the construction of opening books","authors":"Wojciech Wieczorek, Arkadiusz Nowakowski","doi":"10.1109/CSCESM.2015.7331821","DOIUrl":null,"url":null,"abstract":"It is known that Monte-Carlo Tree Search (MCTS) is usually weak in the very early stages of game development. To improve the performance of MCTS we have analyzed a grammatical inference problem. The research led us to devise an efficient algorithm, that for given small finite sets of a game's winning and losing positions, inductively synthesizes a regular expression for predicting similar positions to the ones in the winning part. On that foundation we have built an opening book and showed-in the conducted experiments on the Toads-and-Frogs game-that it helped to increase the playing strength significantly.","PeriodicalId":232149,"journal":{"name":"2015 Second International Conference on Computer Science, Computer Engineering, and Social Media (CSCESM)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 Second International Conference on Computer Science, Computer Engineering, and Social Media (CSCESM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSCESM.2015.7331821","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

It is known that Monte-Carlo Tree Search (MCTS) is usually weak in the very early stages of game development. To improve the performance of MCTS we have analyzed a grammatical inference problem. The research led us to devise an efficient algorithm, that for given small finite sets of a game's winning and losing positions, inductively synthesizes a regular expression for predicting similar positions to the ones in the winning part. On that foundation we have built an opening book and showed-in the conducted experiments on the Toads-and-Frogs game-that it helped to increase the playing strength significantly.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
开卷结构的语法推理
众所周知,蒙特卡罗树搜索(MCTS)在游戏开发的早期阶段通常很弱。为了提高MCTS的性能,我们分析了一个语法推理问题。通过研究,我们设计了一种高效的算法,对于给定的游戏输赢位置的小有限集合,归纳地合成一个正则表达式来预测与获胜部分相似的位置。在此基础上,我们建立了一个开放的书,并在蟾蜍和青蛙游戏的实验中表明,它有助于显著提高游戏强度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The usage of social media in crisis communication Mechanism of critical and resilient digital services for design theory Fun Academic Cloud Computing Leveraging Complex Event Processing for supporting small and medium-sized e-commerce enterprises Modeling communicational and informational content in Facebook with context specific methods
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1