智游城

 找回密码
 注册

QQ登录

只需一步,快速开始

扫一扫,访问微社区

查看: 3283|回复: 0
打印 上一主题 下一主题

FullFlush1 Up Next For durrrr Challenge?

[复制链接]
跳转到指定楼层
1#
wmwmw 发表于 2009-5-8 02:16:30 | 只看该作者 回帖奖励 |倒序浏览 |阅读模式
It seems like durrrr challenge is belatedly living up to the hype everyone expected it to generate back in early 09 when Tom Dwan first posted his open challenge (sans Phil Galfond) to the poker community. Dwan and Antonius have been lighting up the tables with some monster sessions over the last few weeks, and now Luke “__FullFlush1__” Schwartz has apparently claimed his place in the durrrr challenge queue.

From a post in Schwatrz’s blog over at BlackBeltPoker.com: “I’m waiting to do the durrrr challenge, but he’s still messing around with Patrik. I played 10 or 20 sessions with this guy on Full Tilt and we did 25,000 hands, so it doesn’t take much to do 50,000, but they’re taking ages. Probably drawing it out for publicity, or durrrr could be struggling for money. He’s like four million down for the year I reckon.”

Schwartz continues: “I think I’m next on the waiting list, and if he actually manages to finish with Patrik and ever has the money to do it, then yeah, I’ll definitely play him. I’m up loads over him online, and am pretty good at four-tabling, so of course I’m not gonna say no to a 3:1 bet.”

Dwan’s response in a thread over at 2+2: “I call.”

The two played some HU cash later on, resulting in the following entertaining chat after durrrr cracked FF’s AA with 97o:

durrrr: plsplspls
durrrr: find the 500k somewhere
__FullFlush1__: too much of a joke
durrrr: to post
durrrr: please
durrrr: i mean
__FullFlush1__: they always get u out of it
durrrr: dont break any laws to get it
durrrr: then id feel bad
durrrr: but find it somewhere
durrrr: please
__FullFlush1__: play later pie munching time
分享到:  QQ好友和群QQ好友和群 QQ空间QQ空间 腾讯微博腾讯微博 腾讯朋友腾讯朋友 微信微信
收藏收藏
您需要登录后才可以回帖 登录 | 注册

本版积分规则

手机版|Archiver|智游城论坛

GMT+8, 2024-11-11 00:38 , Processed in 0.055191 second(s), 8 queries , Redis On.

Powered by Discuz! X3.2

© 2001-2012 Comsenz Inc.

返回顶部