Browse by Tags

• Rarefied Heights

• Path Finding Using A* in C# 3.0, Part Four

  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 Read More... Posted Wednesday, October 10, 2007 7:17 AM by Eric Lippert | 8 Comments Filed under: Rarefied Heights, C#, AStar

• Path Finding Using A* in C# 3.0, Part Three

  In order to make the A* algorithm work we need to get the lowest-estimated-cost-path-discovered-so-far out of the list of paths under consideration. The standard data structure for doing so is called a “priority queue”. Priority queues are so-called because Read More... Posted Monday, October 08, 2007 7:03 AM by Eric Lippert | 12 Comments Filed under: Rarefied Heights, C#, AStar

• Path Finding Using A* in C# 3.0, Part Two

  In order to implement the A* algorithm in C# 3.0 I am going to need to implement some custom data structures. Today we’ll consider how to implement the “path”. You’ll notice in my description of the algorithm that the only operations we perform on paths Read More... Posted Thursday, October 04, 2007 7:33 AM by Eric Lippert | 25 Comments Filed under: Rarefied Heights, C#, AStar

• Path Finding Using A* in C# 3.0, Part One

  As 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 played Read More... Posted Tuesday, October 02, 2007 4:31 PM by Eric Lippert | 8 Comments Filed under: Rarefied Heights, C#, AStar