Matrix Function for Solving Optimal Game Pass Strategy Summary

  • Qinling Zhao
  • Xiangdan Wen
Keywords: Adjacency Matrix, Discrete Function, Step Transition Probability Matrix

Abstract

The breakthrough is to quantify the amount of water, food and money carried by people in the desert and to construct a discrete function with the number of days as a time variable, optimal Planning and design for the outflow of desert-walking resources and the introduction of resources and funds from the starting point, villages and mining areas, these resources and funds are fitted by the Adjacency Matrix and the coherent knowledge of probability to describe their dynamic changes with time (days). According to the restriction of the rules of the game, we try to find the optimal solution by computer software (Matlab) in order to reduce the computation of human brain.

Downloads

Download data is not yet available.

References

Run jie, (2016). Application of mathematical modeling ideas and methods. China Building Materials Science & Technology, 6, 135-136.

Zhang Yufei, Peng Xu, Shao Guang ming, & Chen Hua you,(2016). Tourism route planning problem. Mathematics in Practice and Theory, 15, 81-89.

Zhu Guiman, Zhao Jinling, Xu Er, & Tang Guobin,(2015). Transition process tensor and super stochastic tensor in Markov chain. Journal of North University of China, 1, 12-15.

Published
2020-08-31
How to Cite
Qinling Zhao, & Xiangdan Wen. (2020). Matrix Function for Solving Optimal Game Pass Strategy Summary. International Journal of Engineering and Management Research, 10(4), 225-232. https://doi.org/10.31033/ijemr.10.4.29