图论在策略图版游戏“穿越沙漠”中的应用
The Application of Graph Theory in the Strategy Board Game “Crossing the Desert”
摘要: 针对“穿越沙漠”游戏的策略求解问题,本文从玩家角度出发,利用数学语言对“穿越沙漠”游戏规则进行详细刻画,以玩家最终抵达终点所剩的资金最多为目标,建立优化模型,并结合Floyd算法对游戏地图进行简化,最终通过随机化贪心算法求解既定条件下的最优游戏策略。
Abstract:
In order to find out the strategy of “Crossing Desert” game, from the point of view of the players, we described the rules of the game “crossing the desert” in detail by using mathematical language. Then, we took the maximum amount of funds left at the final destination as the goal, established an optimization model, and simplified the game map with Floyd algorithm, and finally we used randomized greedy algorithm (RGA) to solve the optimal game strategy under the given conditions.
参考文献
|
[1]
|
Witter, R.T. and Lyford, A. (2020) Applications of Graph Theory and Probability in the Board Game Ticket to Ride. International Conference on the Foundations of Digital Games, 1-4. [Google Scholar] [CrossRef]
|
|
[2]
|
王艳武, 谢德先. 沙漠掘金案例在管理学科中的应用效果分析[J]. 科技经济导刊, 2020, 28(32): 12-13.
|
|
[3]
|
马晓宇, 李莉, 董珍珍, 张正文. 管理定量方法在企业人力资源开发中的应用[J]. 中国商贸, 2012(29): 112-114.
|
|
[4]
|
刘汝佳, 黄亮. 算法艺术与信息学竞赛[M]. 北京: 清华大学出版社, 2003: 16-17.
|
|
[5]
|
Tang, Z.G., Wu, X. and Zhang, Y. (2020) Towards a Better Understanding of Randomized Greedy Matching. Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 1097-1110. [Google Scholar] [CrossRef]
|
|
[6]
|
Poloczek, M. and Szegedy, M. (2012) Randomized Greedy Algorithms for the Maximum Matching Problem with New Analysis. 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, New Brunswick, 20-23 October 2012, 708-717. [Google Scholar] [CrossRef]
|