We here at 2+2 can solve poker!

[ QUOTE ]
[ QUOTE ]
If you look at my starting post, you will see that it can easily be solved in under two years if all my information is accurate, and I'm pretty sure it is.

[/ QUOTE ]

Let's say the search space has roughly 7,000,000,000,000 states. Then, in order to find an optimal startegy we need to do roughly 49,000,000,000,000,000,000,000,000 operations.
Now, let's assume, for a moment that each operation is one flop (in practice the operations are a bit larger but that's not important here.)
Let's say we have 1 terraflop = 1,000,000,000,000 operations per cpu per second, and 1000 cpu's.
Then the process will still take 49,000,000,000,000 seconds. That's roughly 1,500,000 years.

[/ QUOTE ]

Well, I'm free for the next 78,000,000 Saturdays... [img]/images/graemlins/tongue.gif[/img]