{"title":"Valorant Haven Strategy Using BIP and Weighted Graph","authors":"Ermelinda Benna Kireyna, Jovian Dian Pratama, Mauliddino Rizky Pratama, Sri Lutfiya Dwiyeni, Apni Diyanti, Bernardinus Rico Dewanto, Sunarsih","doi":"10.31605/jomta.v6i1.3511","DOIUrl":null,"url":null,"abstract":"Strategy in a competitive video game is needed to reach a successful game, for example, Valorant. Route planning is one of the strategies in playing games. In consideration of making a new strategy, this research develops a binary integer programming (BIP) model to generating optimal route depending on passable paths, travel time, kills, and survivability. By using POM QM for Windows to compute the model, we obtained optimal modified routes that can be combined in the role and agent composition.","PeriodicalId":313373,"journal":{"name":"Journal of Mathematics: Theory and Applications","volume":"29 1‐2","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Mathematics: Theory and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.31605/jomta.v6i1.3511","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Strategy in a competitive video game is needed to reach a successful game, for example, Valorant. Route planning is one of the strategies in playing games. In consideration of making a new strategy, this research develops a binary integer programming (BIP) model to generating optimal route depending on passable paths, travel time, kills, and survivability. By using POM QM for Windows to compute the model, we obtained optimal modified routes that can be combined in the role and agent composition.
在竞技视频游戏中，要想取得成功，就必须制定策略，例如《Valorant》。路线规划是游戏中的策略之一。为了制定新的策略，本研究开发了一种二元整数编程（BIP）模型，根据可通行路径、行进时间、杀伤力和生存能力生成最优路线。通过使用 POM QM for Windows 计算该模型，我们获得了可与角色和代理组合相结合的最佳修改路线。
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
