Solving this would allow handicapped computers to play interesting games against humans, and it would also be hugely useful for strong players preparing opening surprises, but no one seems to have figured it out.
Note that this isn't a simple graph theory question of looking for how narrow a path through the graph is: the word "plausible" is very important above, and a narrow path where most moves can quickly be eliminated is one of the easier things for humans to calculate.
Anyway, I was hoping this was a step towards solving that, but they don't seem to have even tried to apply it there.