I usually do everything says here. I agree with everything except this:

All loops must have a fixed upper-bound. It must be trivially possible for a checking tool to prove statically that a preset upper-bound on the number of iterations of a loop cannot be exceeded. If the loop-bound cannot be proven statically, the rule is considered violated.

I would call a while loop is a perfectly valid loop which can have, potentially no upper bound. For example, while users doesn't press exit, keep doing stuff. Maybe I'm being pedantic here and it only refers to for loops.

Fun fact, RollerCoaster Tycoon was done in Assembly. I did a Tetris for an university course and the manuals of the Pentium still haunts me on my dreams.