The gambler’s ruin problem for a Markov chain related to the Bessel process

We consider a Markov chain for which the probability of moving from nn to n+1n+1 depends on nn. We calculate the probability that the chain reaches NN before 0, as well as the average duration of the game. We also consider a diffusion process which is a limiting case of the Markov chain.