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 $k$ moves, where $k$ is a fixed positive integer. We consider the value of the $k$-move deduction number on several classes of graphs including paths, cycles, complete graphs, complete bipartite graphs, and Cartesian and strong products of paths.