A game related to the number of hides game (Q1962474)

In the zero-sum game studied here, the hider has \(q\) objects to hide in some set \(B\) of \(l\) consecutive cells of \(L=\{1,2,\cdots,N\}\), placing \(c_i\) objects in cell \(i\) for \(j\leq i\leq j+l-1\), where \(1\leq c_i\leq c\) and \(\sum c_i=q\). The seeker chooses a set \(A\) of \(p\) consecutive integers from \(L\), and the payoff from hider to seeker is the number of objects in \(A\cap B\). The special case where \(c=1\) is called the Number Hides Game and has been studied in various earlier works. Optimal strategies and game value are obtained under the condition that \(p\) is a divisor of \(N\), and under another special condition. In specific numerical cases some other examples are solved.