A set of n boxes, located on the vertices of a hypergraph G, contain known but different rewards. A Searcher opens all the boxes in some hyperedge of G with the objective of collecting the maximum possible total reward. Some of the boxes, however, are booby trapped. If the Searcher opens a booby trapped box, the search ends and she loses all her collected rewards. We assume the number k of booby traps is known, and we model the problem as a zero-sum game between the maximizing Searcher and a minimizing Hider, where the Hider chooses k boxes to booby trap and the Searcher opens all the boxes in some hyperedge. The payoff is the total reward collected by the Searcher. This model could reflect a military operation in which a drone gathers intelligence from guarded locations, and a booby trapped box being opened corresponds to the drone being destroyed or incapacitated. It could also model a machine scheduling problem, in which rewards are obtained from successfully processing jobs but the machine may crash. We solve the game when G is a 1-uniform hypergraph (the hyperedges are all singletons), so the Searcher can open just 1 box. When G is the complete hypergraph (containing all possible hyperedges), we solve the game in a few cases: (1) same reward in each box, (2) $k=1$, and (3) $n=4$ and $k=2$. The solutions to these few cases indicate that a general simple, closed form solution to the game appears unlikely.

位于超图G的顶点上的一组n个框包含已知但不同的奖励。甲搜索器将打开的一些超边所有框ģ与物镜收集的最大可能的总奖励。但是，有些盒子被诱杀了。如果搜索者打开一个诱杀诱饵盒，搜索将结束，并且她将失去所有收集到的奖励。我们假定知道k个诱杀装置陷阱，并且将问题建模为最大化搜索器和最小化Hider之间的零和博弈，其中Hider选择k到诱杀装置，搜索器会打开某些超边中的所有框。收益是搜索者收集的总奖励。该模型可以反映出一种军事行动，其中无人机从守卫的地方收集情报，而被诱捕的诱杀箱被打开，相当于无人机被摧毁或失去能力。它还可以对机器调度问题进行建模，从成功处理作业中获得奖励，但是机器可能会崩溃。当G是1一致的超图（超边都是单例）时，我们解决游戏，因此搜索器只能打开1个框。当G是完整的超图（包含所有可能的超边）时，我们在以下几种情况下求解游戏：（1）每个框中的奖励相同，（2）$ķ=\mathrm{1个}$和（3） $ñ=4$ 和 $ķ=2$。针对这几种情况的解决方案表明，针对游戏的通用简单，封闭形式的解决方案似乎不太可能。