« first day (1840 days earlier)      last day (2993 days later) » 

10:00 PM
oh, it's gotta be something like that, because 0s are powers of two plus one
 
@Doorknob Abacaba sequence?
 
I want to do a challenge for golfing PE, but I can't do it on this site because not everyone that wants to do PE hasn't done it yet.
 
Full image for posterity:
user image
10
 
IT IS DONE.
 
LLLETS GET PROMOTED
inb4 "congrats, beta has ended, we conclude codegolf is not valuable and will be closed"
 
10:02 PM
Mini-challenge: golf the 1000 digit number found here
 
 1 213 3251634 439265
 1 121 1213121 121312
runs of ones on top, runs of zeroes on bottom
replaced 0/0 with spaces for visual separation
 
Graduation shines through the barrier. You feel as though beta is almost at an end. You're filled with DETERMINATION.
 
so there was no .0 to begin with
i was correct all this time
 
haha
 
er yes sorry
 
10:04 PM
fuck you all
:P
 
lol
 
0
A: Sandbox for Proposed Challenges

El'endia StarmanElectrons bouncing in a wire Imagine a "wire" that has n spaces. Imagine further that there are "electrons" in that wire. These electrons only live for one unit of time. Any spaces in the wire that are adjacent to exactly one electron become an electron. In Game of Life terminology, this is B1/S...

 
Sorry for your troubles.
 
interesting
 
I like that.
 
10:06 PM
Quick question: given a string with only digits, what is the best way to compress it?
 
I wonder what causes the pattern of <some number of> 1s and then a number of 0s following the abacaba pattern
 
@CᴏɴᴏʀO'Bʀɪᴇɴ itself
 
@CᴏɴᴏʀO'Bʀɪᴇɴ relavent
 
@CᴏɴᴏʀO'Bʀɪᴇɴ Pump the base.
 
10:07 PM
^
 
@CᴏɴᴏʀO'Bʀɪᴇɴ if you're 100% sure that there are no patterns, then encoding it in binary and taking bytes of 8 bits is objectively "the best" way to compress it
 
@Geobits huhwat
@Doorknob It's an arbitrary number of a huge length.
 
I've found a pattern
 
b64 makes it longer.
 
10:08 PM
@orlp yeah?
 
@orlp for number of ones?
 
look at the number of ones from here
 
2130325
 
Haven't figured out 22 yet, gimme a moment.
 
10:09 PM
 1 213 3251634 4392651
 1 121 1213121 1213124
wait...
 
bin(2+3) == 0b101 -> 1*0 + 0*1 + 1*2 = 2
 
the 4 shouldn't come this early
oh, didn't do 22 yet :P
 
Like I said, I haven't got 22 yet.
 
I can't read
 
bin(1+3) == 0b010 -> 1*0 + 1*1 + 0*2 = 1
 
10:10 PM
 1 213 3251634 439265?1???????
 1 121 1213121 121312141213121
(filled in with sane predictions)
@orlp where are you getting 2+3, 1+3 from?
I think I get the rest
 
it breaks down a bit later
>>> def wtf(n):
...  b = bin(n)[2:]
...  return sum(i*int(bit) for i, bit in enumerate(b))
...
>>> wtf(5)
2
>>> wtf(6)
1
>>> wtf(7)
3
>>> wtf(8)
0
>>> wtf(9)
3
>>> wtf(10)
2
>>> wtf(11)
5
>>> wtf(12)
1
>>> wtf(13)
4
but it's spooky
 
> def wtf
 
>>> [wtf(n) for n in range(5, 20)]
[2, 1, 3, 0, 3, 2, 5, 1, 4, 3, 6, 0, 4, 3, 7]
 
function wtf()
print("ಠ_ಠ")
end
 
10:14 PM
it seems that later on it still generates the right numbers, but in a bit different order
 
[2, 1, 3, 0, 3, 2, 5, 1, 4, 3, 6, 0, 4, 3, 7]
                         6     4           9
with corrections
 
>>> [wtf(n) for n in range(5, 30)]
[2, 1, 3, 0, 3, 2, 5, 1, 4, 3, 6, 0, 4, 3, 7, 2, 6, 5, 9, 1, 5, 4, 8, 3, 7]
 
I think I'm gonna have to write a program for n=22.
 
[2, 1, 3, 0, 3, 2, 5, 1, 4, 3, 6, 0, 4, 3, 7, 2, 6, 5, 9, 1, 5, 4, 8, 3, 7]
                         6     4           9           ?     ?????????????
neat
 
why?
 
10:15 PM
@El'endiaStarman you've been doing it by hand???
 
^
 
oh oh oh
I think n=22 is 0b11111110
7 and 9 swapped, like orlp said...
 
@CᴏɴᴏʀO'Bʀɪᴇɴ Not exactly. I've been using Variations of Life, but it doesn't have a built-in away to get the period.
@Doorknob And that is...2046?
 
@El'endiaStarman how'd ya get 1022? O_o
 
@Doorknob it seems too good to be unrelated
 
10:16 PM
@El'endiaStarman There should be.
 
@orlp yeah
 
definitely somehow related
 
@Doorknob Watched it for a while. :P
 
I used to get FCK a lot here... :P
 
10:17 PM
@El'endiaStarman O_O
 
^
 
@Doorknob holy shit
 
Dude, mechanize.
 
@El'endiaStarman You, sir, are brilliantly insane.
 
@Doorknob notice the gap between swapped pairs
@Doorknob 1, 3, ...
 
10:17 PM
yeah I saw that
 
Alright, testing the 2046 hypothesis.
I do have a "fast" mode... :P
 
I'll write a program for the wire
 
Oh, it's not 2046. It's 4094.
 
marky is smart and doesn't like
:P
 
10:19 PM
1s:    1 213 3251634 43926571???????
0s:    1 121 1213121 121312141213121
orlp:            * *   *   *
 
In case anyone missed it, Geobit's Marky bot is live over here: chat.stackexchange.com/rooms/30332/beep-boop-maggot
 
too early to see a discernable pattern yet, but...
both pairs are isolated on one side of the "mirror" number in the abacaba thing
and they're all on places where there is 1 0
 
marky has turned his back on us!!!!!
HE LIKES CR BETTER
 

Bad Upbringing

1 min ago, 13 seconds total – 4 messages, 2 users, 0 stars

Bookmarked 50 secs ago by Calvin's Hobbies

6
 
@Quill DON"T LET HIM GO TO YOUR SIDE PLS
 
10:22 PM
@QUILL HE MEANS SO MUCH TO US :(
 
orlp:  1 213 3251*3* 43*265*154837??
1s:    1 213 3251634 43926571???????
0s:    1 121 1213121 121312141213121
note that the 7 in the 1s section is a hypothesis
 
Is anyone here a JavaScript guru? Requirement: must know more than me.
 
@Doorknob you don't even care. :P
@CᴏɴᴏʀO'Bʀɪᴇɴ ish
shoot
 
Is that a no? :|
 
I know a good bit, but not as much as I know python.
Shoot.
 
10:24 PM
What's the question?
 
^^
 
WHAT DOES THIS MEAN?!?!?!?: uncaught exception: out of memory <unknown>
IT'S DRIVING ME ABSOLUTELY CRAZY
 
it means you're out of memory
 
^
 
10:24 PM
HOW TO BLOODY FIX IT!!?!?!>!??!??!?!?!?
 
Even a doorknob knows that.
 
@CᴏɴᴏʀO'Bʀɪᴇɴ stop using so much memory
 
@CᴏɴᴏʀO'Bʀɪᴇɴ stop infinite loop/recursion
^^
 
@RikerW Infinite loop/recursion kills the browser if it uses too much memory.
 
@El'endiaStarman updates on the 254-hypothesis?
 
10:25 PM
@Doorknob For n=24?
 
@CᴏɴᴏʀO'Bʀɪᴇɴ okay
 
@El'endiaStarman yeah
 
@CᴏɴᴏʀO'Bʀɪᴇɴ.
 
@RikerW :|
@RikerW uhhh I don't think you want me to do that
 
yes i do
 
10:26 PM
@El'endiaStarman wait, no, n=22
 
@Doorknob n=22 was 4094.
 
what is it supposed to do?
 
@El'endiaStarman wait WHAT
 
It's the code for Jolf.
 
Okay.
 
10:26 PM
All of it.
 
o
 
so much for @orlp's pattern
 
@CᴏɴᴏʀO'Bʀɪᴇɴ section it
pinpoint the error.
comment bits out until you find it.
 
                 # #   #   #
orlp:  1 213 3251436 4372659154837??
1s:    1 213 3251634 439265C1???????
0s:    1 121 1213121 121312141213121
 
or give up and play nethack
 
10:27 PM
Jolf is over 10KB in size.
 
10kb? o_O
I have had single files that are over 1MB...
gfi
 
huhwat
Oh, I found the problem.
 
what was it?
 
I had too many tabs open. >_<
 
wtf?
 
10:29 PM
Hahaha
 
@CᴏɴᴏʀO'Bʀɪᴇɴ ಠ_ಠ
 
@El'endiaStarman got anything >=24 yet?
 
Still working on n=24.
 
ok
 
Heh, I would've expected orlp to have that program written by now. :P
 
10:31 PM
@RikerW I had three chats open, four githubs, two instances of MDN, two instances of Jolf, fourteen codegolf.se tabs, and project euler.
 
24 2046
 
@CᴏɴᴏʀO'Bʀɪᴇɴ ಠ_ಠ
 
10 zeroes, 1 one
orlp's pattern is definitely breaking down...
 
muahaha
 
10:33 PM
25 252
 
     0         1         2         3
     0123456789012345678901234567890
                 # #   #   # ###
orlp:  1 213 3251436 4372659154837??
1s:    1 213 3251634 439265C1A69????
0s:    1 121 1213121 121312141213121
next one's a power of two minus two, I already know :P
 
26 1022
:P
 
orlp's thing has completely stopped making sense
 
btw, how does one have a period of 0?
 
The electrons die out.
27 56
 
10:37 PM
That's still a 1-cycle period
 
If it helps, you can think of it that way.
 
if it alternates a, b, a, b
it's a 2 cycle period
 
Lemme see if that's on OEIS.
 
   0         1         2         3         4         5
   012345678901234567890123456789012345678901234567890
1s:  1 213 3251634 439265C1A693
0s:  1 121 1213121 121312141213121 1213121412131215121
 
10:40 PM
Anybody here use something other than chrome?
 
I use Chromium .-.
and used to use Firefox
 
0 1
1 1
2 2
3 1
4 6
5 4
6 14
7 1
8 14
9 12
10 62
11 8
12 126
13 28
14 30
15 1
16 30
17 28
18 1022
19 24
20 126
21 124
22 4094
23 16
24 2046
25 252
26 1022
27 56
28 32766
29 60
30 62
31 1
32 62
33 60
34 8190
35 56
36 174762
37 2044
38 8190
39 48
40 2046
41 252
42 254
43 248
44 8190
45 8188
46 takes forever
 
oh awesome
 
Oh gosh. I was working my way up through 2^n-2 for 28.
Glad I didn't have to go all the way. :P
 
@El'endiaStarman try 36
:)
 
10:44 PM
hahaha, yeah...
Mind if I take your list for the test cases in my sandbox post?
 
that list is my copyright!
eternally mine!
 
(go ahead)
 
(for the small fee of one virtual cookie)
 
10:46 PM
Should I include the case n=0?
 
woah woah woah
 
what was it?
 
n=36 blows the pattern out of the water
101010101010101010
 
cool
 
10:47 PM
WAT.
 
Oh, my n = 0 is faulty
or well, computational method
 
check your n=36...
 
Anybody know how to get sympy in julia?
 
for simplicity I would just ignore n = 0
 
yeah, that's what I was thinking too
 
10:51 PM
             1         2         3         4         5
    123456789 123456789 123456789 123456789 123456789
1s:  1 213 3251634 439265C1A693E45 54C3?9C2A675CB
0s:  1 121 1213121 121312141213121 1213?21412131215121
 
@Downgoat
 
Hey wait, I don't get 48 for n=39.
Wait, yes I do.
It's one of those lengths that doesn't repeat its starting configuration.
 
n=36 is really a mystery
 
^
 
             1
             10
             1
            110
             100
           1110
             1
           1110
            1100
         111110
             1000
        1111110
           11100
          11110
             1
          11110
           11100
     1111111110
            11000
        1111110
         1111100
   111111111110
             10000
    11111111110
        11111100
     1111111110
           111000
111111111111110
          111100
         111110
             1
 
10:56 PM
# Brent's cycle detection, modified from wikipedia.
def brent(f, x0):
    power = lam = 1
    tortoise = x0
    hare = f(x0)
    while tortoise != hare:
        if power == lam:
            tortoise = hare
            power *= 2
            lam = 0
        hare = f(hare)
        lam += 1
    return lam

def electron_period(n):
    get = lambda w, i: w[i] if 0 <= i < len(w) else 0
    next_wire = lambda w: [get(w, i-1) ^ get(w, i+1) for i in range(len(w))]
    return brent(next_wire, [1] + [0]*(n-1))
 
@Doorknob Fascinating.
 
err
@El'endiaStarman can you delete that version above?
I forgot to rename a variable
 
I can edit it.
 

« first day (1840 days earlier)      last day (2993 days later) »