Abstract: Seager introduced the following game in 2013. An invisible and immobile target is hidden at some vertex of a graph G. Every step, one vertex v of G can be probed which results in the knowledge of the distance between v and the target. The objective of the game is to minimize the number of steps needed to locate the target, wherever it is.
Loading