Peningkatan Kemenangan不可玩角色dalam Permainan Triple Triad Menggunakan Alpha-Beta Pruning

Benedictta Dinda Permatasari, Hanny Haryanto, Erna Zuni Astuti, Erlin Dolphina
{"title":"Peningkatan Kemenangan不可玩角色dalam Permainan Triple Triad Menggunakan Alpha-Beta Pruning","authors":"Benedictta Dinda Permatasari, Hanny Haryanto, Erna Zuni Astuti, Erlin Dolphina","doi":"10.23960/komputasi.v10i1.2952","DOIUrl":null,"url":null,"abstract":"Non-Playable Character (NPC) is one of the essential elements in video games. Generally, NPCs provide challenges for players in completing missions in the game, where NPCs mean acting as enemies. The role of the enemy causes the victory rate to be one of the main goals of artificial intelligence applied to NPCs. The challenges that these NPCs provide are significant to keep players going. NPCs must be able to provide a balanced challenge like humans to have an experience that is as enjoyable as when playing with other people. The problem is the low win rate achieved by NPCs so that players can feel bored. The alpha-beta pruning algorithm is one of the decision-making algorithms that is often applied to games that require more than or equal two players. Therefore, this algorithm is suitable for applying to the object of research, namely the Triple Triad game. The Triple Triad game is a board game played by two players. The Triple Triad game was first introduced as a mini-game in the Final Fantasy VIII game. This game is a combination of card games and board games. In this study, the alpha-beta pruning algorithm was proven to increase the win rate of NPCs. It is indicated by comparing the win rate of NPCs who choose a random step, which is 17.5%, with an NPC that has applied the alpha-beta pruning algorithm, which is 55%. Therefore, there is a significant increase in the win rate. Keywords: Alpha-beta pruning; artificial intelligence; card; game; Non-Playable Character.","PeriodicalId":292117,"journal":{"name":"Jurnal Komputasi","volume":"76 8","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Peningkatan Kemenangan Non-Playable Character dalam Permainan Triple Triad Menggunakan Alpha-Beta Pruning\",\"authors\":\"Benedictta Dinda Permatasari, Hanny Haryanto, Erna Zuni Astuti, Erlin Dolphina\",\"doi\":\"10.23960/komputasi.v10i1.2952\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Non-Playable Character (NPC) is one of the essential elements in video games. Generally, NPCs provide challenges for players in completing missions in the game, where NPCs mean acting as enemies. The role of the enemy causes the victory rate to be one of the main goals of artificial intelligence applied to NPCs. The challenges that these NPCs provide are significant to keep players going. NPCs must be able to provide a balanced challenge like humans to have an experience that is as enjoyable as when playing with other people. The problem is the low win rate achieved by NPCs so that players can feel bored. The alpha-beta pruning algorithm is one of the decision-making algorithms that is often applied to games that require more than or equal two players. Therefore, this algorithm is suitable for applying to the object of research, namely the Triple Triad game. The Triple Triad game is a board game played by two players. The Triple Triad game was first introduced as a mini-game in the Final Fantasy VIII game. This game is a combination of card games and board games. In this study, the alpha-beta pruning algorithm was proven to increase the win rate of NPCs. It is indicated by comparing the win rate of NPCs who choose a random step, which is 17.5%, with an NPC that has applied the alpha-beta pruning algorithm, which is 55%. Therefore, there is a significant increase in the win rate. Keywords: Alpha-beta pruning; artificial intelligence; card; game; Non-Playable Character.\",\"PeriodicalId\":292117,\"journal\":{\"name\":\"Jurnal Komputasi\",\"volume\":\"76 8\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-04-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Jurnal Komputasi\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23960/komputasi.v10i1.2952\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Jurnal Komputasi","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23960/komputasi.v10i1.2952","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

非可玩角色(NPC)是电子游戏中的重要元素之一。一般来说,npc会在玩家完成游戏任务时给他们带来挑战,在这里npc意味着扮演敌人的角色。敌人的角色导致胜率成为应用于npc的人工智能的主要目标之一。这些npc所提供的挑战对于玩家的前进是非常重要的。npc必须能够像人类一样提供平衡的挑战,让玩家能够像与他人一起游戏一样享受游戏体验。问题在于npc的低胜率会让玩家感到无聊。alpha-beta修剪算法是一种决策算法,通常应用于需要多于或等于两个玩家的游戏。因此,该算法适合应用于研究对象,即三合一博弈。Triple Triad游戏是一种由两名玩家玩的棋盘游戏。Triple Triad游戏最初是作为迷你游戏出现在《最终幻想VIII》中。这个游戏是纸牌游戏和桌游的结合。在本研究中,证明了alpha-beta修剪算法可以提高npc的胜率。这可以通过比较选择随机步骤的NPC的胜率(17.5%)和使用alpha-beta修剪算法的NPC的胜率(55%)来表示。因此,胜率有了显著的提高。关键词:α - β剪枝;人工智能;卡;游戏;Non-Playable性格。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Peningkatan Kemenangan Non-Playable Character dalam Permainan Triple Triad Menggunakan Alpha-Beta Pruning
Non-Playable Character (NPC) is one of the essential elements in video games. Generally, NPCs provide challenges for players in completing missions in the game, where NPCs mean acting as enemies. The role of the enemy causes the victory rate to be one of the main goals of artificial intelligence applied to NPCs. The challenges that these NPCs provide are significant to keep players going. NPCs must be able to provide a balanced challenge like humans to have an experience that is as enjoyable as when playing with other people. The problem is the low win rate achieved by NPCs so that players can feel bored. The alpha-beta pruning algorithm is one of the decision-making algorithms that is often applied to games that require more than or equal two players. Therefore, this algorithm is suitable for applying to the object of research, namely the Triple Triad game. The Triple Triad game is a board game played by two players. The Triple Triad game was first introduced as a mini-game in the Final Fantasy VIII game. This game is a combination of card games and board games. In this study, the alpha-beta pruning algorithm was proven to increase the win rate of NPCs. It is indicated by comparing the win rate of NPCs who choose a random step, which is 17.5%, with an NPC that has applied the alpha-beta pruning algorithm, which is 55%. Therefore, there is a significant increase in the win rate. Keywords: Alpha-beta pruning; artificial intelligence; card; game; Non-Playable Character.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信