  We study quantum walks through chains consisting of two and three star
graphs. The first star has a distinguished vertex labelled START and the last
has one labelled END. There are multiple paths between these two vertices, and
the object is to find these paths. We show that a quantum walk can do this with
a quantum speedup.
