On card guessing games: Limit law for no feedback one-time riffle shuffle

We consider the following card guessing game with no feedback. An ordered deck of n cards labeled 1 up to n is riffle-shuffled exactly one time. Then, the goal of the game is to maximize the number of correct guesses of the cards. One after another a single card is drawn from the top, the guesser makes a guess without seeing the card and gets no response if the guess was correct or not. Building upon and improving earlier results, we provide a limit law for the number of correct guesses and also show convergence of the integer moments.