<?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 Me (new posts)</title>
		<link>http://tibasicdev.wikidot.com/forum/c-29294/optimize-me</link>
		<description>Posts in the forum category &quot;Optimize Me&quot; - Test your optimization prowess</description>
				<copyright></copyright>
		<lastBuildDate>Fri, 13 Mar 2026 14:54:06 +0000</lastBuildDate>
		
					<item>
				<guid>http://tibasicdev.wikidot.com/forum/t-14389620#post-5159133</guid>
				<title>binary to decimal: Re: binary to decimal code optimization</title>
				<link>http://tibasicdev.wikidot.com/forum/t-14389620/binary-to-decimal#post-5159133</link>
				<description></description>
				<pubDate>Sun, 19 Dec 2021 03:37:27 +0000</pubDate>
				<wikidot:authorName>imcoraline</wikidot:authorName>				<wikidot:authorUserId>6725643</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>by the way, that funky superscript character next to 4 is -1. its really 4^-1 using the inverse command. its .25, but smaller, since it uses less tokens.</p> 
				 	]]>
				</content:encoded>							</item>
					<item>
				<guid>http://tibasicdev.wikidot.com/forum/t-14389620#post-5159131</guid>
				<title>binary to decimal: binary to decimal code optimization</title>
				<link>http://tibasicdev.wikidot.com/forum/t-14389620/binary-to-decimal#post-5159131</link>
				<description></description>
				<pubDate>Sun, 19 Dec 2021 03:34:43 +0000</pubDate>
				<wikidot:authorName>imcoraline</wikidot:authorName>				<wikidot:authorUserId>6725643</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>im not trying for speed, im trying for size. right now, on my ti83+, this program takes up 37 ram (with a one letter program name, if that changes anything). is there any further optimization possible at this point?</p> <p>(note: the code takes a binary number in a list (that list is Ans) and outputs the decimal equivalent. for example, 101<sub>2</sub> is {1,0,1}.)</p> <div class="code"> <pre><code>4ֿ¹sum(seq(Ans(1+dim(Ans)-A)2(2^A),A,1,dim(Ans</code></pre></div> 
				 	]]>
				</content:encoded>							</item>
					<item>
				<guid>http://tibasicdev.wikidot.com/forum/t-13818028#post-4810816</guid>
				<title>help me optimize my first program: Re: help me optimize my first program</title>
				<link>http://tibasicdev.wikidot.com/forum/t-13818028/help-me-optimize-my-first-program#post-4810816</link>
				<description></description>
				<pubDate>Wed, 04 Nov 2020 01:42:25 +0000</pubDate>
				<wikidot:authorName>Trenly</wikidot:authorName>				<wikidot:authorUserId>1905506</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>I would like to mention that there are several <a href="http://tibasicdev.wikidot.com/memory-leaks">memory leaks</a> that I see, especially when there is:</p> <div class="code"> <pre><code>If E&lt;5 Then If E≤0 Then Goto WN End End</code></pre></div> <br /> or <div class="code"> <pre><code>If H≤0 Then Goto D End</code></pre></div> <p>So even if the code itself is optimized, the program will still run inefficiently. To fully optimize it, the memory leaks would need to be removed</p> 
				 	]]>
				</content:encoded>							</item>
					<item>
				<guid>http://tibasicdev.wikidot.com/forum/t-4391375#post-4810814</guid>
				<title>Quadratic formula: Re: Quadratic formula</title>
				<link>http://tibasicdev.wikidot.com/forum/t-4391375/quadratic-formula#post-4810814</link>
				<description></description>
				<pubDate>Wed, 04 Nov 2020 01:39:27 +0000</pubDate>
				<wikidot:authorName>Trenly</wikidot:authorName>				<wikidot:authorUserId>1905506</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>Even ignoring the fact that this is an old post, as this is a very well known formula, it can be optimized even further down to 29 bytes:</p> <div class="code"> <pre><code>Prompt A,B,C √(B²-4AC:⁻B+{Ans,⁻Ans Ans/(2A</code></pre></div> 
				 	]]>
				</content:encoded>							</item>
					<item>
				<guid>http://tibasicdev.wikidot.com/forum/t-1090781#post-4810810</guid>
				<title>I&#039;m bad at optimization. Kinematics anyone?: Re: I&#039;m bad at optimization. Kinematics anyone?</title>
				<link>http://tibasicdev.wikidot.com/forum/t-1090781/i-m-bad-at-optimization-kinematics-anyone#post-4810810</link>
				<description></description>
				<pubDate>Wed, 04 Nov 2020 01:21:12 +0000</pubDate>
				<wikidot:authorName>Trenly</wikidot:authorName>				<wikidot:authorUserId>1905506</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p><span class="printuser avatarhover"><a href="http://www.wikidot.com/user:info/c28" ><img class="small" src="http://www.wikidot.com/avatar.php?userid=6979576&amp;amp;size=small&amp;amp;timestamp=1696955901" alt="C28" style="background-image:url(http://www.wikidot.com/userkarma.php?u=6979576)" /></a><a href="http://www.wikidot.com/user:info/c28" >C28</a></span>, This post is 5 years old, and I really am not looking for an answer any more. I'm glad you're active and finding value from TI|BD, and I'd like to say welcome to the community. However, I highly suggest you read the <a href="http://tibasicdev.wikidot.com/rules">Rules and Code of Conduct</a> as I see you have posted on multiple old threads in the past few days.</p> 
				 	]]>
				</content:encoded>							</item>
					<item>
				<guid>http://tibasicdev.wikidot.com/forum/t-1090781#post-4810780</guid>
				<title>I&#039;m bad at optimization. Kinematics anyone?: Re: I&#039;m bad at optimization. Kinematics anyone?</title>
				<link>http://tibasicdev.wikidot.com/forum/t-1090781/i-m-bad-at-optimization-kinematics-anyone#post-4810780</link>
				<description></description>
				<pubDate>Tue, 03 Nov 2020 23:42:19 +0000</pubDate>
								<wikidot:authorUserId>6979576</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>this can be optimized to</p> <div class="code"> <pre><code>ClrHome Lbl theta Menu(&quot;Menu&quot;,&quot;Acceleration&quot;,1,&quot;Initial V&quot;,2,&quot;Final V&quot;,3,&quot;Displacement&quot;,4,&quot;Time&quot;,5,&quot;Variables&quot;,VZ,&quot;Exit&quot;,Q Lbl Q ClrHome Float Asm(prgmZDONE Return Lbl VZ ClrHome Output(1,1,&quot;Variable Index Output(2,1,&quot;V = F. Velocity Output(3,1,&quot;U = I. Velocity Output(4,1,&quot;T = Time Output(5,1,&quot;A = Acceleration Output(6,1,&quot;D = Displacement Pause Goto theta Lbl 1 ClrHome Menu(&quot;GIVEN:&quot;,&quot;V,U,T&quot;,Z,&quot;D,U,T&quot;,B,&quot;V,U,D&quot;,C,&quot;Exit&quot;,Q Lbl Z Disp &quot;V=U+AT Disp &quot;(V-U)/T Prompt V,U,T (V-U)/T-&gt;A Goto A Lbl B Disp &quot;D=UT+.5AT^^2 Disp &quot;A=2(D-UT)/T^^2 Prompt D,U,T 2(D-UT)/T^^2-&gt;A Goto A Lbl C Disp &quot;V^^2=U^^2+2AD Disp &quot;(V^^2-U^^2)/2D Prompt V,U,D (V^^2-U^^2)/(2D)-&gt;A Lbl A Disp A Pause Goto theta Lbl 2 ClrHome Menu(&quot;GIVEN:&quot;,&quot;V,A,T&quot;,D,&quot;D,A,T&quot;,E,&quot;V,A,D&quot;,F,&quot;D,T,V&quot;,G,&quot;Exit&quot;,Q Lbl D Disp &quot;V-AT Prompt V,A,T V-AT-&gt;U Goto U Lbl E Disp &quot;D-(.5AT^^2)/T Prompt D,A,T (D-(.5)(A)(T^^2))/T-&gt;U Goto U Lbl F Disp &quot;sqrt(V^^2-2AD) Prompt V,A,D sqrt(V^^2-2AD-&gt;U Goto U Lbl G Disp &quot;(2D/T)-V Prompt D,T,V (2D/T)-V-&gt;U Lbl U Disp U Pause Goto theta Lbl 3 ClrHome Menu(&quot;GIVEN:&quot;,&quot;U,A,T&quot;,H,&quot;U,A,D&quot;,I,&quot;D,T,U&quot;,J,&quot;Exit&quot;,Q Lbl H Disp &quot;U+AT Prompt U,A,T U+AT-&gt;V Goto V Lbl I Disp &quot;sqrt((U^^2+2AD) Prompt U,A,D sqrt(U^^2-2AD)-&gt;V Goto V Lbl J Disp &quot;(2D/T)-U Prompt D,T,U (2D/T)-U-&gt;V Lbl V Disp V Pause Goto theta Lbl 4 ClrHome Menu(&quot;GIVEN:&quot;,&quot;U,T,A&quot;,K,&quot;U,V,A&quot;,L,&quot;V,U,T&quot;,M,&quot;Exit&quot;,Q Lbl K Disp &quot;D=UT+.5AT^^2 Prompt U,T,A UT+.5A(T^^2-&gt;D Goto X Lbl L Disp &quot;V^^2=U^^2+2AD Disp &quot;(V^^2-U^^2)/2A Prompt U,V,A (V^^2-U^^2)/2A-&gt;D Goto X Lbl M Disp &quot;D=.5(V+U)T Prompt V,U,T .5T(V+U-&gt;D Lbl X Disp D Pause Goto theta Lbl 5 ClrHome Menu(&quot;GIVEN:&quot;,&quot;A,V,U&quot;,N,&quot;A,D,U&quot;,O,&quot;D,U,V&quot;,P,&quot;Exit&quot;,Q Lbl N Disp &quot;V=U+AT Disp &quot;(V-U)/A Prompt A,V,U (V-U)/A-&gt;T Disp T Pause Goto theta Lbl O Disp &quot;D=UT+.5AT^^2 Prompt A,D,U If D&lt;0 Then (D*~1-&gt;D End If U!=0:Then Goto 8 End If U=0:Then Goto 6 End Lbl 8 A/2-&gt;A sqrt(U^^2-4(A)(D-&gt;Z (~U+Z)/2A-&gt;X (~U-Z)/2A-&gt;Y Disp X,Y Pause Goto theta Lbl P Disp &quot;2D/(V+U) Prompt D,U,V 2D/(V+U-&gt;T Disp T Pause Goto theta Lbl 6 sqrt(2D/A-&gt;T Disp T Pause Goto theta Lbl Q ClrHome Return</code></pre></div> 
				 	]]>
				</content:encoded>							</item>
					<item>
				<guid>http://tibasicdev.wikidot.com/forum/t-4391375#post-4810777</guid>
				<title>Quadratic formula: Re: Quadratic formula</title>
				<link>http://tibasicdev.wikidot.com/forum/t-4391375/quadratic-formula#post-4810777</link>
				<description></description>
				<pubDate>Tue, 03 Nov 2020 23:37:43 +0000</pubDate>
								<wikidot:authorUserId>6979576</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>no, it can be further optimized to</p> <div class="code"> <pre><code>Prompt A,B,C √(B²-4AC→D:Ans-B→C:-B-D→D:C/2A→B:D/2A Disp B,Ans</code></pre></div> 
				 	]]>
				</content:encoded>							</item>
					<item>
				<guid>http://tibasicdev.wikidot.com/forum/t-13818028#post-4810775</guid>
				<title>help me optimize my first program: Re: help me optimize my first program</title>
				<link>http://tibasicdev.wikidot.com/forum/t-13818028/help-me-optimize-my-first-program#post-4810775</link>
				<description></description>
				<pubDate>Tue, 03 Nov 2020 23:33:55 +0000</pubDate>
								<wikidot:authorUserId>6979576</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>after looking at it, i managed to get</p> <div class="code"> <pre><code>ClrDraw ClrHome Clear Entries 0→P 14→X 5→Y 0→L &quot;θ→Str1 &quot;#→Str2 Goto 2 Lbl D Output(5,13,&quot;Game Over Wait 2 {15,3,3→SAVE Stop Lbl 2 Menu(&quot;Game&quot;,&quot;Continue&quot;,3,&quot;New Game&quot;,6,&quot;Quit&quot;,4 Lbl O4 Menu(&quot;Style?&quot;,&quot;#&quot;,O5,&quot;X&quot;,O6 Lbl O5 &quot;#→Str2 Goto 6 Lbl O6 &quot;X→Str2 Goto 6 Lbl C9 randInt(1,5→Z randInt(0,4→W randInt(0,3→S Z+H→H W+A→A S+D→D Output(4,12,Z Output(5,12,W Output(6,12,S Output(4,11,&quot;+ Output(5,11,&quot;+ Output(6,11,&quot;+ Output(4,13,&quot; Health Output(5,13,&quot; Attack Output(6,13,&quot; Defence 0→[A](Y,X Pause For(R,4,6 For(Q,11,20 If 1=[A](R,Q Then Output(R,Q,Str2 End If 0=[A](R,Q Then Output(R,Q,&quot; &quot; End If 2=[A](R,Q) Then Output(R,Q,&quot;E End If 3=[A](R,Q Then Output(R,Q,&quot;C End End End Goto 5 Lbl 7 For(X,1,7 // X can be replaced with any other variable Output(X,1,&quot; &quot; End For(Q,1,26 Output(8,Q,&quot;# End For(Q,1,26 Output(9,Q,&quot;# End Output(10,14,&quot;# Output(7,21,&quot;|| Output(6,19,&quot;+/( Output(6,22,&quot;)\ Output(5,21,&quot;O Output(5,19,&quot;| Output(7,2,&quot;|| Output(6,1,&quot;/( Output(6,3,&quot;)\+ Output(5,3,&quot;O Output(5,5,&quot;| round(H,0→H randInt(H-5,H+15→E E→G randInt(A-2,A+3→V H→B randInt(D-2,D+3→I If I&gt;A A-3→I Goto C1 Lbl C1 Output(4,2,E If E&lt;5 Then If E≤0 Then Goto WN End End Output(4,21,&quot; &quot; Output(4,21,H Output(4,2,&quot; &quot; Output(4,2,E Wait 0.5 Output(3,20,&quot; &quot; Output(3,1,&quot; &quot; If H≤0 Then Goto D End Menu(&quot;What Will You Do&quot;,&quot;Attack&quot;,A1,&quot;Heal&quot;,H Lbl WN 0→[A](Y,X H+5→H If M=11 Goto M1 If M=12 Goto M2 If M=13 Goto M3 If M=14 Goto M4 If M=15 Goto M5 Goto 82 Lbl H H+2+1.5D→H If H&gt;1.5B H-5→H If H&gt;2B B→H round(H,1→H Goto E1 Lbl A1 E-1.2A→E Output(3,1,&quot;- Output(3,3,1.2A Goto E1 Lbl E1 randInt(1,2→J If J=1 Goto E2 If J=2 Then E+I→E Goto C1 End Lbl E2 randInt(1,3→J If J=1 Then Output(3,20,&quot;miss Goto C1 End If J&gt;1 H-0.8V→H Output(3,20,&quot;- Output(3,21,0.8V Goto C1 End Lbl 6 15→H 3→A 3→D Goto 9 Lbl 1 Menu(&quot;Pause&quot;,&quot;Continue&quot;,5,&quot;Inventory&quot;,I,&quot;Save &amp; Quit&quot;,4 Lbl I For(R,1,10 For(Q,1,26 Output(R,Q,&quot; &quot; End End Disp &quot;Health Disp H Disp &quot;Attack Disp A Disp &quot;Defence Disp D Pause Goto 82 Lbl 4 {H,A,D→SAVE ClrHome ClrDraw Stop Lbl 3 ⌊SAVE(1→H ⌊SAVE(2→A ⌊SAVE(3→D Goto 9 Lbl 9 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP201 {1,1,1,1,1,1,1,0,1,0,1,1,1,0,1,1,1,0,1,0,1,1,1,1,1,1→⌊MP202 {1,1,1,1,1,1,0,1,0,1,0,0,0,0,0,0,0,1,0,1,0,1,1,1,1,1→⌊MP203 {1,1,1,1,1,1,1,0,1,0,0,0,1,0,1,0,0,0,1,0,1,1,1,1,1,1→⌊MP204 {0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0→⌊MP205 {1,1,1,1,1,1,1,0,1,0,0,0,1,0,1,0,0,0,1,0,1,1,1,1,1,1→⌊MP206 {1,1,1,1,1,1,0,1,0,1,0,0,0,0,0,0,0,1,0,1,0,1,1,1,1,1→⌊MP207 {1,1,1,1,1,1,1,0,1,0,1,1,1,0,1,1,1,0,1,0,1,1,1,1,1,1→⌊MP208 {1,1,1,1,1,1,1,1,0,1,0,0,1,0,1,0,0,1,0,1,1,1,1,1,1,1→⌊MP209 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP210 Listmatr(⌊MP201,⌊MP202,⌊MP203,⌊MP204,⌊MP205,⌊MP206,⌊MP207,⌊MP208,⌊MP209,⌊MP210,[A] [A]→[A] Output(1,1,&quot;############# ############ Output(2,1,&quot;####### # ### ### # ###### Output(3,1,&quot;###### # # # # ##### Output(4,1,&quot;####### # # # # ###### Output(5,1,&quot; # # &quot; Output(6,1,&quot;####### # # # # ###### Output(7,1,&quot;###### # # # # ##### Output(8,1,&quot;####### # ### ### # ###### Output(9,1,&quot;######## # # # # ####### Output(10,1,&quot;############# ############ Goto 5 Lbl X {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP101 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP102 {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP103 {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP104 {0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0→⌊MP105 {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP106 {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP107 {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP108 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP109 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP110 Listmatr(⌊MP101,⌊MP102,⌊MP103,⌊MP104,⌊MP105,⌊MP106,⌊MP107,⌊MP108,⌊MP109,⌊MP110,[A] [A]→[A] Goto 8 Lbl 10 randInt(11,15→M If M=K Goto 10 M→K DelVar [A] {10,26→dim([A] If M=11 Goto 11 If M=12 Goto 12 If M=13 Goto 13 If M=14 Goto 14 If M=15 Goto 15 If M=16 Goto 16 Lbl 11 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP101 {1,1,0,0,0,1,0,0,1,1,0,1,1,0,0,0,1,3,1,0,0,0,1,1,3,1→⌊MP102 {1,3,0,1,0,0,2,1,0,0,0,0,0,1,1,0,0,2,1,0,1,0,1,0,0,1→⌊MP103 {1,1,1,1,1,1,0,1,0,1,1,0,1,0,0,0,1,1,0,0,1,0,1,2,1,1→⌊MP104 {0,0,0,0,0,0,0,1,0,0,1,0,0,0,1,0,2,0,0,1,1,0,0,0,0,0→⌊MP105 {1,1,1,0,1,1,0,0,0,1,1,1,0,1,1,1,1,1,1,0,1,1,1,0,1,1→⌊MP106 {1,3,1,0,1,0,1,1,0,0,1,0,2,0,1,0,0,1,0,0,0,0,1,0,0,1→⌊MP107 {1,0,0,0,1,0,0,2,1,0,1,0,1,0,1,1,0,2,0,1,1,0,0,1,0,1→⌊MP108 {1,1,0,1,3,0,1,0,0,0,0,1,1,0,1,3,0,1,0,0,3,1,0,0,0,1→⌊MP109 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP110 Listmatr(⌊MP101,⌊MP102,⌊MP103,⌊MP104,⌊MP105,⌊MP106,⌊MP107,⌊MP108,⌊MP109,⌊MP110,[A] [A]→[A] Goto M1 Lbl M1 Output(1,1,&quot;############# ############ Output(2,1,&quot;## # ## ## #C# ##C# Output(3,1,&quot;#C # E# ## E# # # # Output(4,1,&quot;###### # ## # ## # #E## Output(5,1,&quot; # # # E ## &quot; Output(6,1,&quot;### ## ### ###### ### ## Output(7,1,&quot;#C# # ## # E # # # # Output(8,1,&quot;# # E# # # ## E ## # # Output(9,1,&quot;## #C # ## #C # C# # Output(10,1,&quot;############# ############ Goto 5 Lbl 12 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP101 {1,0,0,0,1,3,1,3,1,0,2,0,1,0,1,3,1,0,0,1,0,1,1,0,3,1→⌊MP102 {1,3,1,0,2,0,1,0,1,3,1,0,0,0,1,0,2,0,1,0,0,0,0,0,1,1→⌊MP103 {1,1,0,0,1,1,1,2,0,1,0,0,1,1,1,1,1,0,0,0,1,0,1,0,0,1→⌊MP104 {0,0,1,2,1,0,0,1,0,1,0,1,0,0,0,1,0,0,1,1,1,0,0,1,0,0→⌊MP105 {1,0,0,0,1,1,0,0,0,1,0,0,0,1,0,1,1,0,1,3,2,1,0,0,1,1→⌊MP106 {1,1,1,0,0,1,0,1,1,0,0,1,1,0,0,0,0,0,0,1,0,1,1,0,1,1→⌊MP107 {1,0,0,0,1,0,0,0,1,0,1,3,0,1,1,0,1,1,1,1,0,0,0,0,0,1→⌊MP108 {1,3,1,0,2,0,1,0,0,0,1,1,0,0,0,0,0,1,3,0,2,1,0,1,0,1→⌊MP109 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP110 Listmatr(⌊MP101,⌊MP102,⌊MP103,⌊MP104,⌊MP105,⌊MP106,⌊MP107,⌊MP108,⌊MP109,⌊MP110,[A] [A]→[A] Goto M2 Lbl M2 Output(1,1,&quot;############# ############ Output(2,1,&quot;# #C#C# E # #C# # ## C# Output(3,1,&quot;#C# E # #C# # E # ## Output(4,1,&quot;## ###E # ##### # # # Output(5,1,&quot; #E# # # # # ### # &quot; Output(6,1,&quot;# ## # # ## #CE# ## Output(7,1,&quot;### # ## ## # ## ## Output(8,1,&quot;# # # #C ## #### # Output(9,1,&quot;#C# E # ## #C E# # # Output(10,1,&quot;############# ############ Goto 5 Lbl 13 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP101 {1,3,0,1,0,0,1,3,1,1,0,3,1,0,1,1,3,1,0,0,0,3,1,2,0,1→⌊MP102 {1,1,2,1,0,1,1,0,0,2,0,1,0,0,0,0,0,2,0,1,0,1,1,0,1,1→⌊MP103 {1,0,0,0,0,0,0,1,1,1,0,0,1,1,0,1,0,1,1,0,0,1,0,0,0,1→⌊MP104 {0,0,1,0,1,0,1,0,1,0,1,0,0,0,2,1,0,1,0,1,0,0,0,1,0,0→⌊MP105 {1,0,1,0,0,1,0,0,0,0,1,1,0,1,0,0,1,0,0,0,1,0,1,0,1,1→⌊MP106 {1,1,1,1,0,0,0,1,0,1,1,0,0,1,1,0,0,0,1,0,0,0,2,0,1,1→⌊MP107 {1,3,0,1,0,1,1,1,0,0,0,0,1,1,0,2,1,0,1,0,1,1,0,1,3,1→⌊MP108 {1,1,0,0,2,0,0,3,1,0,1,0,0,0,0,1,0,0,1,0,3,1,0,0,0,1→⌊MP109 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP110 Listmatr(⌊MP101,⌊MP102,⌊MP103,⌊MP104,⌊MP105,⌊MP106,⌊MP107,⌊MP108,⌊MP109,⌊MP110,[A] [A]→[A] Goto M3 Lbl M3 Output(1,1,&quot;############# ############ Output(2,1,&quot;#C # #C## C# ##C# C#E # Output(3,1,&quot;##E# ## E # # # ## ## Output(4,1,&quot;# ### ## # ## # # Output(5,1,&quot; # # # # # E# # # # &quot; Output(6,1,&quot;# # # ## # # # # ## Output(7,1,&quot;#### # ## ## # E ## Output(8,1,&quot;#C # ### ## E# # ## #C# Output(9,1,&quot;## E C# # # # C# # Output(10,1,&quot;############# ############ Goto 5 Lbl 14 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP101 {1,3,0,0,0,2,0,0,1,3,1,0,0,0,0,0,0,1,2,0,3,1,1,0,3,1→⌊MP102 {1,1,1,1,0,1,0,1,0,0,0,2,1,1,0,1,0,0,0,1,1,0,0,0,1,1→⌊MP103 {1,0,0,0,1,0,0,1,1,1,1,0,0,1,0,0,1,0,1,0,0,0,1,0,0,1→⌊MP104 {0,0,1,0,1,0,1,0,0,0,0,1,0,1,1,0,1,0,0,0,1,1,0,1,0,0→⌊MP105 {1,1,1,0,0,0,0,0,1,1,0,0,0,0,1,0,0,1,1,0,0,2,0,1,1,1→⌊MP106 {1,0,0,0,1,1,0,1,0,1,1,1,1,0,0,1,1,3,1,0,1,1,0,0,0,1→⌊MP107 {1,1,2,1,3,1,2,1,0,0,2,0,1,1,0,0,0,2,1,0,0,0,1,0,1,1→⌊MP108 {1,3,0,1,0,0,0,3,1,3,1,0,0,0,0,1,0,1,0,0,1,1,3,0,0,1→⌊MP109 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP110 Listmatr(⌊MP101,⌊MP102,⌊MP103,⌊MP104,⌊MP105,⌊MP106,⌊MP107,⌊MP108,⌊MP109,⌊MP110,[A] [A]→[A] Goto M4 Lbl M4 Output(1,1,&quot;############# ############ Output(2,1,&quot;#C E #C# #E C## C# Output(3,1,&quot;#### # # E## # ## ## Output(4,1,&quot;# # #### # # # # # Output(5,1,&quot; # # # # ## # ## # &quot; Output(6,1,&quot;### ## # ## E ### Output(7,1,&quot;# ## # #### ##C# ## # Output(8,1,&quot;##E#C#E# E ## E# # ## Output(9,1,&quot;#C # C#C# # # ##C # Output(10,1,&quot;############# ############ Goto 5 Lbl 15 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP101 {1,3,0,0,2,0,1,3,1,0,0,1,0,0,1,0,0,1,0,0,0,0,1,0,3,1→⌊MP102 {1,1,1,0,1,3,1,0,0,1,0,0,0,1,3,0,1,0,0,1,1,0,0,0,1,1→⌊MP103 {1,0,0,2,1,1,0,1,2,0,0,1,1,0,1,0,0,0,1,0,3,1,0,1,1,1→⌊MP104 {0,0,1,0,0,1,2,0,0,1,0,0,1,0,2,0,1,1,0,2,1,0,0,1,0,0→⌊MP105 {1,1,3,1,0,1,0,1,1,3,1,0,1,0,1,1,3,1,0,1,0,0,1,0,0,1→⌊MP106 {1,0,0,2,0,1,0,0,1,0,1,0,0,0,0,1,0,0,0,1,0,1,0,0,1,1→⌊MP107 {1,2,1,1,0,0,1,0,2,0,1,1,2,1,0,0,1,2,1,0,2,0,0,1,3,1→⌊MP108 {1,0,3,3,1,0,0,0,1,0,0,1,0,0,1,0,0,0,1,3,1,1,0,2,0,1→⌊MP109 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP110 Listmatr(⌊MP101,⌊MP102,⌊MP103,⌊MP104,⌊MP105,⌊MP106,⌊MP107,⌊MP108,⌊MP109,⌊MP110,[A] [A]→[A] Goto M5 Lbl M5 Output(1,1,&quot;############# ############ Output(2,1,&quot;#C E #C# # # # # C# Output(3,1,&quot;### #C# # #C # ## ## Output(4,1,&quot;# E## #E ## # # C# ### Output(5,1,&quot; # #E # # E ## E# # &quot; Output(6,1,&quot;##C# # ##C# # ##C# # # # Output(7,1,&quot;# E # # # # # # ## Output(8,1,&quot;#E## # E ##E# #E# E #C# Output(9,1,&quot;# CC# # # # #C## E # Output(10,1,&quot;############# ############ Goto 5 Lbl 16 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP101 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP102 {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP103 {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP104 {0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0→⌊MP105 {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP106 {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP107 {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP108 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP109 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP110 Listmatr(⌊MP101,⌊MP102,⌊MP103,⌊MP104,⌊MP105,⌊MP106,⌊MP107,⌊MP108,⌊MP109,⌊MP110,[A] [A]→[A] Goto 8 Lbl 82 Output(1,1,&quot;############# ############ For(R,2,9 Output(R,1,&quot;# Output(R,26,&quot;# End Output(5,1,&quot; &quot; Output(5,26,&quot; &quot; Output(10,1,&quot;############# ############ Goto 8 Lbl 8 For(R,2,9 For(Q,2,25 If 1=[A](R,Q Then Output(R,Q,Str2 End If 0=[A](R,Q Then Output(R,Q,&quot; &quot; End If 2=[A](R,Q Then Output(R,Q,&quot;E End If 3=[A](R,Q Then Output(R,Q,&quot;C End End End Goto 5 Lbl 5 0→P While 1 Output(Y,X,Str1 getKey→P If P=24 Then If X=1 Then Output(Y,X,&quot; &quot; 26→X Output(Y,X,Str1 Goto 10 Else If 2=[A](Y,X-1 Then Output(Y,X,&quot; &quot; X-1→X Goto 7 End If 3=[A](Y,X-1 Then Output(Y,X,&quot; &quot; X-1→X Goto C9 End If 0=[A](Y,X-1 Then Output(Y,X,&quot; &quot; X-1→X End End Output(Y,X,Str1 Else If P=34 Then If Y=10 Then Output(Y,X,&quot; &quot; 1→Y Output(Y,X,Str1 Goto 10 Else If 2=[A](Y+1,X Then Output(Y,X,&quot; &quot; Y+1→Y Goto 7 End If 3=[A](Y+1,X Then Output(Y,X,&quot; &quot; Y+1→Y Goto C9 End If 0=[A](Y+1,X Then Output(Y,X,&quot; &quot; Y+1→Y End End Output(Y,X,Str1 Else If P=25 Then If Y=1 Then Output(Y,X,&quot; &quot; 10→Y Output(Y,X,Str1 Goto 10 Else If 2=[A](Y-1,X Then Output(Y,X,&quot; &quot; Y-1→Y Goto 7 End If 3=[A](Y-1,X Then Output(Y,X,&quot; &quot; Y-1→Y Goto C9 End If 0=[A](Y-1,X Then Output(Y,X,&quot; &quot; Y-1→Y End End Output(Y,X,Str1 Else If P=26 Then If X=26 Then Output(Y,X,&quot; &quot; 1→X Output(Y,X,Str1 Goto 10 Else If 2=[A](Y,X+1 Then Output(Y,X,&quot; &quot; X+1→X Goto 7 End If 3=[A](Y,X+1 Then Output(Y,X,&quot; &quot; X+1→X Goto C9 End If 0=[A](Y,X+1 Then Output(Y,X,&quot; &quot; X+1→X End End Output(Y,X,Str1 End If P=105 Then Goto 1 End 1+L→L If L&gt;5 Then &quot;θ→Str1 End If L&gt;10 Then &quot;0→Str1 0→L End 0→P End End End End End End End End End</code></pre></div> 
				 	]]>
				</content:encoded>							</item>
					<item>
				<guid>http://tibasicdev.wikidot.com/forum/t-2081415#post-4810611</guid>
				<title>Baseball-guess-the-number: Re: Baseball-guess-the-number</title>
				<link>http://tibasicdev.wikidot.com/forum/t-2081415/baseball-guess-the-number#post-4810611</link>
				<description></description>
				<pubDate>Tue, 03 Nov 2020 19:17:50 +0000</pubDate>
								<wikidot:authorUserId>3338172</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>This thread is over three years old, I doubt he is looking for a solution.</p> 
				 	]]>
				</content:encoded>							</item>
					<item>
				<guid>http://tibasicdev.wikidot.com/forum/t-2081415#post-4809812</guid>
				<title>Baseball-guess-the-number: Re: Baseball-guess-the-number</title>
				<link>http://tibasicdev.wikidot.com/forum/t-2081415/baseball-guess-the-number#post-4809812</link>
				<description></description>
				<pubDate>Mon, 02 Nov 2020 15:23:39 +0000</pubDate>
								<wikidot:authorUserId>6979576</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>you could replace</p> <div class="code"> <pre><code>If A≠E and C=1 Disp &quot; STRIKE ONE! If A≠E and C=2 disp&quot; STRIKE TWO! If A≠E and C=3:Then Disp &quot; STRIKE THREE!</code></pre></div> <br /> with <div class="code"> <pre><code>If A≠E If C=1 Disp &quot; STRIKE ONE! If C=2 disp&quot; STRIKE TWO! If C=3:Then Disp &quot; STRIKE THREE!</code></pre></div> 
				 	]]>
				</content:encoded>							</item>
					<item>
				<guid>http://tibasicdev.wikidot.com/forum/t-13375088#post-4809031</guid>
				<title>Optimize a Conway&#039;s Game of Life Program: 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-13818028#post-4796460</guid>
				<title>help me optimize my first program: Re: help me optimize my first program</title>
				<link>http://tibasicdev.wikidot.com/forum/t-13818028/help-me-optimize-my-first-program#post-4796460</link>
				<description></description>
				<pubDate>Thu, 15 Oct 2020 19:42:28 +0000</pubDate>
				<wikidot:authorName>Trenly</wikidot:authorName>				<wikidot:authorUserId>1905506</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>Ah, I see. Its only available above OS 5.2<br /> That explains why I don't see it in my catalog</p> 
				 	]]>
				</content:encoded>							</item>
					<item>
				<guid>http://tibasicdev.wikidot.com/forum/t-13818028#post-4796448</guid>
				<title>help me optimize my first program: Re: help me optimize my first program</title>
				<link>http://tibasicdev.wikidot.com/forum/t-13818028/help-me-optimize-my-first-program#post-4796448</link>
				<description></description>
				<pubDate>Thu, 15 Oct 2020 19:21:53 +0000</pubDate>
				<wikidot:authorName>Edspeedy</wikidot:authorName>				<wikidot:authorUserId>6934993</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>This is for the TI-84+CE. The wait command just waits for that amount of time (or 2 seconds on line 14)</p> 
				 	]]>
				</content:encoded>							</item>
					<item>
				<guid>http://tibasicdev.wikidot.com/forum/t-13818028#post-4796425</guid>
				<title>help me optimize my first program: Re: help me optimize my first program</title>
				<link>http://tibasicdev.wikidot.com/forum/t-13818028/help-me-optimize-my-first-program#post-4796425</link>
				<description></description>
				<pubDate>Thu, 15 Oct 2020 18:48:56 +0000</pubDate>
				<wikidot:authorName>Trenly</wikidot:authorName>				<wikidot:authorUserId>1905506</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>What version of calculator is this for? I'm not familiar with the &quot;Wait&quot; command that you have on line 14</p> 
				 	]]>
				</content:encoded>							</item>
					<item>
				<guid>http://tibasicdev.wikidot.com/forum/t-13818028#post-4796281</guid>
				<title>help me optimize my first program: help me optimize my first program</title>
				<link>http://tibasicdev.wikidot.com/forum/t-13818028/help-me-optimize-my-first-program#post-4796281</link>
				<description></description>
				<pubDate>Thu, 15 Oct 2020 14:24:38 +0000</pubDate>
				<wikidot:authorName>Edspeedy</wikidot:authorName>				<wikidot:authorUserId>6934993</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>this is the first program I ever made in TI basic and I know it can be optimized, I just don't know how. it's quite a big program so it might take a while. The program is a simple dungeon crawler that never really ends.</p> <div class="code"> <pre><code>ClrDraw ClrHome Clear Entries 0→P 14→X 5→Y 0→L &quot;θ&quot;→Str1 &quot;#&quot;→Str2 Goto 2 Lbl D Output(5,13,&quot;Game Over&quot;) Wait 2 {15,3,3→SAVE Stop Lbl 2 Menu(&quot;Game&quot;,&quot;Continue&quot;,3,&quot;New Game&quot;,6,&quot;Quit&quot;,4) Lbl O4 Menu(&quot;Style?&quot;,&quot;#&quot;,O5,&quot;X&quot;,O6) Lbl O5 &quot;#&quot;→Str2 Goto 6 Lbl O6 &quot;X&quot;→Str2 Goto 6 Lbl C9 randInt(1,5)→Z randInt(0,4)→W randInt(0,3)→S Z+H→H W+A→A S+D→D Output(4,12,Z Output(5,12,W Output(6,12,S Output(4,11,&quot;+&quot; Output(5,11,&quot;+&quot; Output(6,11,&quot;+&quot; Output(4,13,&quot; Health&quot; Output(5,13,&quot; Attack&quot; Output(6,13,&quot; Defence&quot; 0→[A](Y,X) Pause For(R,4,6) For(Q,11,20) If [A](R,Q)=1 Then Output(R,Q,Str2) End If [A](R,Q)=0 Then Output(R,Q,&quot; &quot;) End If [A](R,Q)=2 Then Output(R,Q,&quot;E&quot;) End If [A](R,Q)=3 Then Output(R,Q,&quot;C&quot;) End End End Goto 5 Lbl 7 Output(1,1,&quot; &quot;) Output(2,1,&quot; &quot;) Output(3,1,&quot; &quot;) Output(4,1,&quot; &quot;) Output(5,1,&quot; &quot;) Output(6,1,&quot; &quot;) Output(7,1,&quot; &quot;) For(Q,1,26) Output(8,Q,&quot;#&quot;) End For(Q,1,26) Output(9,Q,&quot;#&quot;) End Output(10,14,&quot;#&quot;) Output(7,21,&quot;||&quot;) Output(6,19,&quot;+/(&quot;) Output(6,22,&quot;)\&quot;) Output(5,21,&quot;O&quot;) Output(5,19,&quot;|&quot;) Output(7,2,&quot;||&quot;) Output(6,1,&quot;/(&quot;) Output(6,3,&quot;)\+&quot;) Output(5,3,&quot;O&quot;) Output(5,5,&quot;|&quot;) round(H,0)→H randInt(H-5,H+15)→E E→G randInt(A-2,A+3)→V H→B randInt(D-2,D+3)→I If I&gt;A A-3→I Goto C1 Lbl C1 Output(4,2,E If E&lt;5 Then If E≤0 Then Goto WN End End Output(4,21,&quot; &quot;) Output(4,21,H) Output(4,2,&quot; &quot;) Output(4,2,E) Wait 0.5 Output(3,20,&quot; &quot;) Output(3,1,&quot; &quot;) If H≤0 Then Goto D End Menu(&quot;What Will You Do&quot;,&quot;Attack&quot;,A1,&quot;Heal&quot;,H) Lbl WN 0→[A](Y,X) H+5→H If M=11 Goto M1 If M=12 Goto M2 If M=13 Goto M3 If M=14 Goto M4 If M=15 Goto M5 Goto 82 Lbl H H+2+(1.5D)→H If H&gt;1.5B H-5→H If H&gt;2B B→H round(H,1)→H Goto E1 Lbl A1 E-1.2A→E Output(3,1,&quot;-&quot;) Output(3,3,1.2A) Goto E1 Lbl E1 randInt(1,2)→J If J=1 Goto E2 If J=2 Then E+I→E Goto C1 End Lbl E2 randInt(1,3)→J If J=1 Then Output(3,20,&quot;miss&quot;) Goto C1 End If J&gt;1 H-0.8V→H Output(3,20,&quot;-&quot;) Output(3,21,0.8V) Goto C1 End Lbl 6 15→H 3→A 3→D Goto 9 Lbl 1 Menu(&quot;Pause&quot;,&quot;Continue&quot;,5,&quot;Inventory&quot;,I,&quot;Save &amp; Quit&quot;,4) Lbl I For(R,1,10 For(Q,1,26 Output(R,Q,&quot; &quot;) End End Disp &quot;Health&quot; Disp H Disp &quot;Attack&quot; Disp A Disp &quot;Defence&quot; Disp D Pause Goto 82 Lbl 4 {H,A,D→SAVE ClrHome ClrDraw Stop Lbl 3 ⌊SAVE(1→H ⌊SAVE(2→A ⌊SAVE(3→D Goto 9 Lbl 9 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP201 {1,1,1,1,1,1,1,0,1,0,1,1,1,0,1,1,1,0,1,0,1,1,1,1,1,1→⌊MP202 {1,1,1,1,1,1,0,1,0,1,0,0,0,0,0,0,0,1,0,1,0,1,1,1,1,1→⌊MP203 {1,1,1,1,1,1,1,0,1,0,0,0,1,0,1,0,0,0,1,0,1,1,1,1,1,1→⌊MP204 {0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0→⌊MP205 {1,1,1,1,1,1,1,0,1,0,0,0,1,0,1,0,0,0,1,0,1,1,1,1,1,1→⌊MP206 {1,1,1,1,1,1,0,1,0,1,0,0,0,0,0,0,0,1,0,1,0,1,1,1,1,1→⌊MP207 {1,1,1,1,1,1,1,0,1,0,1,1,1,0,1,1,1,0,1,0,1,1,1,1,1,1→⌊MP208 {1,1,1,1,1,1,1,1,0,1,0,0,1,0,1,0,0,1,0,1,1,1,1,1,1,1→⌊MP209 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP210 Listmatr(⌊MP201,⌊MP202,⌊MP203,⌊MP204,⌊MP205,⌊MP206,⌊MP207,⌊MP208,⌊MP209,⌊MP210,[A] [A]→[A] Output(1,1,&quot;############# ############&quot;) Output(2,1,&quot;####### # ### ### # ######&quot;) Output(3,1,&quot;###### # # # # #####&quot;) Output(4,1,&quot;####### # # # # ######&quot;) Output(5,1,&quot; # # &quot;) Output(6,1,&quot;####### # # # # ######&quot;) Output(7,1,&quot;###### # # # # #####&quot;) Output(8,1,&quot;####### # ### ### # ######&quot;) Output(9,1,&quot;######## # # # # #######&quot;) Output(10,1,&quot;############# ############&quot;) Goto 5 Lbl X {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP101 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP102 {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP103 {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP104 {0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0→⌊MP105 {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP106 {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP107 {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP108 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP109 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP110 Listmatr(⌊MP101,⌊MP102,⌊MP103,⌊MP104,⌊MP105,⌊MP106,⌊MP107,⌊MP108,⌊MP109,⌊MP110,[A] [A]→[A] Goto 8 Lbl 10 randInt(11,15)→M If M=K Goto 10 M→K DelVar [A] {10,26→dim([A] If M=11 Goto 11 If M=12 Goto 12 If M=13 Goto 13 If M=14 Goto 14 If M=15 Goto 15 If M=16 Goto 16 Lbl 11 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP101 {1,1,0,0,0,1,0,0,1,1,0,1,1,0,0,0,1,3,1,0,0,0,1,1,3,1→⌊MP102 {1,3,0,1,0,0,2,1,0,0,0,0,0,1,1,0,0,2,1,0,1,0,1,0,0,1→⌊MP103 {1,1,1,1,1,1,0,1,0,1,1,0,1,0,0,0,1,1,0,0,1,0,1,2,1,1→⌊MP104 {0,0,0,0,0,0,0,1,0,0,1,0,0,0,1,0,2,0,0,1,1,0,0,0,0,0→⌊MP105 {1,1,1,0,1,1,0,0,0,1,1,1,0,1,1,1,1,1,1,0,1,1,1,0,1,1→⌊MP106 {1,3,1,0,1,0,1,1,0,0,1,0,2,0,1,0,0,1,0,0,0,0,1,0,0,1→⌊MP107 {1,0,0,0,1,0,0,2,1,0,1,0,1,0,1,1,0,2,0,1,1,0,0,1,0,1→⌊MP108 {1,1,0,1,3,0,1,0,0,0,0,1,1,0,1,3,0,1,0,0,3,1,0,0,0,1→⌊MP109 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP110 Listmatr(⌊MP101,⌊MP102,⌊MP103,⌊MP104,⌊MP105,⌊MP106,⌊MP107,⌊MP108,⌊MP109,⌊MP110,[A] [A]→[A] Goto M1 Lbl M1 Output(1,1,&quot;############# ############&quot;) Output(2,1,&quot;## # ## ## #C# ##C#&quot;) Output(3,1,&quot;#C # E# ## E# # # #&quot;) Output(4,1,&quot;###### # ## # ## # #E##&quot;) Output(5,1,&quot; # # # E ## &quot;) Output(6,1,&quot;### ## ### ###### ### ##&quot;) Output(7,1,&quot;#C# # ## # E # # # #&quot;) Output(8,1,&quot;# # E# # # ## E ## # #&quot;) Output(9,1,&quot;## #C # ## #C # C# #&quot;) Output(10,1,&quot;############# ############&quot;) Goto 5 Lbl 12 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP101 {1,0,0,0,1,3,1,3,1,0,2,0,1,0,1,3,1,0,0,1,0,1,1,0,3,1→⌊MP102 {1,3,1,0,2,0,1,0,1,3,1,0,0,0,1,0,2,0,1,0,0,0,0,0,1,1→⌊MP103 {1,1,0,0,1,1,1,2,0,1,0,0,1,1,1,1,1,0,0,0,1,0,1,0,0,1→⌊MP104 {0,0,1,2,1,0,0,1,0,1,0,1,0,0,0,1,0,0,1,1,1,0,0,1,0,0→⌊MP105 {1,0,0,0,1,1,0,0,0,1,0,0,0,1,0,1,1,0,1,3,2,1,0,0,1,1→⌊MP106 {1,1,1,0,0,1,0,1,1,0,0,1,1,0,0,0,0,0,0,1,0,1,1,0,1,1→⌊MP107 {1,0,0,0,1,0,0,0,1,0,1,3,0,1,1,0,1,1,1,1,0,0,0,0,0,1→⌊MP108 {1,3,1,0,2,0,1,0,0,0,1,1,0,0,0,0,0,1,3,0,2,1,0,1,0,1→⌊MP109 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP110 Listmatr(⌊MP101,⌊MP102,⌊MP103,⌊MP104,⌊MP105,⌊MP106,⌊MP107,⌊MP108,⌊MP109,⌊MP110,[A] [A]→[A] Goto M2 Lbl M2 Output(1,1,&quot;############# ############&quot;) Output(2,1,&quot;# #C#C# E # #C# # ## C#&quot;) Output(3,1,&quot;#C# E # #C# # E # ##&quot;) Output(4,1,&quot;## ###E # ##### # # #&quot;) Output(5,1,&quot; #E# # # # # ### # &quot;) Output(6,1,&quot;# ## # # ## #CE# ##&quot;) Output(7,1,&quot;### # ## ## # ## ##&quot;) Output(8,1,&quot;# # # #C ## #### #&quot;) Output(9,1,&quot;#C# E # ## #C E# # #&quot;) Output(10,1,&quot;############# ############&quot;) Goto 5 Lbl 13 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP101 {1,3,0,1,0,0,1,3,1,1,0,3,1,0,1,1,3,1,0,0,0,3,1,2,0,1→⌊MP102 {1,1,2,1,0,1,1,0,0,2,0,1,0,0,0,0,0,2,0,1,0,1,1,0,1,1→⌊MP103 {1,0,0,0,0,0,0,1,1,1,0,0,1,1,0,1,0,1,1,0,0,1,0,0,0,1→⌊MP104 {0,0,1,0,1,0,1,0,1,0,1,0,0,0,2,1,0,1,0,1,0,0,0,1,0,0→⌊MP105 {1,0,1,0,0,1,0,0,0,0,1,1,0,1,0,0,1,0,0,0,1,0,1,0,1,1→⌊MP106 {1,1,1,1,0,0,0,1,0,1,1,0,0,1,1,0,0,0,1,0,0,0,2,0,1,1→⌊MP107 {1,3,0,1,0,1,1,1,0,0,0,0,1,1,0,2,1,0,1,0,1,1,0,1,3,1→⌊MP108 {1,1,0,0,2,0,0,3,1,0,1,0,0,0,0,1,0,0,1,0,3,1,0,0,0,1→⌊MP109 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP110 Listmatr(⌊MP101,⌊MP102,⌊MP103,⌊MP104,⌊MP105,⌊MP106,⌊MP107,⌊MP108,⌊MP109,⌊MP110,[A] [A]→[A] Goto M3 Lbl M3 Output(1,1,&quot;############# ############&quot;) Output(2,1,&quot;#C # #C## C# ##C# C#E #&quot;) Output(3,1,&quot;##E# ## E # # # ## ##&quot;) Output(4,1,&quot;# ### ## # ## # #&quot;) Output(5,1,&quot; # # # # # E# # # # &quot;) Output(6,1,&quot;# # # ## # # # # ##&quot;) Output(7,1,&quot;#### # ## ## # E ##&quot;) Output(8,1,&quot;#C # ### ## E# # ## #C#&quot;) Output(9,1,&quot;## E C# # # # C# #&quot;) Output(10,1,&quot;############# ############&quot;) Goto 5 Lbl 14 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP101 {1,3,0,0,0,2,0,0,1,3,1,0,0,0,0,0,0,1,2,0,3,1,1,0,3,1→⌊MP102 {1,1,1,1,0,1,0,1,0,0,0,2,1,1,0,1,0,0,0,1,1,0,0,0,1,1→⌊MP103 {1,0,0,0,1,0,0,1,1,1,1,0,0,1,0,0,1,0,1,0,0,0,1,0,0,1→⌊MP104 {0,0,1,0,1,0,1,0,0,0,0,1,0,1,1,0,1,0,0,0,1,1,0,1,0,0→⌊MP105 {1,1,1,0,0,0,0,0,1,1,0,0,0,0,1,0,0,1,1,0,0,2,0,1,1,1→⌊MP106 {1,0,0,0,1,1,0,1,0,1,1,1,1,0,0,1,1,3,1,0,1,1,0,0,0,1→⌊MP107 {1,1,2,1,3,1,2,1,0,0,2,0,1,1,0,0,0,2,1,0,0,0,1,0,1,1→⌊MP108 {1,3,0,1,0,0,0,3,1,3,1,0,0,0,0,1,0,1,0,0,1,1,3,0,0,1→⌊MP109 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP110 Listmatr(⌊MP101,⌊MP102,⌊MP103,⌊MP104,⌊MP105,⌊MP106,⌊MP107,⌊MP108,⌊MP109,⌊MP110,[A] [A]→[A] Goto M4 Lbl M4 Output(1,1,&quot;############# ############&quot;) Output(2,1,&quot;#C E #C# #E C## C#&quot;) Output(3,1,&quot;#### # # E## # ## ##&quot;) Output(4,1,&quot;# # #### # # # # #&quot;) Output(5,1,&quot; # # # # ## # ## # &quot;) Output(6,1,&quot;### ## # ## E ###&quot;) Output(7,1,&quot;# ## # #### ##C# ## #&quot;) Output(8,1,&quot;##E#C#E# E ## E# # ##&quot;) Output(9,1,&quot;#C # C#C# # # ##C #&quot;) Output(10,1,&quot;############# ############&quot;) Goto 5 Lbl 15 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP101 {1,3,0,0,2,0,1,3,1,0,0,1,0,0,1,0,0,1,0,0,0,0,1,0,3,1→⌊MP102 {1,1,1,0,1,3,1,0,0,1,0,0,0,1,3,0,1,0,0,1,1,0,0,0,1,1→⌊MP103 {1,0,0,2,1,1,0,1,2,0,0,1,1,0,1,0,0,0,1,0,3,1,0,1,1,1→⌊MP104 {0,0,1,0,0,1,2,0,0,1,0,0,1,0,2,0,1,1,0,2,1,0,0,1,0,0→⌊MP105 {1,1,3,1,0,1,0,1,1,3,1,0,1,0,1,1,3,1,0,1,0,0,1,0,0,1→⌊MP106 {1,0,0,2,0,1,0,0,1,0,1,0,0,0,0,1,0,0,0,1,0,1,0,0,1,1→⌊MP107 {1,2,1,1,0,0,1,0,2,0,1,1,2,1,0,0,1,2,1,0,2,0,0,1,3,1→⌊MP108 {1,0,3,3,1,0,0,0,1,0,0,1,0,0,1,0,0,0,1,3,1,1,0,2,0,1→⌊MP109 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP110 Listmatr(⌊MP101,⌊MP102,⌊MP103,⌊MP104,⌊MP105,⌊MP106,⌊MP107,⌊MP108,⌊MP109,⌊MP110,[A] [A]→[A] Goto M5 Lbl M5 Output(1,1,&quot;############# ############&quot;) Output(2,1,&quot;#C E #C# # # # # C#&quot;) Output(3,1,&quot;### #C# # #C # ## ##&quot;) Output(4,1,&quot;# E## #E ## # # C# ###&quot;) Output(5,1,&quot; # #E # # E ## E# # &quot;) Output(6,1,&quot;##C# # ##C# # ##C# # # #&quot;) Output(7,1,&quot;# E # # # # # # ##&quot;) Output(8,1,&quot;#E## # E ##E# #E# E #C#&quot;) Output(9,1,&quot;# CC# # # # #C## E #&quot;) Output(10,1,&quot;############# ############&quot;) Goto 5 Lbl 16 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP101 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP102 {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP103 {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP104 {0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0→⌊MP105 {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP106 {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP107 {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP108 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP109 {1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1→⌊MP110 Listmatr(⌊MP101,⌊MP102,⌊MP103,⌊MP104,⌊MP105,⌊MP106,⌊MP107,⌊MP108,⌊MP109,⌊MP110,[A] [A]→[A] Goto 8 Lbl 82 Output(1,1,&quot;############# ############&quot; For(R,2,9 Output(R,1,&quot;#&quot; Output(R,26,&quot;#&quot; End Output(5,1,&quot; &quot; Output(5,26,&quot; &quot; Output(10,1,&quot;############# ############&quot; Goto 8 Lbl 8 For(R,2,9 For(Q,2,25 If [A](R,Q)=1 Then Output(R,Q,Str2) End If [A](R,Q)=0 Then Output(R,Q,&quot; &quot;) End If [A](R,Q)=2 Then Output(R,Q,&quot;E&quot;) End If [A](R,Q)=3 Then Output(R,Q,&quot;C&quot;) End End End Goto 5 Lbl 5 0→P While 1=1 Output(Y,X,Str1) getKey→P If P=24 Then If X-1=0 Then Output(Y,X,&quot; &quot;) 26→X Output(Y,X,Str1) Goto 10 Else If [A](Y,X-1)=2 Then Output(Y,X,&quot; &quot;) X-1→X Goto 7 End If [A](Y,X-1)=3 Then Output(Y,X,&quot; &quot;) X-1→X Goto C9 End If [A](Y,X-1)=0 Then Output(Y,X,&quot; &quot;) X-1→X End End Output(Y,X,Str1) Else If P=34 Then If Y+1=11 Then Output(Y,X,&quot; &quot;) 1→Y Output(Y,X,Str1) Goto 10 Else If [A](Y+1,X)=2 Then Output(Y,X,&quot; &quot;) Y+1→Y Goto 7 End If [A](Y+1,X)=3 Then Output(Y,X,&quot; &quot;) Y+1→Y Goto C9 End If [A](Y+1,X)=0 Then Output(Y,X,&quot; &quot;) Y+1→Y End End Output(Y,X,Str1) Else If P=25 Then If Y-1=0 Then Output(Y,X,&quot; &quot;) 10→Y Output(Y,X,Str1) Goto 10 Else If [A](Y-1,X)=2 Then Output(Y,X,&quot; &quot;) Y-1→Y Goto 7 End If [A](Y-1,X)=3 Then Output(Y,X,&quot; &quot;) Y-1→Y Goto C9 End If [A](Y-1,X)=0 Then Output(Y,X,&quot; &quot;) Y-1→Y End End Output(Y,X,Str1) Else If P=26 Then If X+1=27 Then Output(Y,X,&quot; &quot;) 1→X Output(Y,X,Str1) Goto 10 Else If [A](Y,X+1)=2 Then Output(Y,X,&quot; &quot;) X+1→X Goto 7 End If [A](Y,X+1)=3 Then Output(Y,X,&quot; &quot;) X+1→X Goto C9 End If [A](Y,X+1)=0 Then Output(Y,X,&quot; &quot;) X+1→X End End Output(Y,X,Str1) End If P=105 Then Goto 1 End 1+L→L If L&gt;5 Then &quot;θ&quot;→Str1 End If L&gt;10 Then &quot;0&quot;→Str1 0→L End 0→P End End End End End End End End End</code></pre></div> 
				 	]]>
				</content:encoded>							</item>
					<item>
				<guid>http://tibasicdev.wikidot.com/forum/t-13757076#post-4781513</guid>
				<title>Bogo Sort also know as Stupid Sort.: Re: Bogo Sort also know as Stupid Sort.</title>
				<link>http://tibasicdev.wikidot.com/forum/t-13757076/bogo-sort-also-know-as-stupid-sort#post-4781513</link>
				<description></description>
				<pubDate>Thu, 24 Sep 2020 17:08:05 +0000</pubDate>
				<wikidot:authorName>byates</wikidot:authorName>				<wikidot:authorUserId>2077636</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>It is a crazy slow sort, part of the fun. The difficulty of writing the program is also part of the fun. What is scary is that even worse sorts have been invented.</p> <p>Thanks for the link.</p> 
				 	]]>
				</content:encoded>							</item>
					<item>
				<guid>http://tibasicdev.wikidot.com/forum/t-13757076#post-4781493</guid>
				<title>Bogo Sort also know as Stupid Sort.: Re: Bogo Sort also know as Stupid Sort.</title>
				<link>http://tibasicdev.wikidot.com/forum/t-13757076/bogo-sort-also-know-as-stupid-sort#post-4781493</link>
				<description></description>
				<pubDate>Thu, 24 Sep 2020 16:18:20 +0000</pubDate>
								<wikidot:authorUserId>3338172</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>It might be a challenge to do this in TI-Basic because BOGO sorting sorts with multiple lines at a time. Doing this in TI-Basic will make the calculator extremely slow, to the point where nobody would watch it complete. The best way to do this is in Assembly.</p> <p>There is a 68k version of this program for the TI-89 if you wish to look at it:<br /> <a href="https://www.ticalc.org/archives/files/fileinfo/449/44921.html">https://www.ticalc.org/archives/files/fileinfo/449/44921.html</a></p> 
				 	]]>
				</content:encoded>							</item>
					<item>
				<guid>http://tibasicdev.wikidot.com/forum/t-13757076#post-4781076</guid>
				<title>Bogo Sort also know as Stupid Sort.: Bogo Sort also know as Stupid Sort.</title>
				<link>http://tibasicdev.wikidot.com/forum/t-13757076/bogo-sort-also-know-as-stupid-sort#post-4781076</link>
				<description></description>
				<pubDate>Thu, 24 Sep 2020 01:52:08 +0000</pubDate>
				<wikidot:authorName>byates</wikidot:authorName>				<wikidot:authorUserId>2077636</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>Bogo Sort is one of the worst sorting algorithms around. But can be fun to watch run, if you are as easily amused as I am.</p> <p>For some reason I have not been able to make it work on the TI calculator I have, I blame my meds. Could some one implement it so that it shows the random version in action?</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: 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>
					<item>
				<guid>http://tibasicdev.wikidot.com/forum/t-13317277#post-4653802</guid>
				<title>Optimize a Worley Noise Program: Re: Optimize a Worley Noise Program</title>
				<link>http://tibasicdev.wikidot.com/forum/t-13317277/optimize-a-worley-noise-program#post-4653802</link>
				<description></description>
				<pubDate>Tue, 19 May 2020 15:19:02 +0000</pubDate>
								<wikidot:authorUserId>3338172</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>Other than that, that's pretty much it. Good luck on your code!</p> 
				 	]]>
				</content:encoded>							</item>
				</channel>
</rss>