<?xml version="1.0" encoding="ISO-8859-1"?>

<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/">
	<channel>
		<title>C Board - General AI Programming</title>
		<link>http://cboard.cprogramming.com</link>
		<description>General questions about Artificial Intelligence</description>
		<language>en</language>
		<lastBuildDate>Sat, 21 Nov 2009 03:22:35 GMT</lastBuildDate>
		<generator>vBulletin</generator>
		<ttl>60</ttl>
		<image>
			<url>http://cboard.cprogramming.com/images/misc/rss.jpg</url>
			<title>C Board - General AI Programming</title>
			<link>http://cboard.cprogramming.com</link>
		</image>
		<item>
			<title>Infinite game of life</title>
			<link>http://cboard.cprogramming.com/general-ai-programming/121528-infinite-game-life.html</link>
			<pubDate>Thu, 12 Nov 2009 07:33:50 GMT</pubDate>
			<description>I am wondering about the Conway game of life here, if it is in theory played out on an infinite plane how can it be truly modelled, i can see that it is a simple program to write but surely if you reach the edges of your model then the states of some cells cannot be tested correctly according to...</description>
			<content:encoded><![CDATA[<div>I am wondering about the Conway game of life here, if it is in theory played out on an infinite plane how can it be truly modelled, i can see that it is a simple program to write but surely if you reach the edges of your model then the states of some cells cannot be tested correctly according to the rules, i mean because they are not surrounded by the full complement of neighbour cells, so their state will change in a way they might not have otherwise and then these changes are going to filter back down into the rest of the model. <br />
<br />
having not written a version i can only assume that the patterns often assume steady state or that you could assume that model grows indefinitely if rapid expansion continues after a defined number of iterations.<br />
<br />
But then, in the case of Mandlebrot set if you allow for more and more iterations, more and more fine detail emerges.</div>

]]></content:encoded>
			<category domain="http://cboard.cprogramming.com/general-ai-programming/">General AI Programming</category>
			<dc:creator>rogster001</dc:creator>
			<guid isPermaLink="true">http://cboard.cprogramming.com/general-ai-programming/121528-infinite-game-life.html</guid>
		</item>
		<item>
			<title>The Euclidean algorithm</title>
			<link>http://cboard.cprogramming.com/general-ai-programming/121003-euclidean-algorithm.html</link>
			<pubDate>Mon, 26 Oct 2009 19:53:13 GMT</pubDate>
			<description><![CDATA[hey guys ... 
i am a new member and i want some help in a pseudo-code 
i was asked to  write a pseudo-code for the Euclidean algorithm 
this was the question  
" The euclidean algorithm determines the greatest common divisor (GCD) of two positive numbers by repatedly replacing the larger number...]]></description>
			<content:encoded><![CDATA[<div>hey guys ...<br />
i am a new member and i want some help in a pseudo-code<br />
i was asked to  write a pseudo-code for the Euclidean algorithm<br />
this was the question <br />
&quot; The euclidean algorithm determines the greatest common divisor (GCD) of two positive numbers by repatedly replacing the larger number with the result of subtracting the smaller one from it until the two numbers are equal&quot;<br />
<br />
And this is my Answer<div style="margin:20px; margin-top:5px">
	<div class="smallfont" style="margin-bottom:2px">Code:</div>
	<hr /><code style="margin:0px" dir="ltr" style="text-align:left">Get x,y //x,y any numbers<br />
set gcd to 0 //gcd = Great Common divisor<br />
if (x&gt;0) and (y&gt;0)<br />
&nbsp;  then if (x-y) &gt; 0<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  then while (x&gt;y)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; { set gcd to ( gcd + (x-y) )<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  set x to x-y<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  print &quot; the GCD&quot; + gcd<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if (y-x) &gt; 0<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; then while (y&gt;x)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  { set gcd to ( gcd + (y-x) )<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  set y to (y-x)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; print &quot;the GCD &quot;+ gcd<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else print &quot; the numbers are equal&quot;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; end if <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  end if<br />
&nbsp;  else print &quot; There is a negative number at least &quot;<br />
end if</code><hr />
</div>Is this Code correct??<br />
 and is it not could any one tell me why it is not correct and what is the correct code ?? <br />
i'm waiting guys</div>

]]></content:encoded>
			<category domain="http://cboard.cprogramming.com/general-ai-programming/">General AI Programming</category>
			<dc:creator>the_storm</dc:creator>
			<guid isPermaLink="true">http://cboard.cprogramming.com/general-ai-programming/121003-euclidean-algorithm.html</guid>
		</item>
		<item>
			<title>Evolution examples</title>
			<link>http://cboard.cprogramming.com/general-ai-programming/120938-evolution-examples.html</link>
			<pubDate>Sat, 24 Oct 2009 15:47:50 GMT</pubDate>
			<description>Anybody point me in direction of evolution program ideas, i am thinking stuff like the blind watchmaker or any classic algorithm for life simulations, evolve your bot as this condition or that condition changes etc</description>
			<content:encoded><![CDATA[<div>Anybody point me in direction of evolution program ideas, i am thinking stuff like the blind watchmaker or any classic algorithm for life simulations, evolve your bot as this condition or that condition changes etc</div>

]]></content:encoded>
			<category domain="http://cboard.cprogramming.com/general-ai-programming/">General AI Programming</category>
			<dc:creator>rogster001</dc:creator>
			<guid isPermaLink="true">http://cboard.cprogramming.com/general-ai-programming/120938-evolution-examples.html</guid>
		</item>
	</channel>
</rss>
