<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	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/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Quixotic &#187; Game Design</title>
	<atom:link href="http://vasir.net/blog/category/gamedesgin/feed/" rel="self" type="application/rss+xml" />
	<link>http://vasir.net/blog</link>
	<description>Erik Hazzard&#039;s various thoughts and ramblings</description>
	<lastBuildDate>Tue, 13 Apr 2010 19:57:47 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.1</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>Javascript Browser Based Tower Defense Game: Elemental TD</title>
		<link>http://vasir.net/blog/gamedesgin/javascript-browser-based-tower-defense-game/</link>
		<comments>http://vasir.net/blog/gamedesgin/javascript-browser-based-tower-defense-game/#comments</comments>
		<pubDate>Mon, 22 Mar 2010 16:00:14 +0000</pubDate>
		<dc:creator>Erik Hazzard</dc:creator>
				<category><![CDATA[Game Design]]></category>
		<category><![CDATA[EoA]]></category>
		<category><![CDATA[tower defense]]></category>

		<guid isPermaLink="false">http://vasir.net/blog/?p=246</guid>
		<description><![CDATA[My latest project is an Browser Based Tower Defense (Elemental TD) game written in Javascript using the MooTools framework on the client end.  The thing that sort of sets it apart from other browser games is that it is a true browser based tower defense: it does not use flash; it&#8217;s all javascript / [...]]]></description>
		<wfw:commentRss>http://vasir.net/blog/gamedesgin/javascript-browser-based-tower-defense-game/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
		<item>
		<title>Dijkstra&#8217;s Algorithm &#8211; Shortest Path</title>
		<link>http://vasir.net/blog/gamedesgin/dijkstras_algorithm_shortest_path/</link>
		<comments>http://vasir.net/blog/gamedesgin/dijkstras_algorithm_shortest_path/#comments</comments>
		<pubDate>Sun, 17 Jan 2010 05:34:59 +0000</pubDate>
		<dc:creator>Erik Hazzard</dc:creator>
				<category><![CDATA[Game Design]]></category>
		<category><![CDATA[Dijkstra]]></category>
		<category><![CDATA[game dev]]></category>
		<category><![CDATA[path finding]]></category>
		<category><![CDATA[python]]></category>
		<category><![CDATA[shortest path]]></category>

		<guid isPermaLink="false">http://vasir.net/blog/?p=122</guid>
		<description><![CDATA[This post will cover the basics of Dijksta's shortest path algorithm and how it can apply to path finding for game development. It is my opinion that understanding this algorithm will aid in understanding more complex AI algorithms, such as A*. This post is aimed more towards developers starting out in game development or those curious about Dijkstra's algorithm, but this will be a somewhat simplification of it and discuss mainly the concepts. ]]></description>
		<wfw:commentRss>http://vasir.net/blog/gamedesgin/dijkstras_algorithm_shortest_path/feed/</wfw:commentRss>
		<slash:comments>5</slash:comments>
		</item>
	</channel>
</rss>
