Here is code:
Code:
class NashCalculator {
public:
uint8_t PushStrategy[169]; //probability 1/0xFF parts to push
uint8_t CallStrategy[169]; //probability 1/0xFF parts to call
double PusherPushGain[169]; //gain from push action (only vs specific call strategy)
double PusherFoldGain[169];
double CallerCallGain[169];
double CallerFoldGain[169];
void CalculateGains(HU_LUT* HL, int small_blind, int big_blind, int ante, int stack);
};
Some questions appear:
1. As I see on nash table -> there are no mixed moves (with probabilityes).
So seems there are nash in non mixed moves?
2. My plan is:
- take some random or 50/50 strategies
- calculate pusher and caller gains
- then change strategies in some way (gradient? min max?)
- repeat until (dont know for now )
May be there are some no itterative methods?
Or may be I doing somthing wery wrong from a scratch?Statistics: Posted by nefton — Sun Sep 15, 2019 5:20 am
]]>