Research on optimal path Modeling based on DP Model

Nowadays, the emergence of all kinds of games greatly enriches our life and enlightens our wisdom; As a vehicle of enlightenment, the game itself involves the choice of a variety of strategies and the choice of routes and solutions. In the case of multiple constraints, the core idea of strategy choice games is to make the optimal solution to a certain problem, and such a choice plan needs the support of a variety of theories, such as game theory dynamic programming, the application of operations research, and so on. In this case, it is essentially a given condition of the game, using the above known mathematical model to find the optimal solution, that is, under the condition of meeting the safety of the end, the most money is left When the weather is known and the map is known, we can make the most optimal solution; by using the DP model and the correlation of the TSP problem, we have found a certain rule: give priority to choosing the mine that can bring us income, and then replenish the resources when there is a problem with the resources, so as to plan the best route. For the calculation of money, we take the reverse program to calculate and deduce, and find that level 1 and level 2 can finally make money, and give the specific value in the detailed explanation of their respective problems. Under normal circumstances, it is impossible to know the changes of the weather in the future, so it is necessary to make different analyses for different weather conditions every day; here, we assume a certain strategy, that is, to accept the relatively non-optimal solution with a certain probability, and then through the increase of the number of iterations, we finally retrieve the optimal solution in this hypothesis.