I realize that most of the High Card Flush situations can be calculated analytically. i.e. player has 4-7card flush. A potentially tricky aspect is realizing that the either (or both) the player and dealer can be dealt a hand with two 3-card flushes (in different suits) and that the higher of the two flushes plays. I'm just wondering if the hands with two 3-card flushes were treated explicitly.
I think it's a misinterpretation -- the optimal strategy is known, just not by any people. It's a line-by-line optimal play for each hand combination rather than a succinct, human-readable strategy. I've got the same issue right now: I have optimal player strategies for two of my games but they're in the form of thousands of rows of spreadsheet, not 10 rows of English.
I understood that. I've actually been cranking through the calculations on a spreadsheet myself. Its just that I've found in the past that the calculations underlying the WOO strategies for less widely played games occasionally have short-cuts which make the calculations "approximate." So, given that this is a 7-card hand vs a 7card hand which involves tens or hundreds of thousands of rows on a spreadsheet, I thought I would ask.
But, I read into Shackleford's response that he (or J.B.) went through all the 7-card combinations for the dealer while randomly selecting hands for the player. That is what I had wanted to know. Thanks, all.
For each one, there are combin(45,7) = 45,379,620 different possible dealer hands.
That is a total of 707,235,387,590,160 deals.
If you can calculate 100 million of them per second, which would require a really fast computer, that's almost 3 months of work. Of course, if you have multiple computers working on different sets of player hands simultaneously, it can be done faster.
Also, such a brute force method shouldn't be necessary; that is, it shouldn't require you to check all 45 million dealer hands for each player hand.