A game related to the number of hides game

In this paper, we study a discrete search game on an array of N ordered cells, with two players having opposite goals: player I (searcher) and player II (hider). Player II has to hide q objects at consecutive cells and player I can search p consecutive cells. The payoff to player I is the number of objects, found by him. In some situations, the players need to adopt sophisticated strategies if they are to act optimally.