Author(s)

Zhang Wei

Corresponding Author

Zhang Wei

ABSTRACT

According to the game rules given by the title and the parameters given by the system, this article studies the problem of the optimal strategy for players to reach the end within the specified time from the perspective of planning and the game map, and seek the optimal strategy for the final retained funds. First, analyze the game conditions. The player will be given an initial fund of 10,000 yuan to purchase the two necessities of food and water within the specified 30 days. At the same time, in the line, the player can rely on mining in the mine to obtain income And in the villages in the picture, food and water are supplied to make oneself return to the end within the specified time. Considering that there are many classifications and a large amount of calculation to solve the optimization problem, the multi-stage decision model is used to solve the problem, that is, the maximum profit is solved according to different schemes, and the optimal state optimization principle is compared by comparing the results. Combining the clear optimization criteria to construct decision-making schemes at various stages, so as to complete the solution of the optimal problem. Finally, this article analyzes the advantages and disadvantages of the model, and on this basis, discusses the improvement direction of the model and simply promotes the model.

KEYWORDS

TSP algorithm, 0-1 programming, Knapsack problem, Game theory