Sorry for the delay in getting back to you about this. I asked Will if he could help and he said you're correct that that software isn't public, and there isn't any other discussion of building that sort of software in other videos. You are welcome to try using http://ttvis.willtipton.com/ which does the same thing, but it may not work with modern hand history formats.

Could we extrapolate this software method to plo?

yes but probably too slow

I'm curious, did you end up trying this? Or anyone else?

Seems like Ben86 (Ben Tollerene) did ...

Could you elaborate a little on what or where the bottleneck would be exactly? I saw yaqh posted he had discussed the practical problems earlier in this thread but I really can't find that post

Hehe )

EDIT: Think I found it?
Wasn't on here but on the HUSNG site:
http://www.husng.com/content/will-ti...#comment-41280

Hello, running into some problems when running:

soln = doFP(minrShoveTree, 100)


1
---------------------------------------------------------------------------
TypeError Traceback (most recent call last)
<ipython-input-155-d38fba93ba5b> in <module>()
----> 1 soln = doFP(minrShoveTree, 100)

<ipython-input-154-06b54cfd0dd1> in doFP(tree, nIter, sbStartingRange, bbStartingRange)
11 print i
12
---> 13 setMaxExplEVs(tree, strats, "SB", "BB")
14 sbMaxEVStrat = getMaxEVStrat(tree, "SB", strats)
15 strats.updateRanges("SB", sbMaxEVStrat, i)

<ipython-input-152-dd478b38895b> in setMaxExplEVs(tree, strats, hero, villain)
28 # Side-effects: set all the EVs in strats.evs[hero] to be the max expl EVs
29 def setMaxExplEVs(tree, strats, hero, villain):
---> 30 setMaxExplEVsHelper(tree, 0, strats, hero, villain)
31 # Again, the idea here is to work recursively -- define a "helper" function that:
32 # - does the job for one DP

<ipython-input-152-dd478b38895b> in setMaxExplEVsHelper(tree, iDecPt, strats, hero, villain)
48 setMaxExplEVsAtLeaf(tree, iDecPt, strats, hero, villain)
49 elif (currDecPt.player == hero):
---> 50 setMaxExplEVsAtHeroDP(tree, iDecPt, strats, hero, villain)
51 elif (currDecPt.player == villain):
52 setMaxExplEVsAtVillainDP(tree, iDecPt, strats, hero, villain)

<ipython-input-152-dd478b38895b> in setMaxExplEVsAtHeroDP(tree, iDecPt, strats, hero, villain)
72 strats.evs[hero][iDecPt] = numpy.zeros_like(strats.evs[hero][iDecPt])
73 for iChild in tree.children[iDecPt]:
---> 74 setMaxExplEVsHelper(tree, iChild, strats, hero, villain)
75 strats.evs[hero][iDecPt] = numpy.maximum(strats.evs[hero][iDecPt], strats.evs[hero][iChild])
76

<ipython-input-152-dd478b38895b> in setMaxExplEVsHelper(tree, iDecPt, strats, hero, villain)
46 currDecPt = tree.decPts[iDecPt]
47 if (currDecPt.player == "Leaf"):
---> 48 setMaxExplEVsAtLeaf(tree, iDecPt, strats, hero, villain)
49 elif (currDecPt.player == hero):
50 setMaxExplEVsAtHeroDP(tree, iDecPt, strats, hero, villain)

<ipython-input-152-dd478b38895b> in setMaxExplEVsAtLeaf(tree, iDecPt, strats, hero, villain)
65 for i in range(0,numCards):
66 for j in range(i+1,numCards):
---> 67 strats.evs[hero][iDecPt][i][j] = (tree.effStack - currDecPt.getPlayerCIP(hero)) + (currDecPt.getPlayerCIP(hero) + currDecPt.getPlayerCIP(villain))* getEquityVsRange([i,j],strats.getMostRecentRangeOf(villain,iDecPt),currD ecPt.eArray)
68 setHandsWithConflicts(strats.evs[hero][iDecPt], currDecPt.eArray.board, -1)
69

<ipython-input-130-7c10855b0d27> in getMostRecentRangeOf(self, player, iDecPt)
58 iCurrDecPt = self.tree.parents[iCurrDecPt]
59 if iCurrDecPt == 0: # we made it to the root
---> 60 return self.getStartingRangeOf(player)
61 return self.ranges[iCurrDecPt]
62

TypeError: getStartingRangeOf() takes exactly 1 argument (2 given)



I have gone through the videos and double checked my codes, but can't seem to find the source of the problem. Thanks for the help in advance.

had this same problem. i changed "comboCounts = []" to "comboCounts = {}"

hey Will, when do you release some new content (e.g. poker and ann's)? I really liked your video series on solving poker!

If I work through this series today. What version of ipython should I use?
Will this series be comparable with the 64 bit version without problem?
Any advice on setting up the environment would be appreciated. Thanks.

Pardon the bump, but I just purchased this and it's not working for me. I installed LAV Filters 0.7, but when I open the Solving Poker exe, it says "Cannot find codec". I tried adding its directories to Path, but no luck. I'm running Windows 7 x64.

No one else seems to have had this problem. What step did I miss?

Nevermind, had to run the file as admin, duh

Hi,
im trying to follow the IPython installation video and have downloaded and installed Anaconda(32bit),but cannot see the IPython(py2.7)Notebook like in the video.I also cannot find when i search.Have uninstalled and re-installed but is still the same.

iPhyton is called jupyter notebook these days

http://jupyter.org/

hope this helps.

same

Hopefully this thread is not dead...
Hi people, I try find video pack volume here , does it exist ?
Can we used this on a MAC ?
Can this be used to solve limit poker instead of NL poker for postflop spot like flop turn ?
Thx

The packs are still for sale at the publisher's website, I believe. At the time they came out, there weren't many, if any, commercial solvers available. If you want to enjoy the experience of coding your own solver using IPython, go for it. But you may also find more value with GTO+ or PioSOLVER basic. They're more efficient, refined and versatile tools. As far as understanding the underlying game theoretic concepts and their application to No Limit Holdem, Tipton's books (Expert HUNLH vol.1&2), however, still are the nuts and haven't at all been rendered obsolete by the more recent (but also good) books by Brokos and Acevedo.

Yeah but they are not available for a MAC....
mind as well learn coding at the same time if this program can work as good as other commercial solver ?
just wonder how efficient it is and if its does basically the same thing as a solver.
thx.

As anyone ever successfully did the solver on a Mac ?
And/ or with the 64bits version as well ?
Thx

Ps:A bit scary to try or buy cause the help here or on will sites seem pretty dead 0o...

The evaluator they use in the video is for Windows and installation instructions seem outdated so I wouldn't bother.

thx for the feedback even tho i wish it would been more positive ...
at least if a discount was available when u have no support .

Monker is supposed to work on Mac and Linux, given that it's java-based.

I bought this video pack a while ago but haven't gotten around to working through it yet. I don't plan on actually coding a solver in Python, though; I'll follow along with his Python code but then rewrite it in Julia for what should be a significant speed boost. IMO gto calcs are slow enough without being done in Python.

thx for reply.
Lucky for you u know how to code !