A non-logarithmic approach to the rate of convergence of the deterministic chaos game

The aim of this paper is to provide a different perspective in the study of the rate of convergence of the chaos game algorithm to the attractor of an iterated function system. We prove that for any function $\psi$ with $\underset{\text{ve}\to 0}{\lim }\psi (\text{ve})=\mathrm{\infty }$, a typical (in the sense of the Baire category) driver yields a rate of recovery comparable to $\psi$. This result extends the main theorem from Leśniak et al. (Rev. Real Acad. Cienc. Exactas Fis. Nat. Ser. A-Mat. 118, 157, 2024). Moreover, thanks to the change of perspective, we are able to prove that a typical driver gives arbitrarily slow rate of recovery.