How low can you go?

Forum Attachments

Summary:

Please optimize for speed and size.

How low can you go?

Trenly 27 Jan 2015 05:32

Michael2 found this program, can we optimize it?

PROGRAM:FERN

:0→Xmin
:50→Xmax
:10→Xscl
:0→Ymin
:50→Ymax
:10→Yscl
:ClrDraw
:25→A
:A→B  //a bit faster to copy variables then to assign them
:0→J
:Disp “START (X, Y)”
:Input "ENTER X:", C  //saved a few bytes by compressing to one line each
:Input "ENTER Y:", D
:Lbl 1
:8(A+D) 1→U   //is the space here supposed to be a plus sign?
:16(B+C)+20→V
:Pt-On(U, V)
:rand→Z
:0.85→R
:R→S   //save a few bytes due to less tokens
:-0.0436→A
:A→B
:1→K
:If Z<0.005
:Goto 2
:If Z<0.1025
:Goto 3
:If Z<0.2
:Goto 4
:Lbl 5
:RCcos(A) SDsin(B)→E  //still functions. Saves a few tokens and increases speed
:RCsin(A)+SDcos(B)+K→F
:E→C
:F→D
:J+1→J
:If J<10000
:Goto 1
:End
:Lbl 2
:0→R
:0.16→S
:R→A
:R→B
:R→K
:Goto 5
:Lbl 3
:0.3→R
:0.34→S
:0.8552→A
:A→B
:1.6→K
:Goto 5
:Lbl 4
:0.3→R
:0.37→S
:2.0944→A
:-0.8552→B
:0.44→K
:Goto 5
:End

Re: How low can you go?

jonbush 27 Jan 2015 06:01

Remove the zeroes in front of the decimal points. Use Ans when storing the same value to several variables:

:0→R
:0.16→S
:R→A
:R→B
:R→K

to

.16→S
0→R
Ans→A
Ans→C
Ans→K

Or if you wanted to save space while sacrificing speed:

.16→S
Delvar RDelvar ADelvar CDelvar K

Re: How low can you go?

Timtech 27 Jan 2015 12:29

So,

Delvar RDelvar ADelvar CDelvar K.16→S

Re: How low can you go?

(account deleted) 27 Jan 2015 23:07

Last edited on 01 Apr 2021 12:26 by (account deleted) Show more

Re: How low can you go?

Timtech 27 Jan 2015 12:31

Bytes saved = 2 + 1 + 1 + 1 + 2 + 10 = 17

We can change

:RCcos(A)+SDsin(B)→E
:RCsin(A)+SDcos(B)+K→F

can be saved by two bytes:

:RCcos(A)+SDsin(B→E
:RCsin(A)+K+SDcos(B→F

Some more minor optimizations (remove all those zeroes as jon mentioned, by the way):

:Pt-On(U, V)
can be
:Pt-On(U, V
and
:Disp "START (X, Y)"
can be
:Disp "START (X, Y)

Another one:

:0→J
:Disp "START (X, Y)"
can be
:DelVar JDisp "START (X, Y)

Two more bytes here:

:8(A+D)+1→U
:16(B+C)+20→V

Rearrange to save:

:1+8(A+D→U
:20+16(B+C→V

As I mentioned earlier:

:0→R
:0.16→S
:R→A
:R→B
:R→K

can be shortened to save ten bytes:

Delvar RDelvar ADelvar CDelvar K.16→S

Last edited on 27 Jan 2015 12:43 by Timtech Show more

Re: How low can you go?

(account deleted) 28 Jan 2015 01:14

Last edited on 01 Apr 2021 12:27 by (account deleted) Show more

Re: How low can you go?

Michael2_3B 28 Jan 2015 04:24

Not a big optimization, but you can save 1 byte by shortening

:For(J,0,1E4

to

:For(J,0,E4   //little E

Re: How low can you go?

Michael2_3B 27 Jan 2015 15:28

I actually found this program online at the beginning of this school year, but I have since deleted it from my calculator. I did have it working then, but now when I try it, it doesn't work. What I am trying to do is guess what is supposed to be in those empty spaces in some of those lines. Can anyone help me fix this program so that it works properly? I know it's supposed to draw the fern on its side(so that the stem is towards xmin and all the branches/leaves on the fern are towards xmax)

Re: How low can you go?

Timtech 27 Jan 2015 23:02

Pretty sure those spaces should be + signs.

Re: How low can you go?

Michael2_3B 28 Jan 2015 02:08

Most of the pixels are being drawn at about 18 and 19 Y (using earthnites optimized version), so I'm not sure. Trying to figure out the problem in the code is - can anyone see where something might be wrong? I'm pretty sure its supposed to draw it from xmin to xmax, and the fern leaf kind of curves down towards ymin so that the tip of it is at xmax and ymin.

Re: How low can you go?

(account deleted) 28 Jan 2015 03:06

Last edited on 01 Apr 2021 12:27 by (account deleted) Show more

Re: How low can you go?

12Me21 29 Jan 2015 16:10

It might be better to just rewrite the code from scratch:

while 1
100rand→ P
(.85X+.85Y)(P>1 and P≤86)+(.2X-.26Y)(P>86 and P≤93)+(-.15X+.28Y )(P>93) → S
(0.16Y)(P≤1)+(-.04X+.85Y+1.6)(P>1 and P≤86)+(.23X+.22Y+1.6)(P>86 and P≤93)+(.26X+.24Y+.44)(P>93) → T
PT-On(S,T
S→ X
T→ Y
end

(I probably made a bunch of mistakes while typing this)

203 bytes!

Last edited on 29 Jan 2015 16:18 by 12Me21 Show more

Re: How low can you go?

12Me21 29 Jan 2015 16:26

You could also change the numbers that you multiply x and Y by, and change the number you add to them, like this:
http://www.chradams.co.uk/fern/maker.html

Re: How low can you go?

Michael2_3B 29 Jan 2015 16:50

What window size are you using? The same as the original program?

Re: How low can you go?

12Me21 29 Jan 2015 19:56

Oh, sorry, forgot to say:
-3 Xmin
4 Xmax
0 Ymin
11Ymax

Re: How low can you go?

Michael2_3B 29 Jan 2015 21:43

Btw, you should also initialize X and Y first before starting the main loop.

Re: How low can you go?

12Me21 30 Jan 2015 00:04

It doesn't really matter what X and Y are, since it always makes the same pattern, and it uses Pt-on, so It can't give any errors if the coordinates start off screen. It may generate 1 or 2 out-of-place points at the beginning, but after that it should be fine.

Re: How low can you go?

Michael2_3B 29 Jan 2015 21:53

What kind of fractal are you going for? It just looks like a messy kind of tree with no pattern at all…

For fractals, wouldn't it be better to use sine and cosine?

Re: How low can you go?

12Me21 30 Jan 2015 00:02

you have to wait a really long time, like about 5-10 minutes, before you can see the pattern

Re: How low can you go?

Michael2_3B 30 Jan 2015 01:09

I've been running it for over half an hour no and I still don't see much of a pattern…

Re: How low can you go?

12Me21 30 Jan 2015 02:06

hmm… I might have typed it wrong… you can check if the numbers are right here: http://en.wikipedia.org/wiki/Barnsley_fern
thats where I got them.

Can you post a screenshot?

Re: Screenshot?

Michael2_3B 30 Jan 2015 23:02

After running it for about half an hour to an hour or so, here's what it looks like:

Last edited on 31 Jan 2015 00:40 by Michael2_3B Show more

Re: Screenshot?

jonbush 31 Jan 2015 07:47

If you squint to the point of closing your eyes, you can almost see it.

Re: Screenshot?

Michael2_3B 01 Feb 2015 04:40

…still can't see a pattern

Re: Screenshot?

12Me21 03 Feb 2015 16:40

I must have typed it wrong

Re: Screenshot?

(account deleted) 03 Feb 2015 23:06

Last edited on 01 Apr 2021 12:28 by (account deleted) Show more

Fixed ( I hope)

12Me21 04 Feb 2015 16:20

… I did…

oh, I forgot to say which -'s were minus signs and witch were negitives:

while 1
100rand→ P
(.85X+.85Y)(P>1 and P≤86)+(.2X-.26Y)(P>86 and P≤93)+(^-.15X+.28Y)(P>93) → S
(0.16Y)(P≤1)+(^-.04X+.85Y+1.6)(P>1 and P≤86)+(.23X+.22Y+1.6)(P>86 and P≤93)+(.26X+.24Y+.44)(P>93) → T
PT-On(S,T
S→ X
T→ Y
end

all of the normal -'s are minus's, and the tiny ones (^-) are negative signs

Last edited on 04 Feb 2015 16:35 by 12Me21 Show more

Re: How low can you go?

Silver Phantom 29 Jan 2015 22:09

i wonder if we can remove all the decimals and turn that 1.6 into a 160 and do Pt-On(sub(S),Sub(T

---

The Silver Phantom welcomes you

Re: How low can you go?

Michael2_3B 29 Jan 2015 22:40

Or
Pt-On(S_E-2,T_E-2 //scientific E
For OS versions below 1.15

Re: How low can you go?

Timtech 04 Feb 2015 01:43

True, sub( is two bytes anyway. Instead of E-2 also /E2 would work

RANDOMGUEST (guest) 27 Feb 2015 13:42

I wonder if you can optimize this code? I've optimized it as much as I can. It's a Tower of Hanoi solver.

PROGRAM:TOHSOLVE
Repeat A>=1 and A<=16
Input "NO. OF RINGS? ",A
End
List>matr(seq(R,R,1,A),[C]
{A+1,3->dim([C]
[[1,2][1,3][2,3->[E]
A+1
{1,Ans,Ans->L1
Delvar R Clrhome
"ABCDEFGHIJKLMNOP->Str0
Disp sub(Ans,1,A
For(M,2,2^A
R+1-R(R=3->R
[E](Ans,2
[C](L1(Ans),Ans->J
[E](R,1
[C](L1(Ans),Ans
J and J<Ans or not(Ans ->J
[E](R,Ans+1->B
L1(Ans->I
Output(B,Ans," \\One space
[C](Ans,B->C
I+1->L1(B
[E](R,2-J ->B
L1(AN

RANDOMGUEST (guest) 27 Feb 2015 13:43

WHOOP

RANDOMGUEST (guest) 27 Feb 2015 13:43

WHOOPS!

L1(AN

RANDOMGUEST (guest) 27 Feb 2015 13:45

WHOOPS!

L1(Ans ->I
C->[C](Ans-1,B
I-1->L1(B
Output(B,Ans,sub(Str0,C,1
End

There we go.

RANDOMGUEST (guest) 27 Feb 2015 13:46

PROGRAM:TOHSOLVE
Repeat A>=1 and A<=16
Input "NO. OF RINGS? ",A
End
List>matr(seq(R,R,1,A),[C]
{A+1,3->dim([C]
[[1,2][1,3][2,3->[E]
A+1
{1,Ans,Ans->L1
Delvar R Clrhome
"ABCDEFGHIJKLMNOP->Str0
Disp sub(Ans,1,A
For(M,2,2^A
R+1-R(R=3->R
[E](Ans,2
[C](L1(Ans),Ans->J
[E](R,1
[C](L1(Ans),Ans
J and J<Ans or not(Ans ->J
[E](R,Ans+1->B
L1(Ans->I
Output(B,Ans," \\One space
[C](Ans,B->C
I+1->L1(B
[E](R,2-J ->B
L1(Ans ->I
C->[C](Ans-1,B
I-1->L1(B
Output(B,Ans,sub(Str0,C,1
End

Re: How low can you go?

TI-GBR 27 Feb 2015 13:49

I'm not sure, but you might want to start a new thread.

RANDOMGUEST (guest) 28 Feb 2015 16:46

Thanks. I'll try that.

By the way, I didn't come uip with this code myself. I optimize code I found on Rosetta Code.

And slashed the byte count in half. WOOOOHHHOOOOOOOOOOOO!!!