Chess, unlike poker, is solvable because all situations past and present can be modeled. To do that in poker is incredibly more computing intense and the only c

Chess, unlike poker, is solvable because all situations past and present can be modeled. To do that in poker is incredibly more computing intense and the only computer I know of that has came close is the University of Alberta's Polaris: http://poker.cs.ualberta.ca/ http://poker.cs.ualberta.ca/ Notice they tackle limit texas hold'em to keep the mathematics within reach. That's the time of crunching we're taking about. No-limit is impossible at this time. Not only will they need incredible computing power, but they also need the math to run it all, which remains unsolved. Could they use Sklansky's theory of Poker along with other optimal playing mathematics to win? Sure. But creating an unbeatable computer player? That is the incredible challenge.