Let $f : \mathbb{N} \to [0,1]$ be a function defined by $$ f(n)=\frac{f(n-1) + f(n-2) + f(n-3)}{3},\ n\geq 4$$ with $f(1) = f(2) = 0$ and $f(3) = 1$.
Find the value of $$L = \lim_{n\to\infty} f(n)$$
Context
This problem came to me while watching this Ted Ed riddle on YouTube. There's a long queue of souls, with the leading three standing on three different platforms in front of Cerberus, the three headed 'Hound of Hades'. In each turn, one of the three heads of Cerberus bites the soul in front of it (the probability of each head biting is $\displaystyle1/3$), which gets resurrected. If there's any soul ahead of the resurrected one, it leaves the queue without getting resurrected. After that the souls move ahead to fill the empty spots on the three platforms and this process continues.
The probability of any soul getting resurrected is found to be following the recurrence relation given above with the leading soul at the start designated as $n = 4$ for simplification of the domain of $f.$
During the video, the narrator claims that as $n\to \infty,$ the probability of the $\,n\text{th}$ soul getting resurrected tends to $1/2$ because the expected number of souls getting resurrected is asymptotic to $n/2$. It is logical because in each turn, $0, 1$ or $2$ souls are kept in the underworld with equal probabilities. Therefore, after each turn, one soul is resurrected while (on average) one soul gets out of the line, which yields the narrator's claim.
Question
I want to know whether I can get rid of this expected value and probability approach and tackle the problem purely as finding the limit of a recursive sequence.