- 10 Oct 2016 11:10:01 am Permalink
- Last edited by lirtosiast on 10 Oct 2016 08:21:33 pm; edited 1 time in total

For the dragon fractal challenge, this is 69 bytes, though I don't take credit since I started with Weregoose's 81-byte program. Still not jacobly's 66, but I think there's something in the fourth line to cut down.

Setup to roughly match jacobly's first pic is AxesOff:ZStandard:ZInteger:9->I:2->S:1->D:-12->X:-16->Y.

Counting the number of carries in an addition is 19 bytes if the addends are positive integers in A and B:

EDIT: I'm probably missing something obvious, but I still can't get 66. I concede.

**Code:**```
X+Yi
```

For(A,0,2^I-1

Ans->Z

D-A/2^sum(not(fPart(A/2^randIntNoRep(1,I->D

Z+Si^D

Line(real(Z),imag(Z),real(Ans),imag(Ans

End

Setup to roughly match jacobly's first pic is AxesOff:ZStandard:ZInteger:9->I:2->S:1->D:-12->X:-16->Y.

Counting the number of carries in an addition is 19 bytes if the addends are positive integers in A and B:

**Code:**```
10^(-randIntNoRep(1,99
```

sum(int(fPart(AAns)+fPart(BAns

EDIT: I'm probably missing something obvious, but I still can't get 66. I concede.