Abstract
It is a novel but challenging task that simulated desert crossing strategy for the game players under the specified conditions. This study is aimed to develop an optimal action strategy approach for desert crossing based on dynamic programming. According to the game rules, a multi-stage decision optimization model was first established to maximize the remaining funds of players within given game time. Then, a simulation-based dynamic programming algorithm was designed to solve the optimization model, and the optimal action strategy was obtained by backtracking crossing routes. Finally, two experimental case studies with different initial conditions were used to validate the model. In comparison with the benchmark exhaustive search algorithm, the proposed approach has higher performance and efficiency. The case studies confirm that the method can obtain the optimal action strategy under different game maps and initial resources.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
