While the math is continuous, a game engine or simulation usually runs on discrete ticks. You must normalize the PDF so that the sum of probabilities across all frames equals 1. 5. Summary of the Construction To build the solution: Define : How likely are you to hit at time Calculate the Threshold : The point where "waiting" becomes statistically viable. Generate the PDF : Use the derived to distribute firing chances.
When constructing the solution programmatically, two hurdles often arise: If your accuracy function starts at zero, the term explodes. We must enforce a lower bound to ensure the strategy is valid.
In Part 3, we will look at , where one player is more accurate or has more bullets than the other. While the math is continuous, a game engine
In a silent duel, the core challenge is that neither player knows when the other has fired. This lack of information forces us to rely on a rather than a single "best" time to shoot. 1. The Strategy Profile To construct the solution, we define a strategy as a distribution of firing times. If is the probability of hitting the target at time
Should we look at the for solving the threshold when the accuracy function is complex? Summary of the Construction To build the solution:
For a symmetric duel (equal accuracy and one bullet each), the boundary condition is: ∫a1f(x)dx=1integral from a to 1 of f of x d x equals 1 2. Solving the Integral Equation
f(x)=A′(x)A(x)3f of x equals the fraction with numerator cap A prime open paren x close paren and denominator cap A open paren x close paren cubed end-fraction We must enforce a lower bound to ensure
: In the actual game loop, sample from this distribution to decide the exact frame of the "Silent" shot.