<?xml version="1.0" encoding="UTF-8" ?>
<?xml-stylesheet type="text/xsl" href="http://blogs.msdn.com/utility/FeedStylesheets/rss.xsl" media="screen"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:wfw="http://wellformedweb.org/CommentAPI/"><channel><title>Path Finding Using A* in C# 3.0, Part Four</title><link>http://blogs.msdn.com/ericlippert/archive/2007/10/10/path-finding-using-a-in-c-3-0-part-four.aspx</link><description>Finally we are ready to translate our pseudocode into C# 3.0. What do we need to make the algorithm run? We need a start node, a destination node, a function which tells us the exact distance between two neighbours, and a function which tells us the estimated</description><dc:language>en-US</dc:language><generator>CommunityServer 2.1 SP1 (Build: 61025.2)</generator><item><title>Techy News Blog &amp;raquo; Path Finding Using A* in C# 3.0, Part Four</title><link>http://blogs.msdn.com/ericlippert/archive/2007/10/10/path-finding-using-a-in-c-3-0-part-four.aspx#5391753</link><pubDate>Wed, 10 Oct 2007 17:26:17 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:5391753</guid><dc:creator>Techy News Blog » Path Finding Using A* in C# 3.0, Part Four</dc:creator><description>&lt;p&gt;PingBack from &lt;a rel="nofollow" target="_new" href="http://www.artofbam.com/wordpress/?p=6818"&gt;http://www.artofbam.com/wordpress/?p=6818&lt;/a&gt;&lt;/p&gt;
</description></item><item><title>re: Path Finding Using A* in C# 3.0, Part Four</title><link>http://blogs.msdn.com/ericlippert/archive/2007/10/10/path-finding-using-a-in-c-3-0-part-four.aspx#5392704</link><pubDate>Wed, 10 Oct 2007 20:38:16 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:5392704</guid><dc:creator>Billy McCafferty</dc:creator><description>&lt;p&gt;This has been a great series of posts Eric. &amp;nbsp;I've been tinkering with programming SLAM for an iRobot Create with a CharmedLabs Qwerk controller, and this A* will come in quite handy.&lt;/p&gt;
</description></item><item><title>re: Path Finding Using A* in C# 3.0, Part Four</title><link>http://blogs.msdn.com/ericlippert/archive/2007/10/10/path-finding-using-a-in-c-3-0-part-four.aspx#5395026</link><pubDate>Thu, 11 Oct 2007 01:35:09 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:5395026</guid><dc:creator>Matt Hamilton</dc:creator><description>&lt;p&gt;Shouldn't that be &amp;quot;IHaveNeighbours&amp;lt;N&amp;gt;&amp;quot;? :)&lt;/p&gt;
</description></item><item><title>re: Path Finding Using A* in C# 3.0, Part Four</title><link>http://blogs.msdn.com/ericlippert/archive/2007/10/10/path-finding-using-a-in-c-3-0-part-four.aspx#5396151</link><pubDate>Thu, 11 Oct 2007 04:49:43 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:5396151</guid><dc:creator>Craig Mathews</dc:creator><description>&lt;p&gt;&amp;gt; Next time: at long last, Eric talks about variance in C#.&lt;/p&gt;
&lt;p&gt;I'm really looking forward to it!&lt;/p&gt;
&lt;p&gt;Lack of generic variance support has been and continues to be my major gripe with C#.&lt;/p&gt;
</description></item><item><title>re: Path Finding Using A* in C# 3.0, Part Four</title><link>http://blogs.msdn.com/ericlippert/archive/2007/10/10/path-finding-using-a-in-c-3-0-part-four.aspx#5401346</link><pubDate>Thu, 11 Oct 2007 16:26:39 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:5401346</guid><dc:creator>Michal Talaga</dc:creator><description>&lt;p&gt;I felt like I was in school again :-)&lt;/p&gt;
</description></item><item><title>Community Convergence XXXIII</title><link>http://blogs.msdn.com/ericlippert/archive/2007/10/10/path-finding-using-a-in-c-3-0-part-four.aspx#5456096</link><pubDate>Mon, 15 Oct 2007 04:25:35 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:5456096</guid><dc:creator>Charlie Calvert's Community Blog</dc:creator><description>&lt;p&gt;Welcome to the thirty-third edition of Community Convergence. This week we have a new video called Programming&lt;/p&gt;
</description></item><item><title>re: Path Finding Using A* in C# 3.0, Part Four</title><link>http://blogs.msdn.com/ericlippert/archive/2007/10/10/path-finding-using-a-in-c-3-0-part-four.aspx#6536054</link><pubDate>Tue, 27 Nov 2007 01:24:22 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:6536054</guid><dc:creator>Nate Pink</dc:creator><description>&lt;p&gt;I realize that VS2008 was JUST released, but I was wondering if, when you had a moment, we could see the solution and demo? &amp;nbsp;I really enjoyed reading this. &amp;nbsp;Thanks!&lt;/p&gt;
</description></item><item><title>MicroQuest – AStar Pathfinding</title><link>http://blogs.msdn.com/ericlippert/archive/2007/10/10/path-finding-using-a-in-c-3-0-part-four.aspx#8652224</link><pubDate>Wed, 25 Jun 2008 17:22:37 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:8652224</guid><dc:creator>Marc: My Words</dc:creator><description>&lt;p&gt;The first thing I want to be able to do in MicroQuest is move my &amp;amp;quot;unit&amp;amp;quot; around the &amp;amp;quot;game&lt;/p&gt;
</description></item><item><title>Algorithms in C#: shortest path around a polygon (polyline routing)</title><link>http://blogs.msdn.com/ericlippert/archive/2007/10/10/path-finding-using-a-in-c-3-0-part-four.aspx#9709157</link><pubDate>Mon, 08 Jun 2009 22:04:13 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:9709157</guid><dc:creator>Kirill Osenkov</dc:creator><description>&lt;p&gt;Suppose you have to build a road to connect two cities on different sides of a lake. How would you plan&lt;/p&gt;
</description></item><item><title>re: Path Finding Using A* in C# 3.0, Part Four</title><link>http://blogs.msdn.com/ericlippert/archive/2007/10/10/path-finding-using-a-in-c-3-0-part-four.aspx#9794028</link><pubDate>Sun, 21 Jun 2009 02:09:03 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:9794028</guid><dc:creator>leniel</dc:creator><description>&lt;p&gt;Hi Eric,&lt;/p&gt;
&lt;p&gt;Standing on the shoulders of giants just like you, this is my try to put a running sample of the code you presented in this magnific series.&lt;/p&gt;
&lt;p&gt;&lt;a rel="nofollow" target="_new" href="http://www.leniel.net/2009/06/astar-pathfinding-search-in-csharp.html"&gt;http://www.leniel.net/2009/06/astar-pathfinding-search-in-csharp.html&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Thanks,&lt;/p&gt;
&lt;p&gt;Leniel Macaferi&lt;/p&gt;
&lt;p&gt;&lt;a rel="nofollow" target="_new" href="http://leniel.net"&gt;http://leniel.net&lt;/a&gt;&lt;/p&gt;
</description></item><item><title>re: Path Finding Using A* in C# 3.0, Part Four</title><link>http://blogs.msdn.com/ericlippert/archive/2007/10/10/path-finding-using-a-in-c-3-0-part-four.aspx#9936479</link><pubDate>Mon, 14 Dec 2009 13:03:07 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:9936479</guid><dc:creator>Jakob Lund Krarup</dc:creator><description>&lt;p&gt;Implemented your code in our XNA game &amp;quot;Climate Conflict&amp;quot;.&lt;/p&gt;
&lt;p&gt;&lt;a rel="nofollow" target="_new" href="http://klimakonflikt.codeplex.com/"&gt;http://klimakonflikt.codeplex.com/&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;It's elegant, it's fast and it was a cinch to implement! :)&lt;/p&gt;
&lt;p&gt;Thanx!&lt;/p&gt;
&lt;p&gt;- Jakob&lt;/p&gt;
</description></item></channel></rss>