期刊名称：Indian Journal of Computer Science and Engineering
印刷版ISSN：2231-3850
电子版ISSN：0976-5166
出版年度：2019
卷号：10
期号：6
页码：168-176
DOI：10.21817/indjcse/2019/v10i6/191006049
出版社：Engg Journals Publications
摘要：With the development of mobile and GPS technologies, gamers in spatial games based on a realmap or a virtual game map play against each other to determine winner and loser of the game. Toimprove their winning rate, gamers want to play against weak opponents, but it is limited to a certaindegree for gamers to choose weak opponents. In general, the game server shows the attributes of othergamers around the current gamer, such as their game level, power, and difficulty. This paper proposes anoptimal opponent search technique that allows game servers to search and show possible game opponentsaround a gamer by comparing their attributes. For comparison of possible game opponents, gamers andtheir game opponents are evaluated by Euclidean distance. Experiments were performed focusing onsearching for game opponents with a danger level equal to or lower than that of the gamer. We measuredthe similarity between gamers and neighboring opponents based on virtual data to provide an optimalgame opponent evaluation that could increase the winning rate of gamers.
