The Nineteenth Byte

Sherlock9

7:00 PM

30

Q: Why is "pineapple" in English but "ananas" in all other languages?

Why is "pineapple" in English but "ananas" in all other languages?

trichoplax

It's not ananas in all other languages.

Sherlock9

It's nanas in Indonesian, it's piña (as in piña colada) and ananás in Spanish (source: see above link), but in English: pineapple

trichoplax

pynappel in Afrikaans

Sherlock9

Fair enough

trichoplax

I wonder if English got it from there or the other way around?

Cᴏɴᴏʀ O'Bʀɪᴇɴ

7:03 PM

other way around

:P

Maltysen

yeah, pine apple

VTCAKAVSMoACE

huh

anuses and pineapples should never be close nor related

trichoplax

I heard it was a corruption of "pain apple" because of the pain in the tongue from eating too much of it

TimmyD

@CᴏɴᴏʀO'Bʀɪᴇɴ PowerShell, 74 bytes $args|%{while('1'*++$i-notmatch'^(?!(..+)\1+$)..'){}$j*="$i*"*$_+1|iex};$j

VTCAKAVSMoACE

Anybody remember the fruit and the cannibals joke?

Cᴏɴᴏʀ O'Bʀɪᴇɴ

7:04 PM

@TimmyD o_O is the prime finding regex the shortest way to do it?

New Main Posts

2

Q: Discrete Convolution or Polynomial Multiplication

Given two lists of integers, your submission should calculate and return the discrete convolution of the two. Interestingly, if you consider the list elements as coefficients of polynomials, the convolution of the two lists represents the coefficients of the product of the two polynomials. Defin...

code-golf math array-manipulation number-theory polynomials

zyabin101

@VTC Status Vitsy?

TimmyD

May 13 at 12:39, by TimmyD

VTCAKAVSMoACE

@zyabin101 Discontinued until further notice.

zyabin101

@VTCAKAVSMoACE D: Why?

TimmyD

7:05 PM

@CᴏɴᴏʀO'Bʀɪᴇɴ Yeah. Anything else is going to be a Sieve or buried under [math]::Function() calls

VTCAKAVSMoACE

@zyabin101 For Laura.

zyabin101

DD:

VTCAKAVSMoACE

After I finalize Laura to a stable point, Vitsy will get regular updates again

Cᴏɴᴏʀ O'Bʀɪᴇɴ

@TimmyD wow. how do you use it to generate primes with it?

@VTCAKAVSMoACE who is laura? o_O

VTCAKAVSMoACE

@CᴏɴᴏʀO'Bʀɪᴇɴ This.

Sherlock9

7:06 PM

@VTCAKAVSMoACE Nope

Cᴏɴᴏʀ O'Bʀɪᴇɴ

@VTCAKAVSMoACE runs code

VTCAKAVSMoACE

@CᴏɴᴏʀO'Bʀɪᴇɴ ಠ_ಠ

TimmyD

@CᴏɴᴏʀO'Bʀɪᴇɴ It requires input in unary, so I dynamically construct a string of '1' multiplied by ++$I ... on the very first pass, $I is null (aka zero), so that pre-increments to 1 and away we go

VTCAKAVSMoACE

Three men who were lost in the forest were captured by cannibals. The cannibal king told the prisoners that they could live if they pass a trial.

The first step of the trial was to go to the forest and get ten pieces of the same kind of fruit. With that, the three men went their separate ways to gather fruits.

The first one came back and said to the king, "I brought ten apples."

The king then explained the trial to him. "You have to shove the fruits up your butt without any expression on your face or you'll be eaten."

10

Cᴏɴᴏʀ O'Bʀɪᴇɴ

@TimmyD hm. interesting.

TimmyD

7:07 PM

whoops

missed my $j initialization

it needs a $j=1 at the front, else $j*=... will always be zero

Sherlock9

@VTCAKAVSMoACE XD

TimmyD

79 bytes ... $j=1;$args|%{while('1'*++$i-notmatch'^(?!(..+)\1+$)..'){}$j*="$i*"*$_+1|iex};$j‌

The regex as a prime generator (simply wrapped in a for loop) --

PS C:\Tools\Scripts\golfing> for(){while('1'*++$i-notmatch'^(?!(..+)\1+$)..'){}$i}
2
3
5
7
11
13
17
19
23
29
...

Cᴏɴᴏʀ O'Bʀɪᴇɴ

ah

zyabin101

@VTCAKAVSMoACE You HAVE to put it up in a book.

TimmyD

The main benefit to that method is it's an unbounded generator. Whereas a Sieve, you'd need an upper bound, so we'd have to have additional logic to figure out the input's upper bound.

VTCAKAVSMoACE

7:19 PM

@zyabin101 Not my joke. That's why I wondered if others had heard it.

zyabin101

> Not my joke

Then where did you find it?

TimmyD

I think the best Sieve I've seen is somewhere around 90 bytes

Maltysen

@VTCAKAVSMoACE yeah, I 've heard it before a little different

VTCAKAVSMoACE

@zyabin101 I heard it at some point. ¯\_(ツ)_/¯

Bald Bantha

@zyabin101 ^^

TimmyD

7:20 PM

(in PowerShell, that is)

zyabin101

@Maltysen Where?

Sherlock9

Is there an API query to search for downvoted PPCG questions? I want to find an old question and all I remember about it was that it was downvoted and the writer left in a huff

zyabin101

@Sherlock9 With a negative score?

Sherlock9

Yeah

Maltysen

@zyabin101 friend

TimmyD

7:21 PM

@Sherlock9 You could just sort questions by votes and go to the last page?

Nathan Merrill

@Sherlock9 you don't remember anything else?

zyabin101

You can use the data explorer to query the data dump.

trichoplax

@Sherlock9 It wasn't the user who wrote a meta post about leaving?

Sherlock9

Not really. I know the question writer was from elsewhere on PPCG

@trichoplax Could be

It was a pretty big huff IIRC

Nathan Merrill

better question: if that is all you remember, then why do you care?

there's got to be some other information that is linked to that question

Sherlock9

7:24 PM

Because I feel bad for the guy and that his question kind of got torn apart

And I wanted to look at his question and see if it was worth salvaging

Nathan Merrill

how long ago was this question?

was it simply the size of his "huff" that made it memorable?

trichoplax

Do you remember if it was a golf?

Sherlock9

Two months ago, I think. And we were kind of tearing it apart like we do many non-sandboxed posts and he got quite offended. He might have made a meta post about it, let me check

trichoplax

The meta post about leaving was in September so you're probably thinking about someone different

2 months ago, 10 questions per day - that should only be 60 questions to sift through... :)

Oh wait - 600...

Nathan Merrill

-19

Q: It's 2015 where's my hoverboard!

Make a program that prints out: "Back to the Future" (no quotes). The source code must contain "It's 2015 where's my hover-board!" over and over again, with a minimum of extra characters and syntax. No other words should appear in the program. Exact spelling, caps, punctuation, etc, of this phra...

popularity-contest

trichoplax

7:29 PM

Who upvoted this??? — Jan Dvorak Jan 12 '15 at 18:23

Eᴀsᴛᴇʀʟʏ Iʀᴋ

@VTCAKAVSMoACE bash for you:

while sleep 10;do fortune -o >> t.txt; echo -e "\n\n" >> t.txt; done

zyabin101

@EᴀsᴛᴇʀʟʏIʀᴋ What does it do? :3

VTCAKAVSMoACE

@EᴀsᴛᴇʀʟʏIʀᴋ ∞ offensive fortune! \o/

Nathan Merrill

-73

Q: Single layer neural network

For the implementation of single layer neural network, I have two data files. In: 0.832 64.643 0.818 78.843 Out: 0 0 1 0 0 1 The above is the format of 2 data files. The target output is "1 for a particular class that the corresponding input belongs to and "0 for the remainin...

matlab artificial-intelligence classification perceptron

Eᴀsᴛᴇʀʟʏ Iʀᴋ

@zyabin101 what he said

zyabin101

7:32 PM

@Sherlock9 Basic query for posts with negative score sorted by DATE.

Nathan Merrill

actually, that question can be beat:

-268

Q: A New Code License: The MIT, this time with Attribution Required

Update: January 15, 2016 Thank you for your patience and feedback. We're going to delay the implementation for now - we'll be back soon to open some more discussions. Important context for those arriving from reddit and slashdot links: The status quo is not "public domain"; attribution i...

discussion licensing feedback creative-commons

Most downvoted post in all of SE, I believe

VTCAKAVSMoACE

@NathanMerrill Dam son

Cᴏɴᴏʀ O'Bʀɪᴇɴ

what is +/-?

Eᴀsᴛᴇʀʟʏ Iʀᴋ

but 103 stars?

@CᴏɴᴏʀO'Bʀɪᴇɴ +167

Sherlock9

Actually, if I remember the username correctly, he might have come back to PPCG and thus I should probably not continue this. Let me do a little more digging though

VTCAKAVSMoACE

7:33 PM

Cᴏɴᴏʀ O'Bʀɪᴇɴ

@EᴀsᴛᴇʀʟʏIʀᴋ huh

zyabin101

I'll make a more flexible query with search narrowing by tag tomorrow.

Sherlock9

Thanks. And username if you can. I might recognize that

VTCAKAVSMoACE

wao fif star so wow

Sherlock9

Hm, it might have been his first (and possibly last) question on here too

Dagnabbit. I wish I remembered more

zyabin101

7:38 PM

@Sherlock9 Okay.

Sherlock9

Thanks a bunch for the help, everyone :D

I should really get to studying while I can. Goodnight

Eᴀsᴛᴇʀʟʏ Iʀᴋ

@VTCAKAVSMoACE I am a convert....

VTCAKAVSMoACE

@EᴀsᴛᴇʀʟʏIʀᴋ wat

zyabin101

@EᴀsᴛᴇʀʟʏIʀᴋ wat

Eᴀsᴛᴇʀʟʏ Iʀᴋ

@VTCAKAVSMoACE to the glory of fortune

I let it run for a while without the -o switch, and then read them all.

@VTCAKAVSMoACE is there a way to specify not -o?

Cᴏɴᴏʀ O'Bʀɪᴇɴ

7:48 PM

-!o?

HII

HAI

HUI

I want to program something but I don't know what. :/

Ideas?

Eᴀsᴛᴇʀʟʏ Iʀᴋ

Array parsing for cheddar.

@Downgoat

zyabin101

7:55 PM

@Bálint Deadfish or Brainfuck or 3var in your favorite lang.

zyabinVI has Deadfish in Python right now.

TimmyD

@Bálint codegolf.stackexchange.com/questions?sort=unanswered

Cᴏɴᴏʀ O'Bʀɪᴇɴ

@Bálint chat.stackexchange.com/…

zyabin101

And is going to have a blog soon.

Cᴏɴᴏʀ O'Bʀɪᴇɴ

\o/

Eᴀsᴛᴇʀʟʏ Iʀᴋ

@CᴏɴᴏʀO'Bʀɪᴇɴ wai list no on cergos

PhiNotPi

7:57 PM

@mınxomaτ Now I"m brute-forcing controlled gates.

Cᴏɴᴏʀ O'Bʀɪᴇɴ

FINALS

Bálint

I try brainfuck in JS

Eᴀsᴛᴇʀʟʏ Iʀᴋ

@CᴏɴᴏʀO'Bʀɪᴇɴ IK

Cᴏɴᴏʀ O'Bʀɪᴇɴ

compile BF to js

Eᴀsᴛᴇʀʟʏ Iʀᴋ

But didn't just already study?

@CᴏɴᴏʀO'Bʀɪᴇɴ o_O

Cᴏɴᴏʀ O'Bʀɪᴇɴ

7:58 PM

Ik

PhiNotPi

That's not actually that hard.

The reverse is much harder.

Cᴏɴᴏʀ O'Bʀɪᴇɴ

ik

:3

Bálint

@PhiNotPi It's impossible pretty much

Cᴏɴᴏʀ O'Bʀɪᴇɴ

if not impossible

(mostly)

New Main Posts

-1

Q: Encryption and Decryption using 2*2 Matrix by modulus 26

if user input a password a-z it will store as a=0 b=1 c=2 . z=26 and make them in matrix now we take any 2*2 matrix as a key and multiply with user input password which is now stored in form of matrix this is encryption now decry-pt this code using modulus 26 approach http://crypto.interactiv...

encryption

Bálint

8:11 PM

How big is the maximum sized array in javascript?

PhiNotPi

@mınxomaτ Controlled-Hadamard: SHTCtHs (where lowercase signifies the "dagger" and the C is the CNOT gate).

Cᴏɴᴏʀ O'Bʀɪᴇɴ

@Bálint large

PhiNotPi

Compare that to their version.

Cᴏɴᴏʀ O'Bʀɪᴇɴ

@Bálint why?

Bálint

I'm implementing brainfuck, and the size of the tape is not specified on the esolang wiki

VTCAKAVSMoACE

8:13 PM

lol

Eᴀsᴛᴇʀʟʏ Iʀᴋ

@Bálint 256?

@VTCAKAVSMoACE >_> y u do this

VTCAKAVSMoACE

@EᴀsᴛᴇʀʟʏIʀᴋ Without -o, it never outputs offensive.

Eᴀsᴛᴇʀʟʏ Iʀᴋ

you leave/come/leave/come like 5 times in a row

@VTCAKAVSMoACE oh cool

Cᴏɴᴏʀ O'Bʀɪᴇɴ

@Bálint it's 30000

Eᴀsᴛᴇʀʟʏ Iʀᴋ

oh, TIL

Bálint

8:14 PM

@CᴏɴᴏʀO'Bʀɪᴇɴ Thanks

Cᴏɴᴏʀ O'Bʀɪᴇɴ

np

PhiNotPi

Eᴀsᴛᴇʀʟʏ Iʀᴋ

@CᴏɴᴏʀO'Bʀɪᴇɴ you never did anything with SeraisToi?

Cᴏɴᴏʀ O'Bʀɪᴇɴ

I never got around

Eᴀsᴛᴇʀʟʏ Iʀᴋ

okay

And jolf quine?

Cᴏɴᴏʀ O'Bʀɪᴇɴ

8:18 PM

q

2

A: Golf you a quine for great good!

Jolf, 4 bytes Q«Q« Q double (string) « begin matched string Q« capture that This transpiles to square(`Q«`) (I accidentally did string doubling in the square function), which evaluates to Q«Q«. Note that q is the quining function in Jolf, not Q ;).

Eᴀsᴛᴇʀʟʏ Iʀᴋ

@CᴏɴᴏʀO'Bʀɪᴇɴ wtf is this....

nvm

Cᴏɴᴏʀ O'Bʀɪᴇɴ

@EᴀsᴛᴇʀʟʏIʀᴋ didn't you read the readme? :p

Eᴀsᴛᴇʀʟʏ Iʀᴋ

yeah, but wtf did you do to that code

>_> need a better implementation then defining each number individually.

nice readme though

Cᴏɴᴏʀ O'Bʀɪᴇɴ

thanks XD

that's the point

I want to get it on code review :3

jk

muddyfish

That looks amazing

Why?

Eᴀsᴛᴇʀʟʏ Iʀᴋ

8:26 PM

>_>

@CᴏɴᴏʀO'Bʀɪᴇɴ r/programminghorror

Cᴏɴᴏʀ O'Bʀɪᴇɴ

?

Eᴀsᴛᴇʀʟʏ Iʀᴋ

can I post to reddit r/programminghorror?

Cᴏɴᴏʀ O'Bʀɪᴇɴ

sure

Eᴀsᴛᴇʀʟʏ Iʀᴋ

That is where awful/disturbing code goes.

Cᴏɴᴏʀ O'Bʀɪᴇɴ

just link me

and link the repo in the thing

Eᴀsᴛᴇʀʟʏ Iʀᴋ

8:27 PM

@CᴏɴᴏʀO'Bʀɪᴇɴ >_> I may have already done it.

And no, reddit says anonymity.

Cᴏɴᴏʀ O'Bʀɪᴇɴ

aw

Eᴀsᴛᴇʀʟʏ Iʀᴋ

But past.ee is.

@CᴏɴᴏʀO'Bʀɪᴇɴ sorry.

Cᴏɴᴏʀ O'Bʀɪᴇɴ

it's okay XD

link me to the thingy

Eᴀsᴛᴇʀʟʏ Iʀᴋ

reddit.com/r/programminghorror/comments/4jn45t/…

@CᴏɴᴏʀO'Bʀɪᴇɴ i'm really sorry about that. You want me to delete and you repost?

Cᴏɴᴏʀ O'Bʀɪᴇɴ

no

I don't have reddit

Bálint

8:29 PM

Please tell me you did that with a generator

Eᴀsᴛᴇʀʟʏ Iʀᴋ

idk

@CᴏɴᴏʀO'Bʀɪᴇɴ ?

Cᴏɴᴏʀ O'Bʀɪᴇɴ

@Bálint I did.

Eᴀsᴛᴇʀʟʏ Iʀᴋ

oh good

@VTCAKAVSMoACE can i borrow your teacher?

Cᴏɴᴏʀ O'Bʀɪᴇɴ

XD

zyabin101

@CᴏɴᴏʀO'Bʀɪᴇɴ Which repo?

Cᴏɴᴏʀ O'Bʀɪᴇɴ

8:31 PM

github.com/ConorOBrien-Foxx/OrdinalJS

Bálint

@CᴏɴᴏʀO'Bʀɪᴇɴ That's an amazing...util I guess, 15/10

Cᴏɴᴏʀ O'Bʀɪᴇɴ

XD thanks

Bálint

At least as useful as JQuery

Cᴏɴᴏʀ O'Bʀɪᴇɴ

just about a bit more

Bálint

Why would I write array[777], when I can write array.seven_hundred_seventy_seventh

trichoplax

8:36 PM

Is it 1 indexed?

Otherwise I'd write array.seven_hundred_seventy_eighth...

TimmyD

array.seven_hundred_seventy_seventh_plus_one

trichoplax

Now the word eighth looks wrong. How's there a hard t without it being eightth?

PhiNotPi

@mınxomaτ I also really screwed up the sqrt(T) gate.

VTCAKAVSMoACE

@CᴏɴᴏʀO'Bʀɪᴇɴ I replied to your Laura issue.

Cᴏɴᴏʀ O'Bʀɪᴇɴ

I see

mınxomaτ

8:39 PM

@PhiNotPi How so (I didn't look at it yesterday)?

PhiNotPi

In the process of the controlled Hadamard, I realized that I needed more samples points on the sphere to make sure that it was actually rotating properly.

So my solution worked identically to theirs for the provided input, but fails on others.

TimmyD

@trichoplax Eighth is just a weird word in general

trichoplax

I wonder how screen readers pronounce it

Poke

OrdinalJS is a treasure.

Cᴏɴᴏʀ O'Bʀɪᴇɴ

:D

XD

Poke

8:44 PM

It's really the array.last that makes it a true gem.

Just wouldn't feel complete without it.

related: search.cpan.org/~dconway/Lingua-Romana-Perligata-0.50/lib/…

Cᴏɴᴏʀ O'Bʀɪᴇɴ

that's great

Bálint

Now, create a util, wich allows you to access array elements using greek numerals

Or with roman numerals

Or with unary numbers.

array[10]->array.0000000000

Cᴏɴᴏʀ O'Bʀɪᴇɴ

all of them :p

Nathan Merrill

lets say you are able to move stickers around on a rubicks cube

how many distinct rubicks cubes are there?

Cᴏɴᴏʀ O'Bʀɪᴇɴ

1

Nathan Merrill

8:53 PM

(where two cubes are equivalent if one can be "solved" into the other)

RenderSettings

too many

Cᴏɴᴏʀ O'Bʀɪᴇɴ

:p

zyabin101

\o/ @RenderSettings you're back!

Eᴀsᴛᴇʀʟʏ Iʀᴋ

@RenderSettings @zyabin101 really enjoys saying hi to you.

Bálint

@NathanMerrill On a what size rubik's cube?

RenderSettings

8:55 PM

i'm always already back

Eᴀsᴛᴇʀʟʏ Iʀᴋ

17*17*17

RenderSettings

@EᴀsᴛᴇʀʟʏIʀᴋ i noticed

Eᴀsᴛᴇʀʟʏ Iʀᴋ

@RenderSettings don't be grace note

Nathan Merrill

3x3

Eᴀsᴛᴇʀʟʏ Iʀᴋ

that's no fun

@NathanMerrill a lot?

Bálint

8:57 PM

I have an 8x8x8 rubik's cube for example

VTCAKAVSMoACE

@HelkaHomba Can you re-upload this world?

Poke

@NathanMerrill I'm in a bit of a rush so I can't calculate it out but there are calculations for the total legal permutations of the cube. I'd start there along with all possible states

Nathan Merrill

oooh, that's smart

Poke

You can rotate each edge or each corner to get an invalid state but it's hard to say if one invalid state can be solved to get a different invalid state

Eᴀsᴛᴇʀʟʏ Iʀᴋ

ohai @HelkaHomba

Helka Homba

9:01 PM

Hi

@VTCAKAVSMoACE I'll try to get around to it, if I still have it

Cyoce

ಠ_ಠ

A+ for spelling, Bio teacher

Cᴏɴᴏʀ O'Bʀɪᴇɴ

lel

Helka Homba

@NathanMerrill If you can learn to solve a 4x4x4 I believe you can use the same principles and algorithms in any higher order cube. I solve my 5x5 and 6x6 using just the stuff I leaned from solving a 4x4

Nathan Merrill

so, with randomly placed stickers, there are 101097362223624462291180422369532000000 configurations

43252003274489856000 of them are solvable

Helka Homba

Ok?

I don't advise brute forcing if that's where you're going

Poke

9:07 PM

@HelkaHomba some of the parity conditions might change on higher order even cubes

Nathan Merrill

so, there are 2.337403e+18 different possible distinct cubes

I think

PhiNotPi

@mınxomaτ So, I found a 15-gate version that actually works like their 17-gate version.

Nathan Merrill

(of those, only 1 of them is solvable)

Poke

@NathanMerrill that's assuming that invalid cubes can't be solved into other invalid cubes

Nathan Merrill

@Poke no, its assuming that invalid cubes have the same number of duplicate states

mınxomaτ

9:09 PM

@PhiNotPi Awesome.

Poke

ah

only skimmed your number there

Helka Homba

@Poke That what I thought for a 6x6 but you can view it in a couple different ways as a 4x4 so there may be more parity errors but there are more ways to fix them. Anyway, I've never run into a 6x6 issue I couldn't solve with 4x4 algorithms

5x5 might technically be the first "generalizable cube" though, not 4x4, since it's not exactly the same

VTCAKAVSMoACE

@HelkaHomba Thaaaaanks.

Poke

can you boil it down further to the 2x2?

VTCAKAVSMoACE

I've been getting into time lapses recently, wanted to time laps a binomial distribution.

Poke

9:11 PM

2x2 technically has the same parity

zyabin101

@EᴀsᴛᴇʀʟʏIʀᴋ I really do. :3

VTCAKAVSMoACE

Of course, I could do that with dropper randomizers. ¯\_(ツ)_/¯

Nathan Merrill

oh, so 5x5 must be tough then

Cᴏɴᴏʀ O'Bʀɪᴇɴ

hwo about 2x30

Poke

higher order cubes are usually about solving the centers of each side, the edges, and treating it like a fat 3x3 iirc

El'endia Starman

9:13 PM

I actually consider the 5x5 easier than the 4x4 since there's one potential issue with the 5x5 that I don't know how to solve, so I have to scramble the cube and try again...and two or three such issues with the 4x4.

Probably worth noting that I never looked up algorithms for the 4x4 or 5x5.

Poke

yeah even ones tend to have an extra step or two since the centers aren't constant

Rainbolt

If any of you want to work with me, we have an opening.

Helka Homba

@Poke Well, I always solve a 4x4+ by first forming it into a 3x3, then solving as if it were a standard 3x3 (well, ignoring parity issues). And solving the corners of a 3x3 is the same as solving a 2x2.

El'endia Starman

> We need someone well versed in Visual Studio 2015 using C# + Microsoft SQL

Well, that's not me. :P

@HelkaHomba That's how I do it too.

Poke

I learned the 3x3 before I even thought about a 2x2 so I guess I haven't even considered that... I'll have to look into it

Helka Homba

9:16 PM

@El'endiaStarman There's only 4 you need to remember

For an NxNxN Rubik's Cube, each move has the form:

	([UDFBRL])((?:-?[0-9]+)?)(\(-?[0-9]+\)|['"]?)

([UDFBRL]) matches the face: U = upper, D = downward, F = front, B  = back, R = right, L = left.
((?:-?[0-9]+)?) matches the number of layers extending into the cube from the face to rotate. If empty, 1 is implied.
(\(-?[0-9]+\)|['"]?) matches the number of clockwise quarter turns to make: empty = (1), ' = (-1), " = (2).
Formulas surrounded by brackets followed by a number, \[...\][0-9]+, are performed that many times.

^ my cheat sheet

El'endia Starman

Well, my point was that beyond learning how to solve the 3x3, I figured everything else out myself.

Eᴀsᴛᴇʀʟʏ Iʀᴋ

@Downgoat what is Rennet? (in the cheddar-lang organization)

@Rainbolt lol nice flyer

zyabin101

@EᴀsᴛᴇʀʟʏIʀᴋ Rennet is a collection of JavaScript based interpreters, managed by @MarsUltor.

Nathan Merrill

@Rainbolt that sounds appealing

Eᴀsᴛᴇʀʟʏ Iʀᴋ

@zyabin101 okay