- Videos And Software
- Poker Software
- Video Packs
- HUSNG Hyper Turbos(Preflop and Flop Strategy by Lotte Lenya)
- Coffeeyay and Friends - Spin and Go Video Pack
- Beating Spin & Go Poker
- Hyper Turbo Video Pack: A Journey Inside My Mind
- GTO In HUSNGs
- Turbo HUSNG Masters Pack
- Expert No Limit Hold'em, Volume 1
- Solving Poker
- Crushing Hyper Turbo HUSNGs
- Crushing Regs: The Way To Beat Tough Opponents
- Hyper Turbo Guide
- Russian Turbo Pack
- Heads Up Cash Video Packs
- Other Content
- VIP Deals
- Spin an Gos
- HUSNG Downloads
- HUSNG Hyper Turbos(Preflop and Flop Strategy by Lotte Lenya) Download
- zZzTILT Crushing Regs
- zZzTILT & phl500 Crushing Hyper Turbo HUSNGs
- Chadders Hyper Turbo Pack Download
- Will Tipton Book Pack Download
- Will Tipton HUNL Video Pack 2
- Hyper Turbo Poker Masters Video Pack 1 Download
- Turbo HUSNG Masters Pack
- Sentin's Crushing Fish Like a Boss Video Pack Download
- HU Cash
- Elliot Roe
- Coffeeyay Math Pack Download Page
- Greenbast Beginner Turbo Speed Pack Download Page
- Hokiegreg Class Video Pack Download
- Premium and Standard Videos
- SGT RJ Tilt Pack Download
- Seeya Russian Video Pack Download
- Winning at Blackjack Download Page
- BernardC's Advanced Hyper Hand Reading Class
- Bernardc's Hyper Turbo Poker Class Video Pack
Will Tipton Video Pack 2 - Solving Poker
September 5, 2015 - 18:15#101
I seem to be failing at literally the first hurdle with this: When I try to import pokereval, I get the follow error
ImportError Traceback (most recent call last) <ipython-input-1-ba86388f21dc> in <module>() ----> 1 import pokereval C:\Users\alex.Owner-PC\Anaconda\lib\site-packages\pokereval\__init__.py in <module>() 28 import sys 29 #_pokereval = __import__('_pokereval_' + sys.version + '_' + sys.version) ---> 30 import _pokereval_2_7 as _pokereval 31 32 from types import * ImportError: DLL load failed: %1 is not a valid Win32 application.
I've tried reinstalling pokereval to no avail. Anyone have an idea what's going on?
September 12, 2015 - 19:34#103
PioSolver vs Tipton's Vidpack
I have PioSolver and am quite happy with it for postflop study.
My question is: what benefit would I gain from buying Tipton Video pack?
I have extensive background in programming so that is not an issue.
I'm looking to analyse pre-flop ranges for both HUSNG and 6max 3B and 6max single raised pots especially cold calling ranges by position. ATM, I can't do this in Piosolver as far as I'm aware. Can I figure out how to do this with Tipton Vid Pack (automating analysis over 1755 strategically different flops)?
September 17, 2015 - 07:55#105
I would like to validate the analysis in your book Vol 2, Section 15.2, p335+ pseudo-equilibriums for pre-flop for various short stacks but using 1755 flops (versus I think you used 135 flops).
If i can get "close" to your HUSNG results, I'd then like to take the same approach to 6max 3B pots (smaller SPR to limit treesize) for certain HU simplified combinations such as BB 3B vs SB raise.
Am I being overly ambitious here or is this a practical thing to try to achieve on my 2.4Ghz 8Gb +SSD laptop? (I don't mind if the analyses take several weeks to complete). How do I estimate how long this might take to run?
(I've watched all the intro vids multiple times to try to make sure I've grasped the scope of the vid pack).
November 19, 2015 - 08:03#106
whats my mistake?
in the hand vs hand eq calculations our return is (numWins + numTies / 2.0) / numRunouts
in our example we hav numWIns = 41 numties =0 and numrunouts = 44
when i use this and calculate (41+0 /2.0) / 44 i get 0.9318... instead of 0.136...
Whats my mistake ? My program shove me 0.136 so i code right. But i just wanna test it on myown and so where is my mistake in thinking?
ANother questions, do u have a link for the whole pokereval stuff for c++`?
March 5, 2016 - 10:34#107
Problem with plot out the hand table
I have problems with making the table:
Only the AA cells shows up
I tried to print out 'results', it seems like it is good:
<svg><rect x="0" y="0" width="20" height="20" fill="#ffffff"></rect><text x=0 y=20 font-size=12 >AA</text></svg> <svg><rect x="0" y="0" width="20" height="20" fill="#ffffff"></rect><text x=0 y=20 font-size=12 > AA</text></svg><rect x="0" y="20" width="20" height="20" fill="#ffffff"></rect><text x=0 y=40 font-size=12 >AK</text></svg> <svg><rect x="0" y="0" width="20" height="20" fill="#ffffff"></rect><text x=0 y=20 font-size=12 >AA</text></svg><rect x="0" y="20" width="20" height="20" fill="#ffffff"></rect><text x=0 y=40 font-size=12 >AK</text></svg><rect x="0" y="40" width="20" height="20" fill="#ffffff"></rect><text x=0 y=60 font-size=12 >AQ</text></svg>
What am I doing wrong?
March 20, 2016 - 10:46#109
Hello again :),
I almost finished the video series, but I have some problems when doing the ficticious play. When calling the dofp function it seems it doesn't return anything. I tried to comment out some lines, and it starts to print out numbers from 1 to 100. It seems like if it has some problems with the setMaxExplEVs function. It runs only if the hero is "BB".
What could be the bug here?
After some debugging I managed to run the function. But I got an error message and it prints out only 100% and 0% ranges. Where could be the problem?
ps: I really enjoyed writing the code so far.
November 2, 2016 - 15:25#111
Hi everybody,It occurs me a
It occurs me a strange string with the AhKdQs2d spot (end of the video 15).
First, when I run all the cells of the program, the code seems (apparently) to be right because iPython returns zero error message. I have debugged all I could (I am a newbie regarding Python) following the videos and the debugging in this thread step by step.
So ,after running 300 iterations for the AhKdQs2d spot, I have an ultimate (and big) issue when I want to display the ranges at each nodes:
- BB checks 0% of his starting range (the top to 65%) at the turn, and consequently after checking he can't bet the river1 nor the river2 (left side of the tree). Unfortunatly, despite of this fact, SB fold a part of this range at the nodes 13 and 9 !!! (so after the parent nodes 8 and 12 where BB could bet at the river if he had some turn checking range at this point).
- As BB checks 0% at the turn, he bets 100% of his starting range (the top to 65%). The more strange here is that at this side of the tree (right side, nodes 15 until 29), all BB and SB ranges split correctly !!!
So I don't understand what could happen here. Someone have an idea ?
I post some image links to help the process:
The BB and SB starting ranges:
The solution for the nodes 1 and 2:
For the node 15 (when BB bet 100% of this starting range and then the BB and SB ranges split correctly for each children of this parent):
And for the nodes 8 and 9 (when SB fold after BB bet 0% !!!):
For advance, thank you and sorry for my english, it's not my native language !! Sure you guess it ^^
UPDATE : my bad, I had set for the first turn 6s instead of 6d...
November 6, 2016 - 09:00#112
getStartingRangeOf() takes exactly 1 argument (2 given)
Hello, I am having trouble debugging the following:
I have spent a while now going over the code, 2p2, and this thread to see if others had similar problems and it doesn't seem so. I'm not sure exactly why it is saying I'm giving 2 arguments to getStartingRangeOf()
Thanks so much for the help and for this very cool product!
November 8, 2016 - 16:49#115
I am so close to wrapping up this series, but am having a problem with my strategies it seems. When I do soln.dump() as in video 14, here are the results that I get:
I have checked the codes and looked for mistakes or differences and don't know where to go from here without further complicating my situation. Help!
Thanks in advance.
December 25, 2016 - 18:27#116
Will Python 2.7 version using the 64-bit installer be compatible with this video series today? What is the latest version of Python I can use today? Thanks
December 26, 2016 - 10:47#117
I figured it out. I can't
I figured it out. I can't wait to start.
March 15, 2017 - 00:36#118
I ordered these videos awhile
I ordered these videos awhile back ( could be a year or more ago ) ... is there away I can download them again ? I don't have them on my hard-drives anymore .
Honestly , I wasn't able to achieve much success with it but would like to try again . One thing I didn't understand is how to make the program converge to a solution and how to find the optimum number of iterations . Is there a way ? Last time I tried , I found that the more iterations I put , the solution doesn't seem to converge but the ranges just keep getting tighter and tighter . How am I supposed to tell when it is done ?