<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Poker Vs Chess</title>
	<atom:link href="http://www.overcomingbias.com/2008/07/poker-vs-chess.html/feed" rel="self" type="application/rss+xml" />
	<link>http://www.overcomingbias.com/2008/07/poker-vs-chess.html</link>
	<description>Overcoming Bias is economist Robin Hanson’s blog, on honesty, signaling, disagreement, forecasting, and the far future.</description>
	<lastBuildDate>Sat, 11 Feb 2012 23:03:19 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.1.3</generator>
	<item>
		<title>By: Michael</title>
		<link>http://www.overcomingbias.com/2008/07/poker-vs-chess.html#comment-400414</link>
		<dc:creator>Michael</dc:creator>
		<pubDate>Mon, 14 Jul 2008 18:06:51 +0000</pubDate>
		<guid isPermaLink="false">http://prod.ob.trike.com.au/2008/07/poker-vs-chess.html#comment-400414</guid>
		<description>The set of those people who are still reading this thread and who do not check in on the Freakonomics blog is probably pretty slim, but for those in that intersection, you might want to check out Levitt&#039;s two cents:

http://freakonomics.blogs.nytimes.com/2008/07/14/overreacting-to-a-computer-beating-poker-pros/
</description>
		<content:encoded><![CDATA[<p>The set of those people who are still reading this thread and who do not check in on the Freakonomics blog is probably pretty slim, but for those in that intersection, you might want to check out Levitt&#8217;s two cents:</p>
<p><a href="http://freakonomics.blogs.nytimes.com/2008/07/14/overreacting-to-a-computer-beating-poker-pros/" rel="nofollow">http://freakonomics.blogs.nytimes.com/2008/07/14/overreacting-to-a-computer-beating-poker-pros/</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Allan Crossman</title>
		<link>http://www.overcomingbias.com/2008/07/poker-vs-chess.html#comment-400413</link>
		<dc:creator>Allan Crossman</dc:creator>
		<pubDate>Fri, 11 Jul 2008 18:30:50 +0000</pubDate>
		<guid isPermaLink="false">http://prod.ob.trike.com.au/2008/07/poker-vs-chess.html#comment-400413</guid>
		<description>&lt;i&gt;in poker there is a lot of luck involved, isn&#039;t it? Then how a computer could excel in poker games?&lt;/i&gt;

It&#039;s not &lt;i&gt;just&lt;/i&gt; luck; there are important decisions to make all the time (unlike roulette, craps, etc). But it&#039;s true that luck plays a big part, which is why poker players tend to measure success in terms of how well they do over the course of a year, say.
</description>
		<content:encoded><![CDATA[<p><i>in poker there is a lot of luck involved, isn&#8217;t it? Then how a computer could excel in poker games?</i></p>
<p>It&#8217;s not <i>just</i> luck; there are important decisions to make all the time (unlike roulette, craps, etc). But it&#8217;s true that luck plays a big part, which is why poker players tend to measure success in terms of how well they do over the course of a year, say.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Peter de Blanc</title>
		<link>http://www.overcomingbias.com/2008/07/poker-vs-chess.html#comment-400412</link>
		<dc:creator>Peter de Blanc</dc:creator>
		<pubDate>Fri, 11 Jul 2008 17:05:00 +0000</pubDate>
		<guid isPermaLink="false">http://prod.ob.trike.com.au/2008/07/poker-vs-chess.html#comment-400412</guid>
		<description>poker: the computer can simulate the life cycles of 6 million four-leaf clovers per second, making it luckier than the luckiest human.
</description>
		<content:encoded><![CDATA[<p>poker: the computer can simulate the life cycles of 6 million four-leaf clovers per second, making it luckier than the luckiest human.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: poker</title>
		<link>http://www.overcomingbias.com/2008/07/poker-vs-chess.html#comment-400411</link>
		<dc:creator>poker</dc:creator>
		<pubDate>Fri, 11 Jul 2008 15:58:41 +0000</pubDate>
		<guid isPermaLink="false">http://prod.ob.trike.com.au/2008/07/poker-vs-chess.html#comment-400411</guid>
		<description>in poker there is a lot of luck involved, isn&#039;t it? Then how a computer could excel in poker games?
</description>
		<content:encoded><![CDATA[<p>in poker there is a lot of luck involved, isn&#8217;t it? Then how a computer could excel in poker games?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tim Tyler</title>
		<link>http://www.overcomingbias.com/2008/07/poker-vs-chess.html#comment-400410</link>
		<dc:creator>Tim Tyler</dc:creator>
		<pubDate>Thu, 10 Jul 2008 20:15:29 +0000</pubDate>
		<guid isPermaLink="false">http://prod.ob.trike.com.au/2008/07/poker-vs-chess.html#comment-400410</guid>
		<description>Re: &lt;em&gt;very little news coverage&lt;/em&gt; - the story was mentioned on Slashdot:

http://hardware.slashdot.org/article.pl?sid=08/07/09/2014228

</description>
		<content:encoded><![CDATA[<p>Re: <em>very little news coverage</em> &#8211; the story was mentioned on Slashdot:</p>
<p><a href="http://hardware.slashdot.org/article.pl?sid=08/07/09/2014228" rel="nofollow">http://hardware.slashdot.org/article.pl?sid=08/07/09/2014228</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: M</title>
		<link>http://www.overcomingbias.com/2008/07/poker-vs-chess.html#comment-400409</link>
		<dc:creator>M</dc:creator>
		<pubDate>Thu, 10 Jul 2008 14:10:19 +0000</pubDate>
		<guid isPermaLink="false">http://prod.ob.trike.com.au/2008/07/poker-vs-chess.html#comment-400409</guid>
		<description>Now that the University of Alberta has a robot that can beat the best poker players I think we can start to see the Edmonton campus expand.
</description>
		<content:encoded><![CDATA[<p>Now that the University of Alberta has a robot that can beat the best poker players I think we can start to see the Edmonton campus expand.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: dagon</title>
		<link>http://www.overcomingbias.com/2008/07/poker-vs-chess.html#comment-400408</link>
		<dc:creator>dagon</dc:creator>
		<pubDate>Wed, 09 Jul 2008 21:47:36 +0000</pubDate>
		<guid isPermaLink="false">http://prod.ob.trike.com.au/2008/07/poker-vs-chess.html#comment-400408</guid>
		<description>&lt;i&gt;The moral: beware of underestimating computers by underestimating the difficulty of the tasks at which they excel.&lt;/i&gt;

s/under/over/  Or maybe just &quot;misestimating&quot;.  It&#039;s very easy to generalize incorrectly in either direction from this story.  In reality, it&#039;s no more (nor less, to be sure) impressive than, say, a medical or financial system with a few hundred variables and a few dozens of models to weigh.

http://poker.cs.ualberta.ca/papers/Papers/johanson.msc.pdf is a good semi-technical description of how the software works.  As you read it, you&#039;re likely to be less impressed with it as a measure of &quot;machine ability&quot;, and perhaps more impressed with the engineering and theory that goes into &quot;machine-creating ability&quot;.
</description>
		<content:encoded><![CDATA[<p><i>The moral: beware of underestimating computers by underestimating the difficulty of the tasks at which they excel.</i></p>
<p>s/under/over/  Or maybe just &#8220;misestimating&#8221;.  It&#8217;s very easy to generalize incorrectly in either direction from this story.  In reality, it&#8217;s no more (nor less, to be sure) impressive than, say, a medical or financial system with a few hundred variables and a few dozens of models to weigh.</p>
<p><a href="http://poker.cs.ualberta.ca/papers/Papers/johanson.msc.pdf" rel="nofollow">http://poker.cs.ualberta.ca/papers/Papers/johanson.msc.pdf</a> is a good semi-technical description of how the software works.  As you read it, you&#8217;re likely to be less impressed with it as a measure of &#8220;machine ability&#8221;, and perhaps more impressed with the engineering and theory that goes into &#8220;machine-creating ability&#8221;.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Kaj Sotala</title>
		<link>http://www.overcomingbias.com/2008/07/poker-vs-chess.html#comment-400407</link>
		<dc:creator>Kaj Sotala</dc:creator>
		<pubDate>Wed, 09 Jul 2008 20:27:46 +0000</pubDate>
		<guid isPermaLink="false">http://prod.ob.trike.com.au/2008/07/poker-vs-chess.html#comment-400407</guid>
		<description>Doug S:
&lt;i&gt;It plays not to lose, using no opponent modeling whatsoever.&lt;/i&gt;

The linked article indicates this is not the case.

&lt;blockquote&gt;&quot;And secondly, we have added an element of learning, where Polaris identifies which common poker stratagy a human is using and switches its own strategy to counter. This complicated the human players ability to compare notes, since Polaris chose a different strategy to use against each of the humans it played,&quot; Bowling said.&quot;

...

Before the Las Vegas match, this newest version of Polaris had only played two matches against champion poker players, resulting in one loss and one victory. Polaris repeated the pattern of improving as it learned, falling to humans in the first two rounds, but defeating them in rounds three and four. &quot;Repeatedly, I heard players exclaim that they had never seen a human do that before,&quot; said Bowling. &quot;Switching strategies really threw the humans for a loop.&quot;&lt;/blockquote&gt;
</description>
		<content:encoded><![CDATA[<p>Doug S:<br />
<i>It plays not to lose, using no opponent modeling whatsoever.</i></p>
<p>The linked article indicates this is not the case.</p>
<blockquote><p>&#8220;And secondly, we have added an element of learning, where Polaris identifies which common poker stratagy a human is using and switches its own strategy to counter. This complicated the human players ability to compare notes, since Polaris chose a different strategy to use against each of the humans it played,&#8221; Bowling said.&#8221;</p>
<p>&#8230;</p>
<p>Before the Las Vegas match, this newest version of Polaris had only played two matches against champion poker players, resulting in one loss and one victory. Polaris repeated the pattern of improving as it learned, falling to humans in the first two rounds, but defeating them in rounds three and four. &#8220;Repeatedly, I heard players exclaim that they had never seen a human do that before,&#8221; said Bowling. &#8220;Switching strategies really threw the humans for a loop.&#8221;</p></blockquote>
]]></content:encoded>
	</item>
	<item>
		<title>By: Aleksei Riikonen</title>
		<link>http://www.overcomingbias.com/2008/07/poker-vs-chess.html#comment-400406</link>
		<dc:creator>Aleksei Riikonen</dc:creator>
		<pubDate>Wed, 09 Jul 2008 19:42:32 +0000</pubDate>
		<guid isPermaLink="false">http://prod.ob.trike.com.au/2008/07/poker-vs-chess.html#comment-400406</guid>
		<description>As a semi-professional poker player, I&#039;d like to say that the article being quited does not understand the event being reported very well, since they say &lt;i&gt;&quot;Humanity was dealt a decisive blow by a poker-playing artificial intelligence program&quot;&lt;/i&gt;.

This was no decisive blow, it was a single test, where each round consisted of only 500 hands of one of the simplest forms of poker, and the AI come out on top by a rather small margin. Could very well have been luck. Further tests will tell.

That said, I will not be terribly surprised even if we get real evidence that AIs can now beat humans at Heads-Up Limit Hold&#039;em. My guess however is that this current AI will not end up demonstrating decisive superiority, but that we might very well see such a superior AI in 1-3 years. Or not.

And that is if we are talking about Limit poker. In the case of No Limit, I find it very hard to guess when AIs will reach the human level of ability. Won&#039;t be extremely soon, and the problem might even be AI-Complete, requiring essentially human-level ability to model the strategies of another human. No Limit poker is not so much straightforward math as Limit poker is. It is more about being better at modeling your opponent&#039;s decision-making than they are at modeling yours. (A nice shortcut to seeing whether this Polaris AI will eventually end up easily beatable by some pros would actually be to hand over it&#039;s source code for their examination. Even Limit poker might be substantially less mathy at the highest level than I estimate. I am not a Limit pro.)

By the way, AI bots have already been used for several years to make lots of money playing Limit poker online. Some people have farms of bots playing lots of tables. The poker sites disallow and (some) try to monitor this, but there are always anti-detection solutions. The prevalence of bots in Limit poker has caused a lot of people to shift over to playing No Limit.
</description>
		<content:encoded><![CDATA[<p>As a semi-professional poker player, I&#8217;d like to say that the article being quited does not understand the event being reported very well, since they say <i>&#8220;Humanity was dealt a decisive blow by a poker-playing artificial intelligence program&#8221;</i>.</p>
<p>This was no decisive blow, it was a single test, where each round consisted of only 500 hands of one of the simplest forms of poker, and the AI come out on top by a rather small margin. Could very well have been luck. Further tests will tell.</p>
<p>That said, I will not be terribly surprised even if we get real evidence that AIs can now beat humans at Heads-Up Limit Hold&#8217;em. My guess however is that this current AI will not end up demonstrating decisive superiority, but that we might very well see such a superior AI in 1-3 years. Or not.</p>
<p>And that is if we are talking about Limit poker. In the case of No Limit, I find it very hard to guess when AIs will reach the human level of ability. Won&#8217;t be extremely soon, and the problem might even be AI-Complete, requiring essentially human-level ability to model the strategies of another human. No Limit poker is not so much straightforward math as Limit poker is. It is more about being better at modeling your opponent&#8217;s decision-making than they are at modeling yours. (A nice shortcut to seeing whether this Polaris AI will eventually end up easily beatable by some pros would actually be to hand over it&#8217;s source code for their examination. Even Limit poker might be substantially less mathy at the highest level than I estimate. I am not a Limit pro.)</p>
<p>By the way, AI bots have already been used for several years to make lots of money playing Limit poker online. Some people have farms of bots playing lots of tables. The poker sites disallow and (some) try to monitor this, but there are always anti-detection solutions. The prevalence of bots in Limit poker has caused a lot of people to shift over to playing No Limit.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Doug S.</title>
		<link>http://www.overcomingbias.com/2008/07/poker-vs-chess.html#comment-400405</link>
		<dc:creator>Doug S.</dc:creator>
		<pubDate>Wed, 09 Jul 2008 19:34:07 +0000</pubDate>
		<guid isPermaLink="false">http://prod.ob.trike.com.au/2008/07/poker-vs-chess.html#comment-400405</guid>
		<description>The poker-playing AI that I heard about a while ago, which gave a human champion a run for his money, used an approximation to the game-theoretic optimum strategy for heads-up limit poker. To clarify, the game-theoretic optimum strategy the is one that is not exploitable; the most any opponent can do against it is break even. For example, in Rock-Paper-Scissors, the &quot;optimum&quot; strategy is to choose randomly, with an equal probability of making each throw. This strategy cannot be exploited. On the other hand, this strategy is also incapable of exploiting an opponent&#039;s mistakes; even an opponent that always chooses Rock will break even.

In other words, this poker bot, if it&#039;s the one I&#039;ve heard of before, doesn&#039;t play to win. It plays not to lose, using no opponent modeling whatsoever. If its opponent doesn&#039;t make &quot;dominated errors&quot; - moves that are strictly worse than another - it will tend to break even, no matter how predictable its opponent is. Furthermore, a move is a dominated error if and only if an optimal strategy uses it with probability zero. Even if the optimal strategy says &quot;make this move with probability 1/1000&quot; then it won&#039;t do better than break even against a strategy that says &quot;make this move with probability 1.&quot; However, Poker is sufficiently complicated that it&#039;s not apparent whether a move could be a dominated error, so there might still be ways for a human to screw up that an &quot;optimal&quot; bot will exploit.

(Also, the bot uses an approximation to the optimal strategy, as finding the true optimal strategy is computationally intractable. However, it does seem to be a pretty good approximation, as it has been successful against top human players.)
</description>
		<content:encoded><![CDATA[<p>The poker-playing AI that I heard about a while ago, which gave a human champion a run for his money, used an approximation to the game-theoretic optimum strategy for heads-up limit poker. To clarify, the game-theoretic optimum strategy the is one that is not exploitable; the most any opponent can do against it is break even. For example, in Rock-Paper-Scissors, the &#8220;optimum&#8221; strategy is to choose randomly, with an equal probability of making each throw. This strategy cannot be exploited. On the other hand, this strategy is also incapable of exploiting an opponent&#8217;s mistakes; even an opponent that always chooses Rock will break even.</p>
<p>In other words, this poker bot, if it&#8217;s the one I&#8217;ve heard of before, doesn&#8217;t play to win. It plays not to lose, using no opponent modeling whatsoever. If its opponent doesn&#8217;t make &#8220;dominated errors&#8221; &#8211; moves that are strictly worse than another &#8211; it will tend to break even, no matter how predictable its opponent is. Furthermore, a move is a dominated error if and only if an optimal strategy uses it with probability zero. Even if the optimal strategy says &#8220;make this move with probability 1/1000&#8243; then it won&#8217;t do better than break even against a strategy that says &#8220;make this move with probability 1.&#8221; However, Poker is sufficiently complicated that it&#8217;s not apparent whether a move could be a dominated error, so there might still be ways for a human to screw up that an &#8220;optimal&#8221; bot will exploit.</p>
<p>(Also, the bot uses an approximation to the optimal strategy, as finding the true optimal strategy is computationally intractable. However, it does seem to be a pretty good approximation, as it has been successful against top human players.)</p>
]]></content:encoded>
	</item>
</channel>
</rss>

<!-- Performance optimized by W3 Total Cache. Learn more: http://www.w3-edge.com/wordpress-plugins/

Page Caching using disk (enhanced)
Database Caching using disk
Object Caching 438/455 objects using disk
Content Delivery Network via Amazon Web Services: S3: overcomingbias-assets.s3.amazonaws.com

Served from: www.overcomingbias.com @ 2012-02-11 18:16:39 -->
