![]() |
|
#11
|
|||
|
|||
|
I know poker stove pre-flop is all tabled out...
I'm not sure what you mean by this, but I'm pretty sure that you don't understand what PokerStove is doing. It doesn't use extensive lookup tables. In fact, it does quite the opposite. If you look at the memory footprint of the program, you'll see that it's right around 6 MB. But once u specify part of the flop, it starts working off tables (or at least not as fast)... I dunno, I get it running at over 200 evals/sec with a flop. So i do think these algorithm's do have a lot of merit for partial flop analysis. I certainly agree with you on that point. PokerStove certainly isn't a complete solution to the evaluation problem. There is lots of improvement available all over the place. - Andrew |
|
|