RSS
We debated whether this was a straightforward linear programming problem or an easy convex optimisation problem. Given that the former is a subset of the latter, it's actually both, so we felt free to choose the cooler sounding one.
If you enjoy university level mathematics in your roleplaying games, definitely check out GURPS Vehicles.
[Reminder: Our guest commentators have not seen Rogue One. Part of the fun is seeing how their untainted impressions re-interpret the movie through the lens of our comic.]
— aurilee
As I mentioned before. Baze is doing the aiming. And he really seems to be using his eyes. High level of camouflage (a.k.a. invisible) would bother him.
The mechanic of +1 to hit for each round of aiming versus the chance of being hit by a tank increasing is a wonderful trade-off mechanic. Unfortunately, this is an old school style of mechanic. The style that says that PCs are likely to fail. This fits perfectly into a story that we are told is a total party kill.
Living dangerously. I bet he gets hit just before he fires next comic.
— Keybounce
Transcript
{a heavy armoured tank chases Baze and Chirrut across the sand towards the cover of a small dune}
[SFX]: Pow!
[SFX]: Kaboom!
Chirrut: Baze gets +1 for each round he aims at the cockpit window, but the chance of getting hit first by a tank increases each round.
[SFX]: load {Baze loads a rocket launcher}
GM: So how long does he aim?
Chirrut: It's an easy convex optimisation problem. Let's see. With 75% cover, assuming standard scanners and random targeting...
Chirrut: Seven point four rounds.
GM: So, seven?
[SFX]: aim... {silent beat as Baze aims and Chirrut thinks}
Chirrut: Let's live dangerously. Eight.