Intro to ASCII-Golfing for 05AB1E (Base Conversion [Simple])
While 05AB1E isn't intended for ASCII-Art directly, I've won 2 challenges with it. The best thing about 05AB1E is that, even with the simple base conversion there's often tricks you can use to extend and even halve your byte-count. Often in ASCII challenges there are repitition tricks you can utilize to only draw half the pattern then flip and concatenate. If it's a four way pattern you can do things like zip and bifurcate to only draw a corner of the pattern. There's plenty of data-structure manipulation techniques to use in conjunction with this simple base compression idea.
Here's a quick crash-course on a base conversion tactic:
In 05AB1E I enumerate all of the characters used in the ASCII-art, for instance:
--===___===--
Would result in:
-
=
_
I then assign them numbers starting with 1 then 0 then 2:
- is 1.
= is 0.
_ is 2.
I replace the characters in the original string with the numbers:
1122200022211
I convert to decimal using the lowest possible base (3):
879412
(How to do this using 05AB1E)
I then convert it to base 214:
Jh]
(How to do this using 05AB1E)
I then wrap it in the following code:
•Jh]•3B…102…-_=‡
Try it online!
Or try it with intermediate steps displayed.
Final explained:
•Jh]• # Push the compressed ASCII integer.
3B # Convert it to base 3.
…102 # Push the keys to the conversion.
…-_= # Push the values to the conversion.
‡ # Transliterate, replace 0, 1 and 2 with the symbols.
Now, with this specific challenge the string is so short it doesn't make sense to do. I'd probably just push half the string and Palindromize for 10 bytes "--===__"û
or golf it like Adnan did in the comments using factorial, smart man •Jh]•3B5!…-=_‡
. He's also (one of?) the creator (s?) of 05AB1E.
More complex example:
https://codegolf.stackexchange.com/a/106621/59376
Also, maybe try Dennis' kolmogorov-complexity language: Bubblegum; no idea how to use this.