<?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>oue&#039;s profile &#187; AI</title>
	<atom:link href="http://www.aspgod.com/tag/ai/feed" rel="self" type="application/rss+xml" />
	<link>http://www.aspgod.com</link>
	<description>AI algorithm graphics programming blog Firefox ff</description>
	<lastBuildDate>Fri, 20 Jan 2012 16:59:45 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.1.2</generator>
		<item>
		<title>Merge sort algorithm project</title>
		<link>http://www.aspgod.com/project/ai/merge-sort-algorithm-project.html</link>
		<comments>http://www.aspgod.com/project/ai/merge-sort-algorithm-project.html#comments</comments>
		<pubDate>Thu, 27 Aug 2009 18:12:36 +0000</pubDate>
		<dc:creator>aspgod</dc:creator>
				<category><![CDATA[AI]]></category>
		<category><![CDATA[algorithm]]></category>
		<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[bigo]]></category>
		<category><![CDATA[sort number]]></category>

		<guid isPermaLink="false">http://www.aspgod.com/myprofile/?p=308</guid>
		<description><![CDATA[The main idea of merge sort is separate big problem to many small problem. Then separate small problem to smallest one so the program will be solve many smallest one and group it to a bigger one. Solved and group again and again. Finally the answer will be appear. Merge sort is an O(n log [...]
No related posts.

Related posts brought to you by <a href='http://yarpp.org'>Yet Another Related Posts Plugin</a>.]]></description>
			<content:encoded><![CDATA[<p>The main idea of merge sort is separate big problem to many small problem. Then separate small problem to smallest one so the program will be solve many smallest one and group it to a bigger one. Solved and group again and again. Finally the answer will be appear.<br />
Merge sort is an O(n log n) with both best and worst case.</p>
<p><img src="http://www.aspgod.com/myprofile/wp-content/uploads/2009/08/28-8-2552-0-44-58.png" alt="Merge sort algorithm" /><br />
<span id="more-308"></span></p>
<p><strong>How to :</strong><br />
The input parameter is<br />
1. number (values for sorting)<br />
2. -1000 (to start merge sort)</p>
<p><img src="http://www.aspgod.com/myprofile/wp-content/uploads/2009/08/28-8-2552-0-32-35.png" alt="Merge sort program" /></p>
<p><strong>Tools &amp; Knowledge :</strong><br />
1. C++<br />
2. Merge sort<br />
3. Recursive</p>
<p><strong>Reqirement : </strong><br />
1. <a href="http://www.microsoft.com/downloads/details.aspx?FamilyID=0856EACB-4362-4B0D-8EDD-AAB15C5E04F5&amp;displaylang=en" target="_blank">Microsoft .Net Framework 2.0</a> (22.4 MB)<br />
2. windows</p>
<p><strong>Download :</strong><br />
1. <a href="http://www.aspgod.com/myprofile/wp-content/uploads/2009/08/MergeSort_EXE.rar">Merge Sort EXE</a><br />
2. <a href="http://www.aspgod.com/myprofile/wp-content/uploads/2009/08/MergeSort_CODE.rar">Merge Sort Source Code</a></p>
<p>No related posts.</p>
<p>Related posts brought to you by <a href='http://yarpp.org'>Yet Another Related Posts Plugin</a>.</p>]]></content:encoded>
			<wfw:commentRss>http://www.aspgod.com/project/ai/merge-sort-algorithm-project.html/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Kruskal&#8217;s Algorithm</title>
		<link>http://www.aspgod.com/project/ai/kruskals-algorithm.html</link>
		<comments>http://www.aspgod.com/project/ai/kruskals-algorithm.html#comments</comments>
		<pubDate>Sat, 25 Apr 2009 10:08:24 +0000</pubDate>
		<dc:creator>aspgod</dc:creator>
				<category><![CDATA[AI]]></category>
		<category><![CDATA[algorithm]]></category>
		<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[data structure]]></category>
		<category><![CDATA[Kruskal]]></category>

		<guid isPermaLink="false">http://www.aspgod.com/myprofile/?p=67</guid>
		<description><![CDATA[This project show how to resolve the Kruskal&#8217;s Algorithm with the shortest path program How to : The input parameter is 1. Just press the enter button to see the result. This program is using this path to compute. Tools &#38; Knowledge : 1. C++ 2. Kruskal&#8217;s Algorithm 3. Stack (data structure) Reqirement : 1. [...]
No related posts.

Related posts brought to you by <a href='http://yarpp.org'>Yet Another Related Posts Plugin</a>.]]></description>
			<content:encoded><![CDATA[<p>This project show how to resolve the Kruskal&#8217;s Algorithm with the shortest path program</p>
<p><img src="http://www.aspgod.com/file/images/kruskal1.png" alt="Kruskal's Algorithm Program" /><span id="more-67"></span></p>
<p><strong>How to :</strong><br />
The input parameter is<br />
1. Just press the enter button to see the result.</p>
<p><img src="http://www.aspgod.com/file/images/kruskal2.png" alt="Kruskal's Algorithm Path" /><br />
This program is using this path to compute.</p>
<p><strong>Tools &amp; Knowledge :</strong><br />
1. C++<br />
2. Kruskal&#8217;s Algorithm<br />
3. Stack (data structure)</p>
<p><strong>Reqirement : </strong><br />
1. <a href="http://www.microsoft.com/downloads/details.aspx?FamilyID=0856EACB-4362-4B0D-8EDD-AAB15C5E04F5&amp;displaylang=en" target="_blank">Microsoft .Net Framework 2.0</a> (22.4 MB)<br />
2. windows</p>
<p><strong>Download :</strong><br />
1. <a href="http://www.aspgod.com/file/kruskal.rar">Kruskal&#8217;s Algorithm</a></p>
<p>No related posts.</p>
<p>Related posts brought to you by <a href='http://yarpp.org'>Yet Another Related Posts Plugin</a>.</p>]]></content:encoded>
			<wfw:commentRss>http://www.aspgod.com/project/ai/kruskals-algorithm.html/feed</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Knapsack Problem</title>
		<link>http://www.aspgod.com/project/ai/knapsack-problem.html</link>
		<comments>http://www.aspgod.com/project/ai/knapsack-problem.html#comments</comments>
		<pubDate>Sat, 25 Apr 2009 08:37:17 +0000</pubDate>
		<dc:creator>aspgod</dc:creator>
				<category><![CDATA[AI]]></category>
		<category><![CDATA[algorithm]]></category>
		<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[Knapsack]]></category>

		<guid isPermaLink="false">http://www.aspgod.com/myprofile/?p=55</guid>
		<description><![CDATA[This project is a Knapsack Problem represent by the classic program. How much the max value that the bag can contain with the max weight. How to : The input parameter is 1. max weight of the bag 2. max item 3. value 4. weight PS : you can enter the both parameter to together [...]
No related posts.

Related posts brought to you by <a href='http://yarpp.org'>Yet Another Related Posts Plugin</a>.]]></description>
			<content:encoded><![CDATA[<p>This project is a Knapsack Problem represent by the classic program. How much the max value that the bag can contain with the max weight.</p>
<p><img src="http://www.aspgod.com/file/images/knapsack.png" alt="Knapsack Problem" /><span id="more-55"></span></p>
<p><strong>How to :</strong><br />
The input parameter is<br />
1. max weight of the bag<br />
2. max item<br />
3. value<br />
4. weight<br />
PS : you can enter the both parameter to together (20 15 -&gt; value 20: weight 15)<br />
Enter all value then the program return the result of max value.</p>
<p><strong>Tools &amp; Knowledge :</strong><br />
1. C++<br />
2. Knapsack Problem</p>
<p><strong>Reqirement : </strong><br />
1. <a href="http://www.microsoft.com/downloads/details.aspx?FamilyID=0856EACB-4362-4B0D-8EDD-AAB15C5E04F5&amp;displaylang=en" target="_blank">Microsoft .Net Framework 2.0</a> (22.4 MB)<br />
2. windows</p>
<p><strong>Download :</strong><br />
1. <a href="http://www.aspgod.com/file/knapsack.rar">Knapsack Problem</a></p>
<p>No related posts.</p>
<p>Related posts brought to you by <a href='http://yarpp.org'>Yet Another Related Posts Plugin</a>.</p>]]></content:encoded>
			<wfw:commentRss>http://www.aspgod.com/project/ai/knapsack-problem.html/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Find Way Out</title>
		<link>http://www.aspgod.com/project/ai/find-way-out.html</link>
		<comments>http://www.aspgod.com/project/ai/find-way-out.html#comments</comments>
		<pubDate>Sat, 25 Apr 2009 07:57:01 +0000</pubDate>
		<dc:creator>aspgod</dc:creator>
				<category><![CDATA[AI]]></category>
		<category><![CDATA[algorithm]]></category>
		<category><![CDATA[Artificial Intelligence]]></category>

		<guid isPermaLink="false">http://www.aspgod.com/myprofile/?p=48</guid>
		<description><![CDATA[This project show how to find the way out of the map. Like a rat running on the hold to find the way out How to : The input parameter is 1. Just press Enter to show the output Rule 1. 0 -&#62; you can walk on this way. 2. 1 -&#62; It&#8217;s a wall. [...]
No related posts.

Related posts brought to you by <a href='http://yarpp.org'>Yet Another Related Posts Plugin</a>.]]></description>
			<content:encoded><![CDATA[<p>This project show how to find the way out of the map. Like a rat running on the hold to find the way out</p>
<p><img src="http://www.aspgod.com/file/images/findwayout1.png" alt="Find Way Out Program" /> <span id="more-48"></span></p>
<p><strong>How to :</strong><br />
The input parameter is<br />
1. Just press Enter to show the output</p>
<p>Rule<br />
1. 0 -&gt; you can walk on this way.<br />
2. 1 -&gt; It&#8217;s a wall. You cann&#8217;t walk on this way.<br />
3. 2 -&gt; You used to walk on this way but it&#8217;s not a way out.<br />
4. 3 -&gt; You used to walk on this way. It&#8217;s a way out.<br />
5. 4 -&gt; You used to walk on this way. It&#8217;s a way to several path.</p>
<p>Set up path<br />
1. you must have 2 zero(0) on the edge. the left top zero(0) is the starting point.<br />
<img src="http://www.aspgod.com/file/images/findwayout2.png" alt="Find Way Out Set Up" /><br />
set up program</p>
<p><strong>Tools &amp; Knowledge :</strong><br />
1. C++</p>
<p><strong>Reqirement : </strong><br />
1. <a href="http://www.microsoft.com/downloads/details.aspx?FamilyID=0856EACB-4362-4B0D-8EDD-AAB15C5E04F5&amp;displaylang=en" target="_blank">Microsoft .Net Framework 2.0</a> (22.4 MB)<br />
2. windows</p>
<p><strong>Download :</strong><br />
1. <a href="http://www.aspgod.com/file/findwayout.rar">Find Way Out Program</a></p>
<p>No related posts.</p>
<p>Related posts brought to you by <a href='http://yarpp.org'>Yet Another Related Posts Plugin</a>.</p>]]></content:encoded>
			<wfw:commentRss>http://www.aspgod.com/project/ai/find-way-out.html/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>8 Puzzle</title>
		<link>http://www.aspgod.com/project/ai/8-puzzle.html</link>
		<comments>http://www.aspgod.com/project/ai/8-puzzle.html#comments</comments>
		<pubDate>Fri, 24 Apr 2009 20:16:43 +0000</pubDate>
		<dc:creator>aspgod</dc:creator>
				<category><![CDATA[AI]]></category>
		<category><![CDATA[8 Puzzle]]></category>
		<category><![CDATA[A*]]></category>
		<category><![CDATA[algorithm]]></category>
		<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[eight puzzle]]></category>

		<guid isPermaLink="false">http://www.aspgod.com/myprofile/?p=36</guid>
		<description><![CDATA[The A* Algorithm represent by 8 Puzzle. Modify the simple A* from Different Distance = RouteCount + distToGoal to Different Distance = RouteCount + distToGoal – distToInitial RouteCount = Cost to current state distToGoal = Estimated cost between possible state with coordinates (x1, y1) and goal state at (x2, y2) &#124;x1 &#8211; x2&#124; + &#124;y1 [...]
No related posts.

Related posts brought to you by <a href='http://yarpp.org'>Yet Another Related Posts Plugin</a>.]]></description>
			<content:encoded><![CDATA[<p>The A* Algorithm represent by 8 Puzzle.</p>
<p>Modify the simple A* from<br />
Different Distance = RouteCount + distToGoal<br />
to<br />
Different Distance = RouteCount + distToGoal – distToInitial</p>
<p>RouteCount = Cost to current state<br />
distToGoal   = Estimated cost between possible state with<br />
coordinates (x1, y1) and goal state at (x2, y2)<br />
|x1 &#8211; x2| + |y1 &#8211; y2|</p>
<p>distToInitial = Estimated cost between possible state with<br />
coordinates (x1, y1) and initial state at (x2, y2)<br />
|x1 &#8211; x2| + |y1 &#8211; y2|</p>
<p><img src="http://www.aspgod.com/file/images/8puzzle1.png" alt="8 Puzzle Program" /><span id="more-36"></span></p>
<p><img src="http://www.aspgod.com/file/images/8puzzle3.png" alt="8 Puzzle Algorithm" /></p>
<p><strong>How to :</strong><br />
<img src="http://www.aspgod.com/file/images/8puzzle2.png" alt="8 Puzzle Input" /><br />
Let&#8217;s play !!</p>
<p><strong>Tools &amp; Knowledge :</strong><br />
1. C#<br />
2. A* Algorithm</p>
<p><strong>Reqirement : </strong><br />
1. <a href="http://www.microsoft.com/downloads/details.aspx?FamilyID=0856EACB-4362-4B0D-8EDD-AAB15C5E04F5&amp;displaylang=en" target="_blank">Microsoft .Net Framework 2.0</a> (22.4 MB)<br />
2. windows</p>
<p><strong>Download :</strong><br />
1. <a href="http://www.aspgod.com/file/8puzzle.rar">8 Puzzle Program</a><br />
2. <a href="http://www.aspgod.com/file/docs/8puzzle.ppt">8 Puzzle Document</a><br />
3. <a href='http://www.aspgod.com/wp-content/uploads/2009/04/EightPuzzle.zip'>8 Puzzle Source Code</a></p>
<p>No related posts.</p>
<p>Related posts brought to you by <a href='http://yarpp.org'>Yet Another Related Posts Plugin</a>.</p>]]></content:encoded>
			<wfw:commentRss>http://www.aspgod.com/project/ai/8-puzzle.html/feed</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Double Linked List</title>
		<link>http://www.aspgod.com/project/ai/double-linked-list.html</link>
		<comments>http://www.aspgod.com/project/ai/double-linked-list.html#comments</comments>
		<pubDate>Fri, 24 Apr 2009 19:47:38 +0000</pubDate>
		<dc:creator>aspgod</dc:creator>
				<category><![CDATA[AI]]></category>
		<category><![CDATA[algorithm]]></category>
		<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[C++]]></category>
		<category><![CDATA[data structure]]></category>

		<guid isPermaLink="false">http://www.aspgod.com/myprofile/?p=33</guid>
		<description><![CDATA[This project show how to keep the object with double linked list How to : The input parameter is 1. add &#8211; add text to linked list 2. remove &#8211; remove text from linked list 3. print &#8211; display result of linked list. the answer will sort by age Enter the command to operate with [...]
No related posts.

Related posts brought to you by <a href='http://yarpp.org'>Yet Another Related Posts Plugin</a>.]]></description>
			<content:encoded><![CDATA[<p>This project show how to keep the object with double linked list</p>
<p><img src="http://www.aspgod.com/file/images/doublellprog.png" alt="Double Linked List Example" /><span id="more-33"></span></p>
<p><strong>How to :</strong><br />
The input parameter is<br />
1. add &#8211; add text to linked list<br />
2. remove &#8211; remove text from linked list<br />
3. print &#8211; display result of linked list. the answer will sort by age<br />
Enter the command to operate with linked list.</p>
<p><strong>Tools &amp; Knowledge :</strong><br />
1. C++<br />
2. data structure<br />
3. double linked list<br />
4. pointer</p>
<p><strong>Reqirement : </strong><br />
1. <a href="http://www.microsoft.com/downloads/details.aspx?FamilyID=0856EACB-4362-4B0D-8EDD-AAB15C5E04F5&amp;displaylang=en" target="_blank">Microsoft .Net Framework 2.0</a> (22.4 MB)<br />
2. windows</p>
<p><strong>Download :</strong><br />
1. <a href="http://www.aspgod.com/file/doublelinkedlist.rar">Double Linked List</a></p>
<p>No related posts.</p>
<p>Related posts brought to you by <a href='http://yarpp.org'>Yet Another Related Posts Plugin</a>.</p>]]></content:encoded>
			<wfw:commentRss>http://www.aspgod.com/project/ai/double-linked-list.html/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Dijkstra&#8217;s Algorithm</title>
		<link>http://www.aspgod.com/project/ai/dijkstra-algorithm.html</link>
		<comments>http://www.aspgod.com/project/ai/dijkstra-algorithm.html#comments</comments>
		<pubDate>Fri, 24 Apr 2009 19:10:22 +0000</pubDate>
		<dc:creator>aspgod</dc:creator>
				<category><![CDATA[AI]]></category>
		<category><![CDATA[algorithm]]></category>
		<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[dijkstra]]></category>

		<guid isPermaLink="false">http://www.aspgod.com/myprofile/?p=19</guid>
		<description><![CDATA[This project show the shortest path to the target. How to : The input parameter is 1. Uwajima 2. Matsuyama 3. Nakamura 4. Kochi 5. Kawanoe 6. Ikeda 7. Takamatsu 8. Tokushima 9. Muroto Enter the start and end to get the answer. Tools &#38; Knowledge : 1. C++ 2. dijkstra algorithm Reqirement : 1. [...]
No related posts.

Related posts brought to you by <a href='http://yarpp.org'>Yet Another Related Posts Plugin</a>.]]></description>
			<content:encoded><![CDATA[<p>This project show the shortest path to the target.</p>
<p><img src="http://www.aspgod.com/file/images/dijkstramap.png" alt="Dijkstra's Map" /><span id="more-19"></span></p>
<p><strong>How to :</strong><br />
The input parameter is<br />
1. Uwajima<br />
2. Matsuyama<br />
3. Nakamura<br />
4. Kochi<br />
5. Kawanoe<br />
6. Ikeda<br />
7. Takamatsu<br />
8. Tokushima<br />
9. Muroto<br />
Enter the start and end to get the answer.</p>
<p><strong>Tools &amp; Knowledge :</strong><br />
1. C++<br />
2. dijkstra algorithm</p>
<p><strong>Reqirement : </strong><br />
1. <a href="http://www.microsoft.com/downloads/details.aspx?FamilyID=0856EACB-4362-4B0D-8EDD-AAB15C5E04F5&amp;displaylang=en" target="_blank">Microsoft .Net Framework 2.0</a> (22.4 MB)<br />
2. windows</p>
<p><strong>Download :</strong><br />
1. <a href="http://www.aspgod.com/file/dijkstra.rar">Dijkstra&#8217;s algorithm (exe)</a><br />
2. <a href="http://www.aspgod.com/myprofile/wp-content/uploads/2009/09/Dijkstra.rar">Dijkstra&#8217;s algorithm (source code)</a></p>
<p>No related posts.</p>
<p>Related posts brought to you by <a href='http://yarpp.org'>Yet Another Related Posts Plugin</a>.</p>]]></content:encoded>
			<wfw:commentRss>http://www.aspgod.com/project/ai/dijkstra-algorithm.html/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Coin Changing</title>
		<link>http://www.aspgod.com/project/ai/coin-changing.html</link>
		<comments>http://www.aspgod.com/project/ai/coin-changing.html#comments</comments>
		<pubDate>Thu, 23 Apr 2009 16:59:49 +0000</pubDate>
		<dc:creator>aspgod</dc:creator>
				<category><![CDATA[AI]]></category>
		<category><![CDATA[algorithm]]></category>
		<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[Knapsack]]></category>

		<guid isPermaLink="false">http://www.aspgod.com/myprofile/?p=9</guid>
		<description><![CDATA[This project show how to resolve the knapsack problem with the coin changing program How to : The input parameter is 1. Money for exchange. Enter the money then return the least coin number for exchange. Tools &#38; Knowledge : 1. C++ 2. Knapsack Problem Reqirement : 1. Microsoft .Net Framework 2.0 (22.4 MB) 2. [...]
No related posts.

Related posts brought to you by <a href='http://yarpp.org'>Yet Another Related Posts Plugin</a>.]]></description>
			<content:encoded><![CDATA[<p>This project show how to resolve the knapsack problem with the coin changing program</p>
<p><img src="http://www.aspgod.com/file/images/coinchanging.png" alt="Coin Changing Knapsack Problem" /><span id="more-9"></span></p>
<p><strong>How to :</strong><br />
The input parameter is<br />
1. Money for exchange.<br />
Enter the money then return the least coin number for exchange.</p>
<p><strong>Tools &amp; Knowledge :</strong><br />
1. C++<br />
2. Knapsack Problem</p>
<p><strong>Reqirement : </strong><br />
1. <a href="http://www.microsoft.com/downloads/details.aspx?FamilyID=0856EACB-4362-4B0D-8EDD-AAB15C5E04F5&amp;displaylang=en" target="_blank">Microsoft .Net Framework 2.0</a> (22.4 MB)<br />
2. windows</p>
<p><strong>Download :</strong><br />
1. <a href="http://www.aspgod.com/file/coinchanging.rar">Coin Changing</a></p>
<p>No related posts.</p>
<p>Related posts brought to you by <a href='http://yarpp.org'>Yet Another Related Posts Plugin</a>.</p>]]></content:encoded>
			<wfw:commentRss>http://www.aspgod.com/project/ai/coin-changing.html/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

