<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xml:base="http://codebase.dbp-site.com" xmlns:dc="http://purl.org/dc/elements/1.1/">
<channel>
 <title>A*</title>
 <link>http://codebase.dbp-site.com/tags/a</link>
 <description>The taxonomy view with a depth of 0.</description>
 <language>en</language>
<item>
 <title>A* Pathfinding</title>
 <link>http://codebase.dbp-site.com/code/pathfinding-5</link>
 <description>&lt;p&gt;&lt;strong&gt;Project Homepage:http://jt0.org/projects/astar&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;What&lt;/strong&gt;
This is an A* Pathfinding algorithm implimented in native DarkBASIC Professional code as a simple set of functions.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;How&lt;/strong&gt;
The basis of it include first initializing the &#039;Map&#039; and other needed variables (1 function call), then setting up all the allowable area&#039;s on the map itself (1 function called many times), then from there, it&#039;s simply a matter of calling the Pathing function, which will return a memory block containing all the path information requested.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Notes&lt;/strong&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;http://codebase.dbp-site.com/code/pathfinding-5&quot;&gt;read more&lt;/a&gt;&lt;/p&gt;</description>
 <comments>http://codebase.dbp-site.com/code/pathfinding-5#comments</comments>
 <category domain="http://codebase.dbp-site.com/tags/a">A*</category>
 <category domain="http://codebase.dbp-site.com/tags/pathfinding">Pathfinding</category>
 <pubDate>Tue, 05 Jun 2007 10:05:07 +0100</pubDate>
 <dc:creator>Jess T</dc:creator>
 <guid isPermaLink="false">5 at http://codebase.dbp-site.com</guid>
</item>
</channel>
</rss>
