This is sort of a spin-off from the question about strategy generation from main. I have an algorithm in mind now. Before I work on coding it, I'm trying to determine if it's tractable.

For anyone who has done CA strategy generation: I'm trying to estimate how many instructions are required, on average, to determine the two expectations of a yes/no decision. For instance, the expectations for doubling and not doubling 9v2 (assuming the hard hit/stand strategy has already been determined). Please excuse my naivete when it comes to programming. I'm not sure if programmers think in terms of "this function will require a total of 1 billion instructions" rather than "this will take .1 seconds."

I know splits take much longer. If anyone has even a ballpark figure on any of these, it'd be much appreciated.