We assume an infinite deck of cards, with equal distributions of each of the m face values. Suppose we know the dealer's and the player's sequences of special cards, and repectively. Define to be the distance between the dealer's secret card and the player's next closest secret card into the deck. Clearly , and we define the states of our Markov process to be these m distances. The absorbing state is the distance 0 (For a good treatment of Markov Processes, see [1]).
Annotation Form Interface

          Your name: 
     E-Mail address: 
 Annotation Subject: 
        Related URL: