A helicopter submarine search game

Abstract

This thesis examines a two-person zero sum game where a submarine, after revealing his position by causing a 'flaming datum' , is hunted by a helicopter which arrives on the scene after a time delay. Various helicopter and submarine strategies are explored and simulation runs are used to determine the detection probability (payoffs) for each combination of helicopter and submarine strategy. The value of the game (detection probability) with the related optimal strategies is then obtained using linear programming. A modified random search equation is also derived using probabilities of detection obtained from different combinations of parameters used in the game. Similar and related games are also discussed with emphasis on the differences in assumptions made and approaches taken in order to solve the problem.