Duke vs The Gang

• Granny runs on a six-state machine

Granny.cs is an enum-driven state machine over Idle, Invincible, HoldingContract, ContractDropped, Scavenge and Returning, dispatched from a switch in Update against a single stateTimer that counts down each frame. Every transition method is responsible for setting its own duration and zeroing her velocity before handing control over, so a state can never inherit leftover movement from the one before it. Keeping the timer in one place instead of one per behavior is what made the phase 2 handoff debuggable, because there is exactly one clock to inspect when she gets stuck. Adding a phase means adding a state and its transition rather than threading another boolean through the update loop.

• Attacks and timings as data

The coin, contract-coin and double-contract-coin attacks are BulletPattern assets assigned to serialized fields, so a pattern is swapped in the Inspector rather than rewritten in code. Every duration in the fight is a [SerializeField] too: idle, scavenge, out, invincible, dropped and return times, plus collision radius and check distance. That was deliberate, because the designers retuned this fight repeatedly and none of it should have required me to be in the room.