We also want to know what the expected margin of success is, given that the player succeeded in the roll, $\text{E}\left[M | M \geq0\right]$. \Cref{tab:exp_mos} shows the expectations.
We also want to know what the expected margin of success is, given that the player succeeded in the roll, $\text{E}\left[M | M \geq0\right]$. \Cref{tab:exp_mos} shows the expectations.
Of note are the expected numbers of successes for \stat{DT} 11. The requirement for critical successes there causes a large variance in results. It is also important to remember that this does not show the full range of results. The highest possible result is $2d$, which for one die is the only possible (successful) result, while other numbers of dice have wider ranges.
Of note are the expected numbers of successes for \stat{DT} 11. The requirement for critical successes there causes a large variance in results. It is also important to remember that this does not show the full range of results. The highest possible result is $2d$, which for one die is the only possible (successful) result, while other numbers of dice have wider ranges.
\end{multicols}
\end{multicols}
@ -136,25 +136,25 @@
\section{Combat Pool Steady State}
\section{Combat Pool Steady State}
\begin{multicols}{2}
\begin{multicols}{2}
The combat pool starts with the proficiency stat, i.e., \stat{STR} or \stat{DEX}. However, after rolling, the change in pool size is determined by \stat{CON}. After a number of turns, the expected size of the pool should converge on a number $E[d]$.
The combat pool starts with the proficiency stat, i.e., \stat{STR} or \stat{DEX}. However, after rolling, the change in pool size is determined by \stat{CON}. After a number of turns, the expected size of the pool should converge on a number $\textE[d]$.
We start by assuming that $E[d]$ is a number such that
We start by assuming that $\textE[d]$ is a number such that
As $p_f$ approaches 1, the steady state becomes just \stat{CON}, meaning the dice pool is entirely discarded and refreshed by \stat{con} on every turn. On the other hand, as $p_f$ approaches 0, the expected dice pool size increases. Specifically at 0, it shoots off toward infinity, as the dice pool loses no dice and \stat{con} dice get added toward it on every turn.
As $p_f$ approaches 1, the steady state becomes just \stat{CON}, meaning the dice pool is entirely discarded and refreshed by \stat{con} on every turn. On the other hand, as $p_f$ approaches 0, the expected dice pool size increases. Specifically at 0, it shoots off toward infinity, as the dice pool loses no dice and \stat{con} dice get added toward it on every turn.