<?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: Chess Programs Are Not Smart</title>
	<atom:link href="http://www.zenpawn.com/chessblog/2008/07/chess-programs-are-not-smart/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.zenpawn.com/chessblog/2008/07/chess-programs-are-not-smart/</link>
	<description>my chess blog</description>
	<lastBuildDate>Sat, 13 Mar 2010 19:58:12 -0800</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<xhtml:meta xmlns:xhtml="http://www.w3.org/1999/xhtml" name="robots" content="noindex" />
	<item>
		<title>By: The Game of Go &#171; Sanjeev and his Green Destiny</title>
		<link>http://www.zenpawn.com/chessblog/2008/07/chess-programs-are-not-smart/comment-page-1/#comment-38</link>
		<dc:creator>The Game of Go &#171; Sanjeev and his Green Destiny</dc:creator>
		<pubDate>Fri, 03 Oct 2008 03:55:49 +0000</pubDate>
		<guid isPermaLink="false">http://www.zenpawn.com/chessblog/?p=30#comment-38</guid>
		<description>[...] Here is an article that shows why MInimax Theorem is not always practically optimal. [...]</description>
		<content:encoded><![CDATA[<p>[...] Here is an article that shows why MInimax Theorem is not always practically optimal. [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Thomas</title>
		<link>http://www.zenpawn.com/chessblog/2008/07/chess-programs-are-not-smart/comment-page-1/#comment-20</link>
		<dc:creator>Thomas</dc:creator>
		<pubDate>Tue, 12 Aug 2008 11:24:00 +0000</pubDate>
		<guid isPermaLink="false">http://www.zenpawn.com/chessblog/?p=30#comment-20</guid>
		<description>oops, the HTML-Code to show the board didn&#039;t work, so here is the FEN of the test position:

8/8/pppppppK/NBBR1NRp/nbbrqnrP/PPPPPPPk/8/Q7 w - - 0 64

Control:

White: Kh6,Qa1,Na5,f5,Bb5,c5,Rd5,g5,Pa3,b3,c3,d3,e3,f3,g3,h4
Black: Kh3,Qe4,Na4,f4,Bb4,c4,Rd4,g4,Pa6,b6,c6,d6,e6,f6,g6,h5

White to mate in 1.

Have fun testing!

Thomas.</description>
		<content:encoded><![CDATA[<p>oops, the HTML-Code to show the board didn&#8217;t work, so here is the FEN of the test position:</p>
<p>8/8/pppppppK/NBBR1NRp/nbbrqnrP/PPPPPPPk/8/Q7 w &#8211; - 0 64</p>
<p>Control:</p>
<p>White: Kh6,Qa1,Na5,f5,Bb5,c5,Rd5,g5,Pa3,b3,c3,d3,e3,f3,g3,h4<br />
Black: Kh3,Qe4,Na4,f4,Bb4,c4,Rd4,g4,Pa6,b6,c6,d6,e6,f6,g6,h5</p>
<p>White to mate in 1.</p>
<p>Have fun testing!</p>
<p>Thomas.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: zenpawn</title>
		<link>http://www.zenpawn.com/chessblog/2008/07/chess-programs-are-not-smart/comment-page-1/#comment-19</link>
		<dc:creator>zenpawn</dc:creator>
		<pubDate>Tue, 12 Aug 2008 10:59:18 +0000</pubDate>
		<guid isPermaLink="false">http://www.zenpawn.com/chessblog/?p=30#comment-19</guid>
		<description>Thomas, could you please provide the FEN for the position you reference in your comment?  If you tried HTML, it got stripped automatically.  With the FEN, folks can just plug it into my reader at http://www.zenpawn.com/fen_reader/form.php  Thanks.</description>
		<content:encoded><![CDATA[<p>Thomas, could you please provide the FEN for the position you reference in your comment?  If you tried HTML, it got stripped automatically.  With the FEN, folks can just plug it into my reader at <a href="http://www.zenpawn.com/fen_reader/form.php" >http://www.zenpawn.com/fen_reader/form.php</a>  Thanks.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Thomas</title>
		<link>http://www.zenpawn.com/chessblog/2008/07/chess-programs-are-not-smart/comment-page-1/#comment-18</link>
		<dc:creator>Thomas</dc:creator>
		<pubDate>Tue, 12 Aug 2008 10:50:35 +0000</pubDate>
		<guid isPermaLink="false">http://www.zenpawn.com/chessblog/?p=30#comment-18</guid>
		<description>Even Rybka 3 that is out now won&#039;t find the rook sacrifice mentioned in my article so easily, at least not if left alone, but: There is a new development, if you switch to multi-variant mode while analyzing, it will find it. Not that this is a big deal.

I mentioned move sorting in order to enhance alpha-beta, and there is following
position to demonstrate this:



This is a valid position that can be reached from the start position,
I can provide the moves if required.

It&#039;s a mate in one! Humans can spot this easily, but try this on any engine, maybe you&#039;ll be surprised! Most engines search exchange move first before checking for checkmate, and you&#039;ll notice the results.

Have fun,
Thomas.</description>
		<content:encoded><![CDATA[<p>Even Rybka 3 that is out now won&#8217;t find the rook sacrifice mentioned in my article so easily, at least not if left alone, but: There is a new development, if you switch to multi-variant mode while analyzing, it will find it. Not that this is a big deal.</p>
<p>I mentioned move sorting in order to enhance alpha-beta, and there is following<br />
position to demonstrate this:</p>
<p>This is a valid position that can be reached from the start position,<br />
I can provide the moves if required.</p>
<p>It&#8217;s a mate in one! Humans can spot this easily, but try this on any engine, maybe you&#8217;ll be surprised! Most engines search exchange move first before checking for checkmate, and you&#8217;ll notice the results.</p>
<p>Have fun,<br />
Thomas.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Anthony</title>
		<link>http://www.zenpawn.com/chessblog/2008/07/chess-programs-are-not-smart/comment-page-1/#comment-17</link>
		<dc:creator>Anthony</dc:creator>
		<pubDate>Sun, 10 Aug 2008 02:27:27 +0000</pubDate>
		<guid isPermaLink="false">http://www.zenpawn.com/chessblog/?p=30#comment-17</guid>
		<description>The way of human&#039;s brain thinking is way different from chess program&#039;s. If the difference is serial and parallel, can the chess program become a little bit smarter when it is being run on millions of computer simultaneously? Or will it automatically solves any of the problems mentioned in the above article if more computer power is obtained? Apparently not!</description>
		<content:encoded><![CDATA[<p>The way of human&#8217;s brain thinking is way different from chess program&#8217;s. If the difference is serial and parallel, can the chess program become a little bit smarter when it is being run on millions of computer simultaneously? Or will it automatically solves any of the problems mentioned in the above article if more computer power is obtained? Apparently not!</p>
]]></content:encoded>
	</item>
</channel>
</rss>
