While reading, one should be able to mark possible tenukis (ignoring the
local situation and playing elsewhere).
Now, having a pile of such trees, a higher-level search can try to
decide which local battle to fith at each "move" (which can represent a
longer forced sequence).
If all local moves are graded in terms of their size and urgency
(temperature?), then we should have enough data to make meaningful move
ordering and pruning in the higher-level search.
I don't know if anyone does this sort of multi-level search, and what
practical the practical limitations of such an approach. As with any
search, it needs a decent evaluation function, but that is another
problem...
_________________________________________________________________