As mentioned in this question, the probability of winning, with an $n$-card per $k$ suit deck, a counting-up match card game (where you count through each of $n$ cards in order $k$ times and lose if you ever match the card drawn, i.e. you lose if card $i\equiv i \mod k$), is:
$$P(n,k)=\frac{1}{(nk)!}\intop_0^{\infty}x^{nk}R_k\left(-\frac{1}{x}\right)^{n}e^{-x}dx,$$
here $R$ represents a (square) rook polynomial
From my simulations it seems to be that $\lim\limits_{n\rightarrow\infty}P(n,k)$ is well-defined and nonzero for all fixed $k$; what is the limit? I've never been good with factorial limits, let alone with the Rook polynomials involved.