Discrete Search for an Intelligent Object: The Leprechaun's Problem
Scott Berry · Probability in the Engineering and Informational Sciences · 1996
An optimal search among discrete cells for a Markovian object has been labeled the leprechaun problem. This paper discusses the leprechaun's problem: How should the leprechaun behave in order to maximize the probability of being found? A subjective Bayesian approach is taken in modeling the leprechaun.