<?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: How to Find Candidate Moves in a Chess Position	</title>
	<atom:link href="https://chessfox.com/how-to-find-candidate-moves-in-a-chess-position/feed/" rel="self" type="application/rss+xml" />
	<link>https://chessfox.com</link>
	<description>Structured Chess Training</description>
	<lastBuildDate>Mon, 11 May 2020 04:57:57 +0000</lastBuildDate>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=7.0.2</generator>
	<item>
		<title>
		By: Louis		</title>
		<link>https://chessfox.com/how-to-find-candidate-moves-in-a-chess-position/comment-page-1/#comment-259</link>

		<dc:creator><![CDATA[Louis]]></dc:creator>
		<pubDate>Sat, 02 Dec 2017 14:29:27 +0000</pubDate>
		<guid isPermaLink="false">https://chessfox.com/?page_id=12926#comment-259</guid>

					<description><![CDATA[In reply to &lt;a href=&quot;https://chessfox.com/how-to-find-candidate-moves-in-a-chess-position/comment-page-1/#comment-258&quot;&gt;marc adams&lt;/a&gt;.

Hi Marc, it&#039;s quite a difficult topic to write about partly because a lot of planning is subjective (even the top computers in the world often differ in their &quot;opinion&quot;). But I will see if I can create something for this as many people feel they need it. For the time being I can say this - in most positions your plan will simply be &quot;how can I improve my position&quot;. So in most positions you&#039;re looking for a 2-3 move combination that improves your position or weakens/prevents your opponent&#039;s plan. The evaluation thinking method I present in the 10-Day challenge can be useful in this regard.]]></description>
			<content:encoded><![CDATA[<p>In reply to <a href="https://chessfox.com/how-to-find-candidate-moves-in-a-chess-position/comment-page-1/#comment-258">marc adams</a>.</p>
<p>Hi Marc, it&#8217;s quite a difficult topic to write about partly because a lot of planning is subjective (even the top computers in the world often differ in their &#8220;opinion&#8221;). But I will see if I can create something for this as many people feel they need it. For the time being I can say this &#8211; in most positions your plan will simply be &#8220;how can I improve my position&#8221;. So in most positions you&#8217;re looking for a 2-3 move combination that improves your position or weakens/prevents your opponent&#8217;s plan. The evaluation thinking method I present in the 10-Day challenge can be useful in this regard.</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: marc adams		</title>
		<link>https://chessfox.com/how-to-find-candidate-moves-in-a-chess-position/comment-page-1/#comment-258</link>

		<dc:creator><![CDATA[marc adams]]></dc:creator>
		<pubDate>Fri, 01 Dec 2017 21:23:59 +0000</pubDate>
		<guid isPermaLink="false">https://chessfox.com/?page_id=12926#comment-258</guid>

					<description><![CDATA[Dear Louis, I am very eager to improve my planning capabilities and appreciate enormously  what you have written on the subject. Can you put together a study (of say 40 examples) of HOW TO FIND  the correct plan ? I really need more information on the subject. Also, can you provide more information on the various chess games(QGD, Sicilian etc) and the plans surrounding them.
  Thanks again for being the first person I have found to offer a comprehensive chess method that is calm and rational and clear!  - Marc]]></description>
			<content:encoded><![CDATA[<p>Dear Louis, I am very eager to improve my planning capabilities and appreciate enormously  what you have written on the subject. Can you put together a study (of say 40 examples) of HOW TO FIND  the correct plan ? I really need more information on the subject. Also, can you provide more information on the various chess games(QGD, Sicilian etc) and the plans surrounding them.<br />
  Thanks again for being the first person I have found to offer a comprehensive chess method that is calm and rational and clear!  &#8211; Marc</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Anonymous		</title>
		<link>https://chessfox.com/how-to-find-candidate-moves-in-a-chess-position/comment-page-1/#comment-193</link>

		<dc:creator><![CDATA[Anonymous]]></dc:creator>
		<pubDate>Sat, 20 May 2017 13:17:24 +0000</pubDate>
		<guid isPermaLink="false">https://chessfox.com/?page_id=12926#comment-193</guid>

					<description><![CDATA[Hi
Thanks for you]]></description>
			<content:encoded><![CDATA[<p>Hi<br />
Thanks for you</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Louis		</title>
		<link>https://chessfox.com/how-to-find-candidate-moves-in-a-chess-position/comment-page-1/#comment-191</link>

		<dc:creator><![CDATA[Louis]]></dc:creator>
		<pubDate>Fri, 12 May 2017 08:55:15 +0000</pubDate>
		<guid isPermaLink="false">https://chessfox.com/?page_id=12926#comment-191</guid>

					<description><![CDATA[In reply to &lt;a href=&quot;https://chessfox.com/how-to-find-candidate-moves-in-a-chess-position/comment-page-1/#comment-190&quot;&gt;Don&lt;/a&gt;.

You are welcome. Thank you!]]></description>
			<content:encoded><![CDATA[<p>In reply to <a href="https://chessfox.com/how-to-find-candidate-moves-in-a-chess-position/comment-page-1/#comment-190">Don</a>.</p>
<p>You are welcome. Thank you!</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Don		</title>
		<link>https://chessfox.com/how-to-find-candidate-moves-in-a-chess-position/comment-page-1/#comment-190</link>

		<dc:creator><![CDATA[Don]]></dc:creator>
		<pubDate>Fri, 12 May 2017 01:44:47 +0000</pubDate>
		<guid isPermaLink="false">https://chessfox.com/?page_id=12926#comment-190</guid>

					<description><![CDATA[Thank you for the study material, it is very helpful. You ROCK my friend!]]></description>
			<content:encoded><![CDATA[<p>Thank you for the study material, it is very helpful. You ROCK my friend!</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Louis		</title>
		<link>https://chessfox.com/how-to-find-candidate-moves-in-a-chess-position/comment-page-1/#comment-188</link>

		<dc:creator><![CDATA[Louis]]></dc:creator>
		<pubDate>Sun, 30 Apr 2017 13:14:13 +0000</pubDate>
		<guid isPermaLink="false">https://chessfox.com/?page_id=12926#comment-188</guid>

					<description><![CDATA[In reply to &lt;a href=&quot;https://chessfox.com/how-to-find-candidate-moves-in-a-chess-position/comment-page-1/#comment-187&quot;&gt;Teodor&lt;/a&gt;.

Mulțumesc Teodor, You are welcome and thank you for sharing your thoughts.]]></description>
			<content:encoded><![CDATA[<p>In reply to <a href="https://chessfox.com/how-to-find-candidate-moves-in-a-chess-position/comment-page-1/#comment-187">Teodor</a>.</p>
<p>Mulțumesc Teodor, You are welcome and thank you for sharing your thoughts.</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Teodor		</title>
		<link>https://chessfox.com/how-to-find-candidate-moves-in-a-chess-position/comment-page-1/#comment-187</link>

		<dc:creator><![CDATA[Teodor]]></dc:creator>
		<pubDate>Sun, 30 Apr 2017 08:18:00 +0000</pubDate>
		<guid isPermaLink="false">https://chessfox.com/?page_id=12926#comment-187</guid>

					<description><![CDATA[Hello Louis,
Tot ce se poate citi pe situl tau este extrem de util pentru jucatorii de sah si nu numai!
Propun totusi un algoritm:Analiza-Plan- Program,care sintetizeaza procesul de gandire prezentat !
 Multumesc pentru tot ce prezinti pe situl tau!
                                                                           TeodorP.]]></description>
			<content:encoded><![CDATA[<p>Hello Louis,<br />
Tot ce se poate citi pe situl tau este extrem de util pentru jucatorii de sah si nu numai!<br />
Propun totusi un algoritm:Analiza-Plan- Program,care sintetizeaza procesul de gandire prezentat !<br />
 Multumesc pentru tot ce prezinti pe situl tau!<br />
                                                                           TeodorP.</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Teodor		</title>
		<link>https://chessfox.com/how-to-find-candidate-moves-in-a-chess-position/comment-page-1/#comment-186</link>

		<dc:creator><![CDATA[Teodor]]></dc:creator>
		<pubDate>Sun, 30 Apr 2017 08:17:26 +0000</pubDate>
		<guid isPermaLink="false">https://chessfox.com/?page_id=12926#comment-186</guid>

					<description><![CDATA[In reply to &lt;a href=&quot;https://chessfox.com/how-to-find-candidate-moves-in-a-chess-position/comment-page-1/#comment-184&quot;&gt;Louis&lt;/a&gt;.

Hello Louis,
Tot ce se poate citi pe situl tau este extrem de util pentru jucatorii de sah si nu numai!
Propun totusi un algoritm:Analiza-Plan- Program,care sintetizeaza procesul de gandire prezentat !
 Multumesc pentru tot ce prezinti pe situl tau!
                                                                           TeodorP.]]></description>
			<content:encoded><![CDATA[<p>In reply to <a href="https://chessfox.com/how-to-find-candidate-moves-in-a-chess-position/comment-page-1/#comment-184">Louis</a>.</p>
<p>Hello Louis,<br />
Tot ce se poate citi pe situl tau este extrem de util pentru jucatorii de sah si nu numai!<br />
Propun totusi un algoritm:Analiza-Plan- Program,care sintetizeaza procesul de gandire prezentat !<br />
 Multumesc pentru tot ce prezinti pe situl tau!<br />
                                                                           TeodorP.</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Louis		</title>
		<link>https://chessfox.com/how-to-find-candidate-moves-in-a-chess-position/comment-page-1/#comment-185</link>

		<dc:creator><![CDATA[Louis]]></dc:creator>
		<pubDate>Thu, 27 Apr 2017 20:01:49 +0000</pubDate>
		<guid isPermaLink="false">https://chessfox.com/?page_id=12926#comment-185</guid>

					<description><![CDATA[In reply to &lt;a href=&quot;https://chessfox.com/how-to-find-candidate-moves-in-a-chess-position/comment-page-1/#comment-183&quot;&gt;Ronald Ribman&lt;/a&gt;.

Thank you, I appreciate your comments on my chess instructions materials.]]></description>
			<content:encoded><![CDATA[<p>In reply to <a href="https://chessfox.com/how-to-find-candidate-moves-in-a-chess-position/comment-page-1/#comment-183">Ronald Ribman</a>.</p>
<p>Thank you, I appreciate your comments on my chess instructions materials.</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Louis		</title>
		<link>https://chessfox.com/how-to-find-candidate-moves-in-a-chess-position/comment-page-1/#comment-184</link>

		<dc:creator><![CDATA[Louis]]></dc:creator>
		<pubDate>Thu, 27 Apr 2017 20:00:57 +0000</pubDate>
		<guid isPermaLink="false">https://chessfox.com/?page_id=12926#comment-184</guid>

					<description><![CDATA[In reply to &lt;a href=&quot;https://chessfox.com/how-to-find-candidate-moves-in-a-chess-position/comment-page-1/#comment-182&quot;&gt;maurice&lt;/a&gt;.

Thank you.]]></description>
			<content:encoded><![CDATA[<p>In reply to <a href="https://chessfox.com/how-to-find-candidate-moves-in-a-chess-position/comment-page-1/#comment-182">maurice</a>.</p>
<p>Thank you.</p>
]]></content:encoded>
		
			</item>
	</channel>
</rss>

<!--
Performance optimized by W3 Total Cache. Learn more: https://www.boldgrid.com/w3-total-cache/?utm_source=w3tc&utm_medium=footer_comment&utm_campaign=free_plugin

Page Caching using Disk: Enhanced 

Served from: chessfox.com @ 2026-07-27 22:47:18 by W3 Total Cache
-->