Abstract

The “Crossing the Desert” mini-game needs to consider a variety of mutually restrictive factors. Players must coordinate funding and path issues to find the optimal strategy to reach the end within the specified time. Based on the study of crossing the desert when the weather conditions are known, this paper establishes a topology model, and uses priority search and game theory to solve the player’s optimal strategy for passing through the barriers. First, the entire map is digitized and represented by a general topological map; then, given the map and weather distribution, the highest profit of each path is calculated. Specific calculation details require further analysis to arrive at a more practical and efficient route planning plan. The model proposed in this paper only provides a more effective solution for this problem from the perspective of mathematical modeling.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call