I experimented with making larger linking logic and I think you experience a law of diminishing returns after 3-4 choices in this format. Each new choice creates more combinations, which is actually governed by Pascal’s Triangle:
2 choices needs 1+2+1=4 slides
(1 slide with no choice, 2 with 1 choice, 1 with all choices )

3 choices needs 1+3+3+1=8 slides, and 4 choices needs 1+4+6+4+1=16 slides. I’d say that’s the highest you could do comfortably and maintaib the linking structure without going crazy.

The programmer part of me cringes to do combinatorics instead of an actual state machine, but the point is, it works and it’s not -too- ugly.