Originally posted by jules97
Originally posted by jbpatzer
Originally posted by jules97
When you talk about the exploitability of solutions is that the nash distance?
It is.
You're probably already aware, or maybe it's not relevant.
But GTROB's aim is to get a nash distance of usually less than 1% and always less than 2% of pot. Perhaps 1/1000 seems a bit large for practical purposes?
He's got another brainteaser up if u hadn't notice. This one is a bit boring though imo...
That's interesting. For the very restricted problems I've tried so far, I can get within 1% of pot in less than 100 iterations. I'll have to see how many are required for realistic situations.
I'll let my code solve the brainteaser, but I won't post a reply this time. Nobody likes a smartarse. When I posted the solution to the other one I mainly did it to get Mr Sutherland's attention, and we are indeed talking on Skype now. He's been very helpful.
And I noticed that the PS 'play with the French' advert now has la tour Eiffel instead of le moustachioed chat. Does that mean Big Brother is watching me, or is it just Vorpal? Do you think I can get the rake reduced on Stars if I say it's racist? ♠_ugly: