A Markovian approach to dynamic games of combat

A new approach to the solution of dynamic games of one-on-one combat is developed. By introducing two physically motivated assumptions, a meaningful discretized game formulation of the combat problem is obtained. Then, concepts of Markov processes and state increment dynamic programming are used to develop a feasible computational scheme for solving this problem. The method is demonstrated by applying it to a classical differential game, the Homocidal Chauffeur problem.