We study the problem of treasure hunt in a graph by a mobile agent. The nodes in the graph are anonymous and the edges at any node v of degree deg(v) are labeled arbitrarily as 0, 1, …, deg(v) - 1. A mobile agent, starting ...