Path Finding Using A* in C# 3.0, Part Onehttp://blogs.msdn.com/ericlippert/archive/2007/10/02/path-finding-using-a-in-c-3-0.aspxAs we get into the home stretch for the Orcas release I’ve been spending a little time lately just playing around implementing some “classic” algorithms and data structures in C#. The one I implemented today is the famous A* algorithm. Surely you’ve playeden-USCommunityServer 2.1 SP1 (Build: 61025.2)Techy News Blog &raquo; Path Finding Using A* in C# 3.0, Part Onehttp://blogs.msdn.com/ericlippert/archive/2007/10/02/path-finding-using-a-in-c-3-0.aspx#5250634Wed, 03 Oct 2007 03:57:07 GMT91d46819-8472-40ad-a661-2c78acb4018c:5250634Techy News Blog » Path Finding Using A* in C# 3.0, Part One<p>PingBack from <a rel="nofollow" target="_new" href="http://www.artofbam.com/wordpress/?p=4723">http://www.artofbam.com/wordpress/?p=4723</a></p> re: Path Finding Using A* in C# 3.0, Part Onehttp://blogs.msdn.com/ericlippert/archive/2007/10/02/path-finding-using-a-in-c-3-0.aspx#5250814Wed, 03 Oct 2007 04:13:56 GMT91d46819-8472-40ad-a661-2c78acb4018c:5250814Alan Oursland<p>Isn't that something like three lines and a couple of delegates in C#?</p> re: Path Finding Using A* in C# 3.0, Part Onehttp://blogs.msdn.com/ericlippert/archive/2007/10/02/path-finding-using-a-in-c-3-0.aspx#5251004Wed, 03 Oct 2007 04:30:30 GMT91d46819-8472-40ad-a661-2c78acb4018c:5251004Eric Lippert<p>One certainly hopes so!</p> <p>When we get through with this, the implementation of the mainline algorithm will be barely longer than the pseudocode. &nbsp;Of course, the supplementary data structures that we'll need to implement first will be a little longer.</p> re: Path Finding Using A* in C# 3.0, Part Onehttp://blogs.msdn.com/ericlippert/archive/2007/10/02/path-finding-using-a-in-c-3-0.aspx#5252352Wed, 03 Oct 2007 06:30:19 GMT91d46819-8472-40ad-a661-2c78acb4018c:5252352Tom Kirby-Green<p>Awesome, I've just started reading about A* in Volume 1 of 'A.I. Game Programming Wisdom' :)</p> re: Path Finding Using A* in C# 3.0, Part Onehttp://blogs.msdn.com/ericlippert/archive/2007/10/02/path-finding-using-a-in-c-3-0.aspx#5265016Wed, 03 Oct 2007 20:08:51 GMT91d46819-8472-40ad-a661-2c78acb4018c:5265016Eamon Nerbonne<p>That's a nice project, reimplementing classic algorithms in C# 3.0! &nbsp;I wish there were some easy way of sharing those kind of things, since often such algorithms are extremely handy to have available, but there's nevertheless often no easy way of combining them without reimplementing large sections (just to remove type issues and to address data structure incompatibilities). &nbsp;And of course, there's no infrastructure like CPAN for C#, even if basic issues regarding the portability of such basic algorithms were possible.</p> re: Path Finding Using A* in C# 3.0, Part Onehttp://blogs.msdn.com/ericlippert/archive/2007/10/02/path-finding-using-a-in-c-3-0.aspx#5304134Sat, 06 Oct 2007 04:27:02 GMT91d46819-8472-40ad-a661-2c78acb4018c:5304134Néstor Sánchez<p>Very good!, so... </p> <p>(question for the BCL product managers)</p> <p>why these kind of standard/famous/useful algorithms are not already in the .NET Framework libraries?</p> Community Convergence XXXIIIhttp://blogs.msdn.com/ericlippert/archive/2007/10/02/path-finding-using-a-in-c-3-0.aspx#5455828Mon, 15 Oct 2007 03:54:57 GMT91d46819-8472-40ad-a661-2c78acb4018c:5455828Charlie Calvert's Community Blog<p>Welcome to the thirty-third edition of Community Convergence. This week we have a new video called Programming</p> MicroQuest – AStar Pathfindinghttp://blogs.msdn.com/ericlippert/archive/2007/10/02/path-finding-using-a-in-c-3-0.aspx#8652221Wed, 25 Jun 2008 17:22:25 GMT91d46819-8472-40ad-a661-2c78acb4018c:8652221Marc: My Words<p>The first thing I want to be able to do in MicroQuest is move my &amp;quot;unit&amp;quot; around the &amp;quot;game</p>