[Leonardo]

I think it can be solved. The number of possible combinations of cards heads up is not that high, the number of decisions is relatively low. You could program a computer to play optimaly, and it would never lose. I'm sure it has been done already. The only thing is, by playing optimally, you are not exploiting weak players weaknesses. You will beat a weak player, but not by as much as you could. Consider, the number of card combinations is:

52c2 * 50c2 * 48c3 * 45 * 44 =

(52*51/2)*(50*49/2)*(48*47*46/6)*45*44= 55,627,620,048,000

Thats about 1000x of dollars Bill Gates has, so it can't be that hard to count! Around 55 trillion possible combinations. A computer can take care of that in no time. lol, it would take a fair while, but it can be done.

good luck, I think if you get some butchers paper and start a decision tree, you will be finished by the year 25 billion.