  This extended abstract reports on on-going research on quantum algorithmic
approaches to the problem of generalised tree search that may exhibit effective
quantum speedup, even in the presence of non-constant branching factors. Two
strategies are briefly summarised and current work outlined.
