Research on the Game of Crossing Desert based on Dijkstra algorithm and dynamic programming algorithm

In this paper, we take the optimal strategy of the game "Crossing the Desert" as the research object. First of all, we regularize the graph of the first level, draw an undirected graph according to the knowledge of graph theory, and mark 27 points and 53 edges. Since this is a regional path, you only need to consider whether it is crossing the border. According to the graph, let the weight between each adjacent graph (the adjacent condition in the topic) be 1, and the weather condition is known. According to the rules of the game, we regard the starting point, village, mine and destination at four important points. The desert area of the way only needs to add up the weight, which can be deleted after the addition, leaving the weight behind. As a result, we know that only through the village can the mine maximizes the number of days and assets, as well as the second level. Through the modeling operation, we get that the first pass reaches the end point in the 23rd day, and the maximum value when the capital is 10430, and the second level reaches the end point on the 30th day, with a capital of 12590 yuan.