  We present a foraging algorithm, GoldenFA, in which search direction is
chosen based on the Golden Ratio. We show both theoretically and empirically
that GoldenFA is more efficient for a single searcher than a comparable
algorithm where search direction is chosen uniformly at random. Moreover, we
give a variant of our algorithm that parallelizes linearly with the number of
searchers.
