%A %T Two-sided Search Game Based on Discrete Model %0 Journal Article %D 2007 %J Science & Technology Review %R %P 64-67 %V 25 %N 0702 %U {http://www.kjdb.org/CN/abstract/article_569.shtml} %8 2007-01-25 %X A two-sided search, where the target makes every effort to evade searchers' detection, can be regarded as a two-person zero-sum game. The game is formulated with consideration of search costs on both players and detection probabilities of cells. Based on a discrete model, a solution to this two-sided search game is proposed. The equilibrium of both players is analyzed after the simulation.