Kotov’s tree of analysis

I'm going to check out Kotov's and Nunn's ideas, which I haven't looked at in a long time - I need to cut down on blunders. Dan Heisman also has some great explanations on how to think in The Improving Chess Thinker. Kotov's Tree of Analysis is Explained - with a preparatory chapter before devoting a chapter to it - in Think Like A Grandmaster. Nunn has a number of books all or part dedicated to thinking, He complains about Kotov's method in Nunn's Secrets of Practical Chess, where the biggest complaint is that once you make a tree of possible moves, you may spend 22 minutes examining one move, then 2 minutes on the next possible move and quickly realize it's better than the move you spent 22 minutes on, wasting 20 minutes of clock time. Additionally, Kotov leaves out synergies that may make it reasonable to back-up to a previously examined move that Kotov's continue-on-the-tree process doesn't allow. For example, you may examine a 2nd candidate move where you see a tactic you can use, then go back to the 1st move you examined to see if you can also use it there.
I'll look into it deeper, but I think a lesson here is that you can use a few shortcuts in thinking, where each evaluation method is the right one in certain positions.

Not only that, as John Nunn points out, you may notice a tactic while analyzing your 2nd candidate move, then look back at your first move to see if you can also use it there,