<?xml version="1.0" encoding="UTF-8" ?>
<rss version="2.0" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:wikidot="http://www.wikidot.com/rss-namespace">

	<channel>
		<title>Optimize a Conway&#039;s Game of Life Program</title>
		<link>http://tibasicdev.wikidot.com/forum/t-13375088/optimize-a-conway-s-game-of-life-program</link>
		<description>Posts in the discussion thread &quot;Optimize a Conway&#039;s Game of Life Program&quot; - Yes, I know this website has an official version of Conway&#039;s Game of Life, but I want to use my own.</description>
				<copyright></copyright>
		<lastBuildDate>Sat, 14 Mar 2026 19:44:18 +0000</lastBuildDate>
		
					<item>
				<guid>http://tibasicdev.wikidot.com/forum/t-13375088#post-4809031</guid>
				<title>Re: Optimize a Conway&#039;s Game of Life Program</title>
				<link>http://tibasicdev.wikidot.com/forum/t-13375088/optimize-a-conway-s-game-of-life-program#post-4809031</link>
				<description></description>
				<pubDate>Sun, 01 Nov 2020 13:37:12 +0000</pubDate>
								<wikidot:authorUserId>6979576</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <div class="collapsible-block"> <div class="collapsible-block-folded"><a class="collapsible-block-link" href="javascript:;">+&nbsp;Show&nbsp;Individual&nbsp;Optimizations</a></div> <div class="collapsible-block-unfolded" style="display:none"> <div class="collapsible-block-unfolded-link"><a class="collapsible-block-link" href="javascript:;">-&nbsp;Hide&nbsp;Individual&nbsp;Optimizations</a></div> <div class="collapsible-block-content"> <p>replace</p> <div class="code"> <pre><code>{11,28}→dim([A]) For(A,2,10) For (B,2,27) max(0,randInt(⁻3,1))→[A](A,B) Output(A,B-1),&quot;O&quot;)</code></pre></div> <br /> with <div class="code"> <pre><code>{11,28}→dim([A] For(A,2,10 For (B,2,27 max(0,randInt(⁻3,1→[A](A,B Output(A,B-1),&quot;O</code></pre></div> <p>replace</p> <div class="code"> <pre><code>Output(1,1,&quot;GENERATION&quot;) Output(1,16,&quot;MEMBERS=&quot;)</code></pre></div> <br /> with <div class="code"> <pre><code>Output(1,1,&quot;GENERATION Output(1,16,&quot;MEMBERS=</code></pre></div> <p>replace</p> <div class="code"> <pre><code>For(A,2,10) For(B,1,26) Output(A,B,sub(&quot; O&quot;,[A](A,B+1)+1,1))</code></pre></div> <br /> with <div class="code"> <pre><code>For(A,2,10 For(B,1,26 Output(A,B,sub(&quot; O&quot;,[A](A,B+1)+1,1</code></pre></div> </div> </div> </div> <br /> in short, replace <div class="code"> <pre><code>ClrHome {11,28}→dim([A]) For(A,2,10) For (B,2,27) max(0,randInt(⁻3,1))→[A](A,B) Output(A,B-1),&quot;O&quot;) End:End 0→G Output(1,1,&quot;GENERATION&quot;) Output(1,16,&quot;MEMBERS=&quot;) Repeat getKey or M=0 G+1→G For(A,2,10) For(B,1,26) Output(A,B,sub(&quot; O&quot;,[A](A,B+1)+1,1)) End:End Output(1,12,G) Output(1,24,&quot; &quot;) //four spaces [A]→[B] 0→M For(A,2,10) For(B,2,27) Output(A,B-1,&quot;θ&quot;) If [A](A,B)=1:M+1→M Output(1,24,M) 0→N For(C,-1,1) For(D,-1,1) If [A](A+C,B+D) and 2≠sum(not({C,D}≠0)):N+1→N End:End If N=3 and [A](A,B)=0 1→[B](A,B) If [A](A,B)=1 and N≠2 and N≠3 0→[B](A,B) Output(A,B-1,sub(&quot; O&quot;,[A](A,B)+1,1)) End:End [B]→[A] End</code></pre></div> <p>with</p> <div class="code"> <pre><code>ClrHome {11,28}→dim([A] For(A,2,10 For (B,2,27 max(0,randInt(⁻3,1→[A](A,B Output(A,B-1),&quot;O End:End 0→G Output(1,1,&quot;GENERATION Output(1,16,&quot;MEMBERS= Repeat getKey or M=0 G+1→G For(A,2,10 For(B,1,26 Output(A,B,sub(&quot; O&quot;,[A](A,B+1)+1,1 End:End Output(1,12,G Output(1,24,&quot; &quot; //four spaces [A]→[B] 0→M For(A,2,10 For(B,2,27 Output(A,B-1,&quot;θ If 1=[A](A,B:M+1→M Output(1,24,M 0→N For(C,-1,1 For(D,-1,1 If [A](A+C,B+D) and 2≠sum(not({C,D}≠0:N+1→N End:End If N=3 and 0=[A](A,B 1→[B](A,B) If N≠2 and N≠3 and 1=[A](A,B 0→[B](A,B Output(A,B-1,sub(&quot; O&quot;,[A](A,B)+1,1 End:End [B]→[A] End</code></pre></div> <p>still, good program nonetheless :)</p> <p>&#8212;Posts Merged by Moderator</p> 
				 	]]>
				</content:encoded>							</item>
					<item>
				<guid>http://tibasicdev.wikidot.com/forum/t-13375088#post-4663295</guid>
				<title>Optimize a Conway&#039;s Game of Life Program</title>
				<link>http://tibasicdev.wikidot.com/forum/t-13375088/optimize-a-conway-s-game-of-life-program#post-4663295</link>
				<description></description>
				<pubDate>Mon, 25 May 2020 23:39:01 +0000</pubDate>
				<wikidot:authorName>OneLetterShor</wikidot:authorName>				<wikidot:authorUserId>4737965</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <div class="code"> <pre><code>ClrHome {11,28}→dim([A]) For(A,2,10) For (B,2,27) max(0,randInt(⁻3,1))→[A](A,B) Output(A,B-1),&quot;O&quot;) End:End 0→G Output(1,1,&quot;GENERATION&quot;) Output(1,16,&quot;MEMBERS=&quot;) Repeat getKey or M=0 G+1→G For(A,2,10) For(B,1,26) Output(A,B,sub(&quot; O&quot;,[A](A,B+1)+1,1)) End:End Output(1,12,G) Output(1,24,&quot; &quot;) //four spaces [A]→[B] 0→M For(A,2,10) For(B,2,27) Output(A,B-1,&quot;θ&quot;) If [A](A,B)=1:M+1→M Output(1,24,M) 0→N For(C,-1,1) For(D,-1,1) If [A](A+C,B+D) and 2≠sum(not({C,D}≠0)):N+1→N End:End If N=3 and [A](A,B)=0 1→[B](A,B) If [A](A,B)=1 and N≠2 and N≠3 0→[B](A,B) Output(A,B-1,sub(&quot; O&quot;,[A](A,B)+1,1)) End:End [B]→[A] End</code></pre></div> 
				 	]]>
				</content:encoded>							</item>
				</channel>
</rss>