And just to be clear to you, the rest of the article was great. I think there was three or four points that I was going 'but ...' and then the next sentence you

And just to be clear to you, the rest of the article was great. I think there was three or four points that I was going 'but ...' and then the next sentence you explicitly mentioned exactly that. Very well put together. > Issue: Multiple undifferentiated inputs to node Under this segment you say 'and it never is' implies that it's just really difficult, you can be even more forceful here - it's impossible. Sirlin's article on Viable Options[0] goes into depth here - while he's talking about best move to attack in a fighting game, and while your case is simpler in that the enemies don't have options for themselves, the mapping between the two arguments is there. For any given use-case there can only ever be two choices, the best choice, and the counter to the best choice. The counter to the counter just ends up being the best again so you can't have any more depth without creating a new use-case. [0]: https://www.sirlin.net/articles/balancing-multiplayer-games-part-2-viable-options https://www.sirlin.net/articles/balancing-multiplayer-games-...