Deduction with $k$ moves
Combinatorics
2025-10-30 v1
Abstract
The deduction game may be thought of as a variant on the classical game of cops and robber in which the cops (searchers) aim to capture an invisible robber (evader); each cop is allowed to move at most once, and cops situated on different vertices cannot communicate to co-ordinate their strategy. In this paper, we extend the deduction game to allow each searcher to make moves, where is a fixed positive integer. We consider the value of the -move deduction number on several classes of graphs including paths, cycles, complete graphs, complete bipartite graphs, and Cartesian and strong products of paths.
Cite
@article{arxiv.2510.24959,
title = {Deduction with $k$ moves},
author = {Andrea C. Burgess and Nancy E. Clarke and Shannon L. Fitzpatrick and Melissa A. Huggan},
journal= {arXiv preprint arXiv:2510.24959},
year = {2025}
}
Comments
27 pages, 8 figures