<?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: 3D Pathfinding in AS3</title>
	<atom:link href="http://www.metah.ch/blog/2007/07/3d-pathfinding-in-as3/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.metah.ch/blog/2007/07/3d-pathfinding-in-as3/</link>
	<description>Ahmet Gyger&#039;s web log.</description>
	<lastBuildDate>Fri, 11 Nov 2011 23:05:59 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.2.1</generator>
	<item>
		<title>By: Home</title>
		<link>http://www.metah.ch/blog/2007/07/3d-pathfinding-in-as3/comment-page-1/#comment-3258</link>
		<dc:creator>Home</dc:creator>
		<pubDate>Tue, 17 Jul 2007 15:18:29 +0000</pubDate>
		<guid isPermaLink="false">http://www.metah.ch/blog/2007/07/05/3d-pathfinding-in-as3/#comment-3258</guid>
		<description>&lt;!--%kramer-ref-pre%--&gt;[...] 3D Pathfinding in AS3    [via: Beedigital, draw.logic] Source code to download of pathfinding with AS3 in 3D! The actionscript architect Paul Spitzer has posted two killer [...]&lt;!--%kramer-ref-post%--&gt;</description>
		<content:encoded><![CDATA[<p><!--%kramer-ref-pre%-->[...] 3D Pathfinding in AS3    [via: Beedigital, draw.logic] Source code to download of pathfinding with AS3 in 3D! The actionscript architect Paul Spitzer has posted two killer [...]<!--%kramer-ref-post%--></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Paul</title>
		<link>http://www.metah.ch/blog/2007/07/3d-pathfinding-in-as3/comment-page-1/#comment-3257</link>
		<dc:creator>Paul</dc:creator>
		<pubDate>Thu, 05 Jul 2007 18:56:06 +0000</pubDate>
		<guid isPermaLink="false">http://www.metah.ch/blog/2007/07/05/3d-pathfinding-in-as3/#comment-3257</guid>
		<description>Hi Ahmet, my implementation of the algorithm doesn&#039;t always find the shortest path. I&#039;m not sure if that is just the nature of the algorithm itself or something that I have overlooked. And yes, empty blocks are treated as walkable areas and the entire 5x5x5 grid is searched. That&#039;s why the path often takes a route through the empty nodes.</description>
		<content:encoded><![CDATA[<p>Hi Ahmet, my implementation of the algorithm doesn&#8217;t always find the shortest path. I&#8217;m not sure if that is just the nature of the algorithm itself or something that I have overlooked. And yes, empty blocks are treated as walkable areas and the entire 5x5x5 grid is searched. That&#8217;s why the path often takes a route through the empty nodes.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

