#### Abstract

The Zookeeper’s Problem is a shortest-path problem that, given a simple polygon (a zoo) containing a set of disjoint convex polygons (cages) attached to the boundary of the zoo, asks for a shortest route (closed path) in the zoo that intersects the boundaries of all cages without entering their interiors. The literature contains several algorithms for variants of this problem some of which compute exact and some approximate solutions. However, no implementations have been reported. Moreover, concerns have also been raised about the numerical properties of the algorithms that compute exact solutions. In this paper we present a study of two algorithms for the Zookeeper’s Problem. One of them compute exact solutions and the other provably good approximations. We give observations about the algorithms and the solutions they compute. We also present an experimental study based on an implementation of the algorithms in Java.