A Comparison of Genetic Programming and Look-up Table Learning for the Game of Spoof

M. Wittkamp, L. Barone, Lyndon While
{"title":"A Comparison of Genetic Programming and Look-up Table Learning for the Game of Spoof","authors":"M. Wittkamp, L. Barone, Lyndon While","doi":"10.1109/CIG.2007.368080","DOIUrl":null,"url":null,"abstract":"Many games require opponent modeling for optimal performance. The implicit learning and adaptive nature of evolutionary computation techniques offer a natural way to develop and explore models of an opponent's strategy without significant overhead. In this paper, we compare two learning techniques for strategy development in the game of Spoof, a simple guessing game of imperfect information. We compare a genetic programming approach with a look-up table based approach, contrasting the performance of each in different scenarios of the game. Results show both approaches have their advantages, but that the genetic programming approach achieves better performance in scenarios with little public information. We also trial both approaches against opponents who vary their strategy; results showing that the genetic programming approach is better able to respond to strategy changes than the look-up table based approach","PeriodicalId":365269,"journal":{"name":"2007 IEEE Symposium on Computational Intelligence and Games","volume":"74 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE Symposium on Computational Intelligence and Games","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIG.2007.368080","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

Many games require opponent modeling for optimal performance. The implicit learning and adaptive nature of evolutionary computation techniques offer a natural way to develop and explore models of an opponent's strategy without significant overhead. In this paper, we compare two learning techniques for strategy development in the game of Spoof, a simple guessing game of imperfect information. We compare a genetic programming approach with a look-up table based approach, contrasting the performance of each in different scenarios of the game. Results show both approaches have their advantages, but that the genetic programming approach achieves better performance in scenarios with little public information. We also trial both approaches against opponents who vary their strategy; results showing that the genetic programming approach is better able to respond to strategy changes than the look-up table based approach
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
遗传规划与查找表学习在恶搞游戏中的比较
许多游戏需要对手建模以获得最佳性能。进化计算技术的内隐学习和自适应特性提供了一种自然的方法来开发和探索对手的策略模型,而不会产生很大的开销。在本文中,我们比较了两种学习技术在欺骗游戏(一种简单的不完全信息的猜谜游戏)中的策略发展。我们比较了遗传编程方法和基于查找表的方法,对比了每种方法在不同游戏场景中的表现。结果表明,两种方法都有各自的优点,但遗传规划方法在公共信息较少的情况下具有更好的性能。我们也会尝试这两种方法来对付不同策略的对手;结果表明,遗传规划方法比基于查找表的方法能够更好地响应策略变化
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Hybrid Evolutionary Learning Approaches for The Virus Game Vidya: A God Game Based on Intelligent Agents Whose Actions are Devised Through Evolutionary Computation Evolving Pac-Man Players: Can We Learn from Raw Input? Tournament Particle Swarm Optimization EvoTanks: Co-Evolutionary Development of Game-Playing Agents
×
引用
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