Obfuscated Code

[nitacku]

I while ago I had read a post where someone came up with the idea of having an obfuscated code topic.
So... I figured I'd bring it to life :)

Here's my obfuscated code example.
Actually, now that I look at it, it's more of a compression/decompression technique...

[Galandros]

wtf, I think ASM obfuscated code is more simple than that.

[Trogdorgar]

Yeah man lol, right now, with the change you displayed, it's pretty much fully optimized as it is, as far as i know

[bananaman]

I typed that into my calculator and was pleasantly surprised. I never would have guessed what it would have done.

We should make people learn how to do this for their very first basic program.

[ticalcnoah]

Impressive how does it work?

[nitacku]

It's actually pretty simple. Breaking the characters down into pixels, one can find some similarities. Each character is comprised of a group of pixel combinations, creating total of 7 different pixel combinations in all. By assigning each character a number based on the pixel combinations that comprise it, encoding a graphical representation of a phrase becomes as easy as storing numbers to an array.

Here is a graphical representation of what each digit translates to:


In the original code, the list becomes:
{14441, 13333, 16666, 16666, 15551, 16161, 15551, 17777, 16666, 15552}
Using the pixel chart, one can translate the meaning of the numbers.
14441 = H
13333 = E
16666 = L
15551 = O
16161 = W
17777 = R
15552 = D

As for how the numbers are turned into graphical data, through boolean logic of course. This list: {fPart(Ans/2),Ans<3,Ans<5,Ans<3,Ans≠2 and Ans≠4 and Ans≠7} is what turns each digit into pixel data. For example, if Ans is 3, the list becomes {1, 0, 1, 0, 1}. If you cycle through this list, displaying a pixel/point when the value equals 1, you can graph each pixel combination. Currently, only 7 pixel combinations are defined, but adding new ones in order to support different characters is easy to do. Just add more conditionals to the boolean list to produce the correct result. There is one drawback though, since each pixel combination is represented by a single digit, the current method only supports 9 pixel combinations. To support up to 99 combinations, 2 digits instead of 1 would have to be used to define each combination. With a few minor tweaks, this can be easily achieved.

[Weregoose]

"int(NfPart((X[font="verdana"]²+1)/N→Y1
"gcd(N,abs(max([font="times new roman"]∆

[woodswolf]

It would be nice if someone tweaked the code for 3x5 tokens, since those are more natural. I like the code. It was totally unsuspected!

[TI-newb]

Nitacku, you never cease to amaze me XD

[ticalcnoah]

[woodswolf]

wooooow, the immense speed of the calculation!
Can someone explain?

EDIT: it appears to not give the smallest divisor!
8! should have 2 as an answer, but it says 21

[Weregoose]

sum(L1=median(L1→X
max(not(fPart(prod(2L1+1-7(L1=4))/{210,770,2002
Ans+6not(AnsfPart(2variance(L1
If X=3:2+(2=sum(L1=max(L1not(L1=median(L1
If X>3:X
sub("S3H4YCL",Ans,1

[GloryMXE7]

-if there are less than three occurrences of the list's median value : ans will equal "s","c", or"l"
-if there are more than three occurences : ans will equal "4","y","c", or "l" depending the number of occurences
-if there are exactly 3 occurences
--and exactly 2 occurrences of the list's maximum value : ans will equal "h"
--but if there is not exactly 2 occurrences of the max : ans will equal "3"

[Weregoose]

That's all about half right.

Any guesses as to what this is for?

[GloryMXE7]

[Weregoose]

[nitacku]

Create two programs (A & B).
Call program B like so: Z:prgmB, where Z is a positive integer

PROGRAM:A
While Ans
Ans→X
θAns→θ
X-1:prgmA

PROGRAM:B
Ans→X
1→θ
X:prgmA:θ

All program B does is initialize θ to 1.
If you do this manually, then only program A is needed and can be called the same way as program B.

While this code may not necessarily be obfuscated, it does demonstrate a method of recursion

[ztrumpet]

All I see is a memory leak.

[nitacku]

Memory that is used when calling the program from within the program is released.
However, memory used for the While loop is not.
So there is a memory leak, but this code is simply to demonstrate recursion in ti-basic.

As to the function, the code actually calculates the factorial of Ans and returns the result in Ans.

I tried to find method for implementing branching recursion (which is useful for calculating the Fibonacci sequence), but I wasn't able to find one since Ans is changed for all branches, not just the immediate branch. Variables are no use either since they suffer the same problem as Ans. A list could be used, but that sort of defeats the purpose of using recursion.

[Ed H]

Is recursion ever a good idea in TI-BASIC?