Hot answers tagged

9

A DeepStack-style algorithm only requires that you have a way of approximating equilibrium counterfactual values for subtrees at the leaves of lookahead trees from each of its decision points. So if I'm acting at the beginning of the pre-flop and I only have the time and memory available to look ahead to the start of the flop, then I need to approximate the ...


1

It depends a little on what you mean by "the same rounds, just with no public cards dealt." If you mean that each player will just be dealt 2 cards, and no public cards exist, then really we're playing a sort of "high card" game. The best hand is just a pair of aces, CFR will solve this quickly, because the number of possible game states is extremely small ...


1

This looks like it maps very nicely onto Association Mining. In association mining, you are trying to find items from a discrete set that often co-occur in transactions. For instance, you might want to find the items that most commonly appear in an online shopping cart together. In your case, the problem amounts to: Split up the data into sub-problems by ...


Only top voted, non community-wiki answers of a minimum length are eligible