Title: Hunting Rabbits on the Hypercube,
Abstract: We explore the Hunters and Rabbits game on the hypercube. In the process, we
find the solution for all classes of graphs with an isoperimetric nesting
property and find the exact hunter number of $Q^n$ to be
$1+\sum\limits_{i=0}^{n-2} \binom{i}{\lfloor i/2 \rfloor}$. In addition, we
extend results to the situation where we allow the rabbit to not move between
shots.