This paper studies the relationship between games of search on a compact metric space $X$ and the absolute epsilon entropy $I(X)$ of $X$. The main result is that $I(X) = -\log \nu_L^\ast, \nu_L^\ast$ being the lower value of a game on $X$ we call "restricted hide and seek."
"Hiding and Covering in a Compact Metric Space." Ann. Statist. 1 (4) 729 - 739, July, 1973. https://doi.org/10.1214/aos/1176342467