Step 1: Identify the sequence pattern.
The layers form triangular numbers: 1, 3, 6, 10...
The formula for the $n$-th triangular number is $\frac{n(n+1)}{2}$.
Step 2: Use the formula for the sum of triangular numbers.
The total number of balls in a tetrahedral stack of $n$ layers is given by the formula $\frac{n(n+1)(n+2)}{6}$.
We are given the total sum = 8436.
$\frac{n(n+1)(n+2)}{6} = 8436 \Rightarrow n(n+1)(n+2) = 50616$.
Step 3: Solve for $n$ using approximation.
Since $n$, $n+1$, and $n+2$ are very close, $n^{3} \approx 50616$.
We know $30^{3} = 27000$ and $40^{3} = 64000$. The number $n$ is between 30 and 40.
Checking the options, let's test $n = 36$:
$36 \times 37 \times 38 = 50616$. The layers are exactly 36.