Computing the Optimal Strategy

Given the optimal value function, v, how can the player choose to stick or stand?

To solve this, we need to be precise about the state of states. Decisions made on the basis of three variables: the current sum (12-21), the dealer's one showing card (ace-10), and whether or not the player holds a usable ace.

How many total states?

\epsfig {file=l1401.ps,height=3in,angle=270}


next up previous
Next: Markov Decision Processes Up: BLACKJACK Previous: Multiple Hits