« first day (14 days earlier)      last day (186 days later) » 

00:25
Wow @KamilDrakari that was some intensive research huh? Good job
@KamilDrakari The fact that every piece of memory is confined (the cube is limited and the registers are 32-bit) makes me positive that it is not
C is not even considered Turing-complete due to the fact that it's smart about memory
@TehPers Oh, that sounds like a fun extension
Also @TehPers if you see this before I fix the code block bugs, can you open an issue on aaronryank/Cubically for the code block bugs? Just in case it takes longer than I foresee
00:50
@MDXF nvm done
 
3 hours later…
03:27
Nice!
03:58
@TehPers @KamilDrakari do either of you know (or want to find) an algorithm that will get a certain face to 1 in Cubically 3, 2 in Cubically 4, 3 in Cubically 5, etc?
I'm working on it too, I'm not being lazy :P
Oh wait duh B3
04:16
Heh I think I just won
0
A: Polyglot the OEIS!

MD XF30 different versions of Cubically B3%0 Per this meta post, this is allowed. However, I'd appreciate it if this answer didn't get accepted. There are other more impressive polyglots, including my other (previously winning) one. B3 turns the BACK face 90° clockwise three times. In Cubically 3x...

04:31
@MDXF That's cheating :P
156
Q: Is this number a prime?

DennisBelieve it or not, we do not yet have a code golf challenge for a simple primality test. While it may not be the most interesting challenge, particularly for "usual" languages, it can be nontrivial in many languages. Rosetta code features lists by language of idiomatic approaches to primality te...

This is a pretty important challenge lol
04:49
@TehPers I thought so too but I made a meta post about it and it's not :D
@TehPers do you want to attempt it or should I (tomorrow, I'm off the computer for the night)?
05:33
@MDXF We both can :P
I'll give it a try soon, I have a couple ideas that might work
 
9 hours later…
14:53
@MDXF R3D1R1 sets face 0 to 1 regardless of cube size. The effects on other faces are less simple, but still consistent and could be expressed with simple functions if someone needed that.
15:03
I think primality testing will be difficult because checking that a%b=0 without having access to a builtin modulus operator is not trivial. The algorithm I have is :a/b*b=a because the notepad uses integer division, but that requires both a and b be stored somewhere other than the notepad.
So we could probably hardcode the first n primes in various ways on the cube and check the input for divisibility by each, with the maximum supported input being fairly limited.
I'm not intimately familiar with more advanced primality tests though, there might be something else that is easier in Cubically
15:35
@KamilDrakari There's an experimental modulus operator, but I agree.
 
3 hours later…
18:08
Lua interpreter supports multiple cube sizes now. I'll work on letting you rotate a specific depth on a face.
18:53
It can also rotate different depths into a face, like on a 3x3 cube, rotating depth 1 from top will rotate the middle layer of the cube rather than the top layer. It's ready for whatever method you'll use to select which layer to rotate :D
@MDXF Segfault (core dumped :P)
19:29
@TehPers Nice!
@TehPers Oh rip. What were you doing? :P
19:54
@MDXF I kept getting errors whenever using your interpreter. I forget which question that one was for
Also, I'm making conditionals behave like yours if experimental is disabled
What does ?0{}!1{} do, in terms of the !1?
Does the 1 do anything at all?
Lol 15e1000 in the Lua interpreter I'm using translated to "1/0 --[[math.huge]]--" (the --[[]]-- is a comment, but the interpreter included it xD)
@TehPers ?0{foo}!1{bar} does foo if face 0 is true and bar if face 1 is false
@MDXF Thanks
20:56
Fixed conditionals in the Lua interpreter (there was a small bug with the else statements) and added support for non-experimental conditionals (the way that the C interpreter treats them, aka the official way)
@MDXF How does your interpreter treat ?0!%5?
21:15
@TehPers Not sure, never tested it
Just a sec
btw you know you can test them on TIO? It almost always contains the most up-to-date version of the "official" interpreter
@MDXF I just wanted to make sure with you what you wanted it to do.
Yeah no problem
The TIO interpreter has bugs and strange behavior sometimes, so it's better just to ask.
Yeah :/
What it should do is skip just the !, but it might skip everything until after the 5.
@MDXF Thanks. What does ?%5 do?
21:19
Probably nothing.
By nothing I mean print the 5th face
Oh okay lol. Thanks again!
Um or segmentation fault that works too... not
looking into that
I just wanted to make sure my interpreter is identical to how you want yours to work when experimental isn't set
Oh okay apparently ?0!%5 does exactly what it should, it prints 45. That's good, I must've already fixed that bug
?%5 currently seg-faults, it should print 5, I know why it's broken so gimme a sec
Fixed. Asking Dennis to pull Cubically...
@MDXF What does ?1!%5 do?
Also, !0!0%5 and !1!0%5?
I guess I could look at the interpreter
If it's working as intended, I'll use the interpreter for this.
21:31
Just a minute, doing a thing, I'll look at those in a little bit
Looks to me like ? and ! act as single commands and skip over the next command/block, as expected.
Yep
That's a good thing, right? :P
Yep!
I found a way to do OR in Cubically
Oh?
I know I found a way to do XOR and AND without messing up the cube but I forgot
!6?7 is 6 or 7
21:34
Oh yeah!
!6?7%1 prints 9 if 6 or 7 are truthy
That's good
How many in a row work? Does !0?1!2 work for 0 || 1 || 2? It doesn't look like it does, but it might
I doubt it. You'd need braces for this I think
Oh yeah true
Hmm. To do 6 or 7 or 0...
Um, it segfaulted xD
$!0?6{}!%5
You probably just fixed this though
21:38
Yeah it probably segfaults lol. It likely is fixed, just not pulled yet
Try adding a space in the brackets. If that fixes the segfault, I'm in trouble xD
@MDXF Still segfaults
Yay.
If it didn't segfault it would mean I had another bug
@MDXF Is &6 supposed to exit when 6 is truthy?
Currently if & has an argument, it doesn't exit
If anyone finds any really good snippets or algorithms, add them here
maybe put parentheses around the macro?
21:43
@TehPers I think so
Let me check the spec and my code
The spec agrees with my code, if the specified face index has a truthy sum, it should exit
But it doesn't :/
Fixed on GitHub, I'm not going to bother Dennis about fixing it on TIO until tonight
Okay.
22:13
0
A: Transpile ;# into your language

TehPersCubically, 138 bytes +1/1+54@6:5+1/1+5@6/1+52@6:4/1+5@6:1/1+54@6:4/1+5@6:5+2/1+4@6(~-61/1=7&6+5/1+51=7?6{+3/1+5@6}:0+53/1+3=7?6{+52@6:5+1@6-1@6+1@6:5+2/1+4@6}) Try it online! Note: You may need to replace &6 with ?6& for it to work on TIO. &6 is in the language spec, though. How it works +1...

Using Cubically to convert ;# code into Cubically code that executes the ;# code!
Nice!
22:46
Ok, Cubically's codepage is ready to roll. All I have to do is actually implement the different-layered turns.
For example, R⁵2 can rotate the 5th layer from the outside right of the cube. All the code is there to call it, I just haven't actually implemented the layer rotation yet.
@MDXF Good luck! Remember, on a 3x3 cube, rotating the 3rd layer from the top rotates the bottom CCW :P
Yep
Oh boy. This is gonna be a lot more difficult than I thought.
@MDXF Feel free to look at how my code rotates layers. I just don't have the codepage implemented, so there's no way to actually tell it which layer to rotate
Wait no way you already did that?!?
@MDXF Um, yes.
22:56
:O
Dang, you're fast. I gtg for now but I'll look at that later

« first day (14 days earlier)      last day (186 days later) »