Silent Duelsвђ”constructing The Solution Part 2 Вђ“ Math В€© Programming <100% EXTENDED>

Computers don't naturally handle continuous infinite strategies. To program this, we use . Step 1: The Grid. We divide the time interval tiny segments. Step 2: Dynamic Programming. We work backward from (the "end" of the duel). At

, the probability of hitting is 100%. We use this boundary condition to calculate the "Expected Value" (EV) of firing at tn−1t sub n minus 1 end-sub we will look at

Constructing this solution is a masterclass in . It’s used in: where one player is faster

In the final part of this series, we will look at , where one player is faster, but the other is more accurate. we will look at

Deciding when to "patch" a system versus waiting to gather more data on an exploit.