>play first live game in a couple months
>just a simple 20$ shootout
>first hand
>im utg on my table
>pocket tens
>raise 3 blinds
>five calls
>flop comes low rainbow
>bet again
>two callers
>turn comes
>shove
>get called
>guy to my left turned his gutshot with 74o
since i have been in vegas i have earned income in the mid 30kish range with something
like a ratio of 21k poker 9k earned from job and some bitcoins monies. i'm using when I arrived here in oct as my calendar month so i have 2 months left to claw out a pretty average, high variance income with questionable sustainability. i moved into the meridian apartments a couple of months ago and its a pretty convenient location. but id say id attribute my savings rate mostly due to a lack of paying taxes. I drive a shitty car and I also feel skeptical of finding a woman of sufficient standard.
been playing poorly of late and I have had a bad session today. I have noticed that alot of people burn out nearing the completion of 1 year, and I am going to being my 11th month out here now. I mean even if I do everything right long term, what can I accomplish? I am starting to meet and talk to more regulars and also starting to see how the 10/20+ level winners operate here and they seem pretty beastly. It is also difficult meeting all of these rich tourists and rich locals at the wynn and not introspect upon myself and feel some sort of anger/drive/guilt/envy etc. I really would not like to be one of those grinders turned dealers despite it being rational in many ways. I love what's going on in downtown las vegas and I want to be a part of it but I wonder if I have the savvy and will have the financing from poker to accomplish something noteworthy in that arena. still got 30k but its distributed all over the place in multiple checking accounts, cash, ira, bitcoin, etc.
im up on carbon, but down on bovada. i fucking hate bovada, yet it's the one with zoom. i'd instantly quit them if carbon adopted the concept, but they don't seem to want to. maybe playing anon zoom isn't a good idea, even though im making the right moves more often than not. i just dont get it.
anyone else play? new HH file type so trackers aren't working. apparently they don't give out vpp's anymore, just "bonus points" for only clearing the bonuses, and ive read on 2+2 that certain players are restricted from cashing out at all.
aside from the first part, anyone else experiencing any shit with carbon? should i try to get rakeback if at all possible if this "bonus points" thing is for real? i thought about just using the points to take shots at mtt's but idk...
I was working two jobs until one decided to give me full time hours, which meant I had to quit the other one. I only had about two weeks for the one I quit, but they completely erased all the time I worked, meaning they won't be paying me. Nor have I been paid by the current place I'm working at. I already quit a job this year because they threatened to not pay me all of my hours worked. I don't fucking get it.
I just don't fucking know what to do.
edit: i guess i shouldn't say quit because i was trying to put my two weeks in but the manager wanted to try to work out some hours. there hasn't been anything official in terms of termination, but this is fucking ridiculous.
I'm trying to work on my 3betting, but I can't get any good table dynamics. I had one table last night where I had someone to my right that was a bad player and I could 3bet light against, but then he found out I was playing light against him and went from 50/40 to 5/0.
Though, I just got a second job while typing this.
I figure since probably a decent part of the userbase here has traveled or gone on some neat road trips people here would do pretty well at it. I find it funny how addicting this pretty simple game is.
If you don't know, basically it puts you at a random location of google street view and your goal is to try and guess as close as possible on a map where you are. Some people put their own little rules into play about how far you can move around on street view (if at all) and if you're allowed to google any roadsigns or other things you can see from where you are.
I believe this is a current depiction of their street view coverage to give you an idea of where it could put you. I'd note that the Maldives is also covered but hard to see on that map.
Once in awhile you get dropped in some pretty ridiculous spots, including occasionally inside buildings.
Anyways, been grinding a mega geoguessr session and figured I'd share in case it would interest anyone.
>be me
>have friends
>party all the time
>haha life is okay
>years go by
>within one year all of my childhood friends die
>new friends end up hurting me really bad
>withdraw from society for a year or two
>decide to try to go back into the world again
>meet up with a high school friend (girl)
>stay the night at her place, have good time
>make plans again
>have this feeling that I'm not going to be seeing her again
>come the day of our plans, they are canceled
>i get nothing from her except she can't make it
>i try to see what's up, but then I only get anger from her
>week later, no word from her
>my biggest fear has become opening up and letting someone in my life just to get hurt by them
>i dont want her to leave
>have this idea to woo her back
>but im not even sure what the point is at this point
I don't see the point in living a lonely life. I try, and I try to do things to make it change, but I can only do wrong. I can't even fucking kill myself. How pathetic is that?
>be me
>raise kq pre
>tell myself im going to flop a straight, but there's going to be a pair on the flop, and my villian won't let his trips go no matter what i do, and that he's going to boat the river
>exactly that happens
>tell myself i should become cleo's assistant considering how often this happens
Posting this here for 2 reasons. First as a brag, thought it was pretty cool that I came across a problem with some real world applications and was able to improve on the solution for the simplest case. And second cause there are some really smart mathematicians here (catyoul for instance and others) who may want to run with my algorithm and apply it to the more general cases or come up with even better algorithms than I have.
Was doing my normal web surfing last week and came across the secretary problem, something I had never heard of before.
" imagine an administrator willing to hire the best secretary out of n rankable applicants for a position. The applicants are interviewed one-by-one in random order. A decision about each particular applicant is to be made immediately after the interview. Once rejected, an applicant cannot be recalled. During the interview, the administrator can rank the applicant among all applicants interviewed so far, but is unaware of the quality of yet unseen applicants. The question is about the optimal strategy (stopping rule) to maximize the probability of selecting the best applicant. If the decision can be deferred to the end, this can be solved by the simple maximum selection algorithm of tracking the running maximum (and who achieved it), and selecting the overall maximum at the end. The difficulty is that the decision must be made immediately."
When I read the solution I was at first impressed by it's mathematical beauty: Reject the first n/e applicants, choose the next best applicant after that or choose the last one. this gives a probability of 1/e of delivering the best applicant.
But on second thought it seemed rather risky. When the best applicant occurs in the first n/e spots, the last applicant is always the one chosen. Which means ~36.8% of the time you get a random choice between the worst and 2nd best applicant. It's likely that the applicants are normally distributed about an average number, and while the best applicant may be a standard deviation above the 2nd best or next group of best applicants, the worst applicant might be just as far on the other side of the spectrum or worse. This could be really disastrous.
For example, the most likely real world application of this problem is in dating. Sure you dont know exactly what N will be, but you date a certain number of girls and then eventually you choose one to settle down with. If you wait a while and refuse to settle for someone worse than your first set of applicants, you may end up getting stuck with a real shitty girl at an older age.
I thought I could immediately improve the solution to this problem. My solution was fairly simple: iterate this same process. Go through first n/e applicants, write down max, reject those. now there are n - n/e applicants. look through next (n-n/e)/e applicants, if you find a better one in there you choose it, if not you write down the max from that group, etc. iterated on to the end where you just go 1 at a time.
I programmed a simple version of both in python. I ranked secretaries 0-99, randomized their order and used each method to test the % choosing best applicant, the median applicant chosen and the average applicant chosen.
#Original secretary problem solution based on 100 secretaries and just on the ranking of secretaries from 1-100
#want to figure out both average ranking chosen and how often the best candidate is chosen
#function which sorts a list
def sortedRankings(sec):
x=0
while x <99:
import random
from random import randint
a = random.randint(x,99)
temp = sec[x]
sec[x] = sec[a]
sec[a] = temp
x = x+1
return sec
#function which returns a secretary based on original algorithm
def chooseSecretary(sec):
max=sec[0]
x=1
while x<36:
if (sec[x] > max):
max = sec[x]
x=x+1
while x<99:
if (sec[x] > max):
return sec[x]
x=x+1
#sort winners
a=0
while a<1000:
b=a
min=100
minLocation=-1
while b<1000:
if(min > winners[b]):
min = winners[b]
minLocation=b
b=b+1
temp=winners[a]
winners[a]=winners[minLocation]
winners[minLocation]=temp
a=a+1
print winners
print winners[499]
results: Ran the simulation 1000 times. The best secretary was chosen 375 times. The median secretary chosen was the 2nd best. The average choice was the 18th best. And roughly 3.5% of the time a bottom 10 secretary was chosen.
#function which sorts a list
def sortedRankings(sec):
x=0
while x <99:
import random
from random import randint
a = random.randint(x,99)
temp = sec[x]
sec[x] = sec[a]
sec[a] = temp
x = x+1
return sec
#function which returns a secretary based on original algorithm
def chooseSecretary(sec):
max=sec[0]
max2=0
max3=0
max4=0
max5=0
max6=0
max7=0
max8=0
max9=0
max10=0
x=1
while x<36:
if (sec[x] > max):
max = sec[x]
x=x+1
while x<60:
if (sec[x] > max):
return sec[x]
if (sec[x] > max2):
max2 = sec[x]
x=x+1
while x<74:
if (sec[x] > max2):
return sec[x]
if (sec[x] > max3):
max3 = sec[x]
x=x+1
while x<84:
if (sec[x] > max3):
return sec[x]
if (sec[x] > max4):
max4 = sec[x]
x=x+1
while x<90:
if (sec[x] > max4):
return sec[x]
if (sec[x] > max5):
max5 = sec[x]
x=x+1
while x<93:
if (sec[x] > max5):
return sec[x]
if (sec[x] > max6):
max6 = sec[x]
x=x+1
while x<95:
if (sec[x] > max6):
return sec[x]
if (sec[x] > max7):
max7 = sec[x]
x=x+1
while x<97:
if (sec[x] > max7):
return sec[x]
if (sec[x] > max8):
max8 = sec[x]
x=x+1
while x<98:
if (sec[x] > max8):
return sec[x]
if (sec[x] > max9):
max9 = sec[x]
x=x+1
while x<99:
if (sec[x] > max9):
return sec[x]
if (sec[x] > max10):
max10 = sec[x]
x=x+1
#sort winners
a=0
while a<1000:
b=a
min=100
minLocation=-1
while b<1000:
if(min > winners[b]):
min = winners[b]
minLocation=b
b=b+1
temp=winners[a]
winners[a]=winners[minLocation]
winners[minLocation]=temp
a=a+1
print winners
print winners[499]
Results: ran 1000 times. best chosen 263. 3rd best was median choice. average: 4th best. worst chosen: 50th best.
this seems much much better. of course i didnt program it for random values in a normal distribution, nor did i program it for the more likely real world scenario of an unknown N. but this clearly seems like a much better solution despite the fact that the original solution chooses the best secretary ~10% more often.
So, if you guys would like, run with this in the more general forms or try and come up with an even better solution.
Posting this here for 2 reasons. First as a brag, thought it was pretty cool that I came across a problem with some real world applications and was able to improve on the solution for the simplest case. And second cause there are some really smart mathematicians here (catyoul for instance and others) who may want to run with my algorithm and apply it to the more general cases or come up with even better algorithms than I have.
Was doing my normal web surfing last week and came across the secretary problem, something I had never heard of before.
" imagine an administrator willing to hire the best secretary out of n rankable applicants for a position. The applicants are interviewed one-by-one in random order. A decision about each particular applicant is to be made immediately after the interview. Once rejected, an applicant cannot be recalled. During the interview, the administrator can rank the applicant among all applicants interviewed so far, but is unaware of the quality of yet unseen applicants. The question is about the optimal strategy (stopping rule) to maximize the probability of selecting the best applicant. If the decision can be deferred to the end, this can be solved by the simple maximum selection algorithm of tracking the running maximum (and who achieved it), and selecting the overall maximum at the end. The difficulty is that the decision must be made immediately."
When I read the solution I was at first impressed by it's mathematical beauty: Reject the first n/e applicants, choose the next best applicant after that or choose the last one. this gives a probability of 1/e of delivering the best applicant.
But on second thought it seemed rather risky. When the best applicant occurs in the first n/e spots, the last applicant is always the one chosen. Which means ~36.8% of the time you get a random choice between the worst and 2nd best applicant. It's likely that the applicants are normally distributed about an average number, and while the best applicant may be a standard deviation above the 2nd best or next group of best applicants, the worst applicant might be just as far on the other side of the spectrum or worse. This could be really disastrous.
For example, the most likely real world application of this problem is in dating. Sure you dont know exactly what N will be, but you date a certain number of girls and then eventually you choose one to settle down with. If you wait a while and refuse to settle for someone worse than your first set of applicants, you may end up getting stuck with a real shitty girl at an older age.
I thought I could immediately improve the solution to this problem. My solution was fairly simple: iterate this same process. Go through first n/e applicants, write down max, reject those. now there are n - n/e applicants. look through next (n-n/e)/e applicants, if you find a better one in there you choose it, if not you write down the max from that group, etc. iterated on to the end where you just go 1 at a time.
I programmed a simple version of both in python. I ranked secretaries 0-99, randomized their order and used each method to test the % choosing best applicant, the median applicant chosen and the average applicant chosen.
#Original secretary problem solution based on 100 secretaries and just on the ranking of secretaries from 1-100
#want to figure out both average ranking chosen and how often the best candidate is chosen
#function which sorts a list
def sortedRankings(sec):
x=0
while x <99:
import random
from random import randint
a = random.randint(x,99)
temp = sec[x]
sec[x] = sec[a]
sec[a] = temp
x = x+1
return sec
#function which returns a secretary based on original algorithm
def chooseSecretary(sec):
max=sec[0]
x=1
while x<36:
if (sec[x] > max):
max = sec[x]
x=x+1
while x<99:
if (sec[x] > max):
return sec[x]
x=x+1
#sort winners
a=0
while a<1000:
b=a
min=100
minLocation=-1
while b<1000:
if(min > winners[b]):
min = winners[b]
minLocation=b
b=b+1
temp=winners[a]
winners[a]=winners[minLocation]
winners[minLocation]=temp
a=a+1
print winners
print winners[499]
results: Ran the simulation 1000 times. The best secretary was chosen 375 times. The median secretary chosen was the 2nd best. The average choice was the 18th best. And roughly 3.5% of the time a bottom 10 secretary was chosen.
#function which sorts a list
def sortedRankings(sec):
x=0
while x <99:
import random
from random import randint
a = random.randint(x,99)
temp = sec[x]
sec[x] = sec[a]
sec[a] = temp
x = x+1
return sec
#function which returns a secretary based on original algorithm
def chooseSecretary(sec):
max=sec[0]
max2=0
max3=0
max4=0
max5=0
max6=0
max7=0
max8=0
max9=0
max10=0
x=1
while x<36:
if (sec[x] > max):
max = sec[x]
x=x+1
while x<60:
if (sec[x] > max):
return sec[x]
if (sec[x] > max2):
max2 = sec[x]
x=x+1
while x<74:
if (sec[x] > max2):
return sec[x]
if (sec[x] > max3):
max3 = sec[x]
x=x+1
while x<84:
if (sec[x] > max3):
return sec[x]
if (sec[x] > max4):
max4 = sec[x]
x=x+1
while x<90:
if (sec[x] > max4):
return sec[x]
if (sec[x] > max5):
max5 = sec[x]
x=x+1
while x<93:
if (sec[x] > max5):
return sec[x]
if (sec[x] > max6):
max6 = sec[x]
x=x+1
while x<95:
if (sec[x] > max6):
return sec[x]
if (sec[x] > max7):
max7 = sec[x]
x=x+1
while x<97:
if (sec[x] > max7):
return sec[x]
if (sec[x] > max8):
max8 = sec[x]
x=x+1
while x<98:
if (sec[x] > max8):
return sec[x]
if (sec[x] > max9):
max9 = sec[x]
x=x+1
while x<99:
if (sec[x] > max9):
return sec[x]
if (sec[x] > max10):
max10 = sec[x]
x=x+1
#sort winners
a=0
while a<1000:
b=a
min=100
minLocation=-1
while b<1000:
if(min > winners[b]):
min = winners[b]
minLocation=b
b=b+1
temp=winners[a]
winners[a]=winners[minLocation]
winners[minLocation]=temp
a=a+1
print winners
print winners[499]
Results: ran 1000 times. best chosen 263. 3rd best was median choice. average: 4th best. worst chosen: 50th best.
this seems much much better. of course i didnt program it for random values in a normal distribution, nor did i program it for the more likely real world scenario of an unknown N. but this clearly seems like a much better solution despite the fact that the original solution chooses the best secretary ~10% more often.
So, if you guys would like, run with this in the more general forms or try and come up with an even better solution.
My sister stole a large sum of money from my dad. Not only has she not moved out, but my dad is dishing out more money for her, in complete contrast to what he said he was going to do. Not only this, she wrecked her car, that he was paying for, which only had one more payment left on it. Oh, wait, she wasn't the one driving it. She's no longer getting any inheritance, though. That is, until my parents die. To show they love me. I wonder if they realize what inheritance is.
Which brings me to my next point: The vehicle she's now driving is the same vehicle I need to start up my little venture this month.
When I was a teenager, I had basically three interests:
1) Starcraft (ever since I was 12-13)
2) Poker (since I was 17)
3) MMA (since I was 14-15, trained first time when I was 16).
Anyway, after I quit playing Sc2 professionally, I quickly found myself missing some kind of competitive outlet. A new MMA gym had opened up near me like 2-3 months prior, and I'd been going on and off... but around July last year I decided to get a lot more serious.
I'd been out with an injury for like 1-2 months and at the time I was about 90kg, 180~ cm. So I started training 5 days a week, 3~ hours a day... And yesterday I had my first fight, weighing in at around 77 kg.
I blunk
The event is hosted by Top FC which is Korea's second biggest MMA organization behind Road FC (who also has their own amateur divsion, called Central League I think), and uses the moniker "Top FC Khan Amateur League". This was its 4th iteration.
The rules are quite friendly:
- 2x 3 minute rounds
- Headgear, 14 oz gloves*, shinguards
- No heelhooks, no knees or elbows to the head but OK to the body.
Rest is the same as pro mma, but referees try to stop fights much faster if a submission is on, to avoid serious injuries in an amateur event.
* They told us last minute that from now on we'd be able to opt for MMA gloves if we wanted to but I dont think anyone did since it was a last minute change and everyone had been sparring with bigger gloves.
ONE MORE REP YOU CAN DO IT... More seriously, rules meeting
The gameplan
When I first came to this gym, I had a little bit of grappling skill, but my striking was HORRIBLE. I'm still not a really competent striker (but I'd say I'm one of the best 3 or so regular students in terms of ground grappling --- then there's obviously the coaches and a couple of higher level guys who are a bunch better too), but I've made improvements. My cardio is also excellent since I train for so long every day and I run in addition to that.
So to summarize: striking relatively poor, grappling relatively good, cardio good. I also don't have much power in my strikes, which I need to work on.
I've got really long arms and legs for my size, and since my most glaring weakness striking wise is exchanges in the pocket, the gameplan my coaches made for me was as follows:
- Stay on the outside, use a lot of circling, use your jab and kicks to maintain distance.
- When he closes, clinch!
Oh and I've got a bit of a tendency to be too timid when sparring, and walk back too much, so I've been trying to work on that, alongside a gameplan that can work around that.
The opponent
Before the fight I didn't know much about him, except that he's a striker. Oh and that he looks a lot like Reis :D
After the fight I talked to him tho and found out he's 32 (I thiiiiink, maybe 31? cant remember), been training for a similiar time to me (a little less in mma, but he's done some boxing before), and funnily enough the dude is friends with one of the guys that trains where I train (neither of us had any idea about this until we talked tho).
The Fight
The Aftermath
In case you want to watch the fight before you read this, I'll spoiler it. + Show Spoiler +
So I lost, but I'm actually pretty happy with how I did. Before the fight I wasnt at all sure if I would want to do this again, whereas now I'm 100% sure I do.
The biggest thing I take away from this is a newfound appreciation for gameplans - watching the fight back I can really tell where I followed the gameplan and did well, and where I strayed and did worse.
Here's some things that went right/wrong:
Right:
- Clinch was good, he didn't know how to shoulder out of the thai plum. I should have tried for it a bit more probably.
- I kept distance... decently, not as well as in practice but decently. Front kick worked well.
Wrong:
- My coach has been trying to get me to take smaller steps when I punch, and I think I fell back into stepping too far with my jab, and stranding my back leg a little.
- I completely forgot to even try the main takedown I practiced from the clinch :D Instead I went for a silly un-practiced trip.
- Didn't jab enough!
- I think I tensed my shoulders a bit, because my arms gassed really hard in round 2, which I've never had happen before.
- Forgot to slow down my breathing when on the outside.
- When backstepping I only single stepped too much! I actually worked hard on making sure I always 2 stepped when I was training since there's a huge difference between backstep-circle and backstep, backstep, circle.
- The first low kick I throw, you can see it lands really slow. It's because when I stepped forward for my jab, I didn't follow it with my right leg properly.
Things I learned:
- I've never trained in a ring before, our gym has a cage! In round 2 when we are at the ropes, and I'm defending the takedown... I kind of froze because I had no idea how much pressure I could put on the ropes without falling haha. Also arms were so tired.
- When you are on your back and wearing headgear, the nose-guard blocks your downward vision, I couldnt see his legs haha. I wanted to do a situp sweep but I couldn't tell where the fuck his legs were. I definitely didn't roll enough with headgear.
- Too compartmentalized sparring. Because my standup is weak, I think I did a bit too much pure striking sparring... I think this is maybe why my arms got so tired. Next time I'll work more full MMA sparring.
- Nutshots are very painful.
I'm also gonna add some muscle for next time, I've been cutting for a long time just to get rid of all the fat, now its time to build up a bit
Oh and I guess you could put lack of combination punching in there somewhere, but it was actually part of the gameplan to not do that, since it necessitates remaining in the pocket a bit and we wanted to avoid that as much as possible. But in terms of training its definitely on the to do list hehe
Ah and headmovement! It's something I definitely want to work a lot on. I only really used any headmovement once in the fight haha
Various other things:
- One guy broke or separated his knee, didnt see how it happened but he had to be carried out on a stretcher. Looked reallly painful
- One of my team mates (the guy just above me in the pic below) is a beast. He looks like he's asleep in there then BOOM cracking thunder, boom submission. So relaxed haha.
Have you noticed the pattern with hole cards on bovada? If you're two tabling zone, at least, you will usually get the same pocket pair on both tables. You'll also see the same hand or one card off or one suit off the very next on the same table. Probably more than half the time this happens.
Contact Users: 750 Active, 1 Logged in - Time: 16:52
,
,
,
,