General form of search problem dealt in search theory divides whole search space into areas and do modeling by form of cell. To decide the oder of searching cells is called general search pattern. If the area covered by a divided cell is small, the nu...
General form of search problem dealt in search theory divides whole search space into areas and do modeling by form of cell. To decide the oder of searching cells is called general search pattern. If the area covered by a divided cell is small, the number of cell that compose whole searching sector increases, the smaller the coverage is the higher the possibility to detect target is. However, the problem to decide the search path become hard as the number of cell increases. Therefore, the decision on the cell size is very important in actuality search problem. In this study, we wish to show detection rate and optimal search time by cell size of searching sector using a battle experiment and M&S. This paper can be used in field of Military Affair such as anti-submarine search if synthesizing this research and researches of existing search theory.