Optimization strategy of crossing the desert game based on heuristic algorithm

The game of crossing the desert is a novel mathematical model problem that requires players to keep as much funds as possible when they arrive at the end under the constraints of time, weather, materials and other conditions. Based on Matlab software, this paper uses dynamic programming, heuristic algorithms, Monte Carlo and other methods to study the optimal strategy that players should choose in a situation, and establishes a “simulation action criterion” The final result shows the optimal Game strategy, the optimal strategy gives the result: the highest remaining fund is 10450 yuan.