« first day (1763 days earlier)      last day (3066 days later) » 

7:00 PM
this might be a nice instalment for random golf of the day :)
 
@AlexA. BACD is not BCAD, but not legal either
@MartinBüttner meh
 
everyone will just use the O(N!) sampling with rejection
 
you can easily rule that out if you know something better exists
 
@orlp Oh right
 
7:01 PM
@MartinBüttner why?
I don't understand why
 
well I suppose there could be non-uniform multiplicities
 
I mean, look at the element at the top left
it has equal chance to end up in any position
the same goes for any other element
so why isn't it uniform?
 
@orlp except the one where it started
wait, not true
 
@MartinBüttner nope
you see my mental problem?
2
I can't explain to myself why it's not uniform
 
@orlp I was running your code on (4,8) and it has now reached 18/32
But it detected
00011011
01101100
10110001
11000110
and not
00110011
11001100
00110011
11001100
For tiling the plane
 
7:09 PM
@Sherlock9 the latter is invalid
diagonals mate
 
Where in the diagonals is there three in a row?
 
or maybe the formatting is putting me off
@Sherlock9 is the program done?
 
Nope
Still somewhere between 18 and 19
I have it print when it's starting a new number
 
ah that's because it's still my old version
once it has found a better best_s it will never print something older
even if it tiles
 
Ah fair enough
New code?
 
Oh it finished
 
at?
 
I think it didn't check 19, so it must be 18, except the only one it printed that tiled the plane is 16/32
 
@orlp I can't even explain why it would give a finite probability for every possible latin square
finite == non-zero
 
@MartinBüttner every latin square has one of ABCD (for N=4) once in every row/column
each row/column is a permutation of ABCD
let's say I have
ABCDE
BCDEA
CDEAB
DEABC
EABCD
can you find a latin square which can not be generated by permuting rows/columns of this one?
 
7:16 PM
You know what might help? Sort row_possibs by s
Would add extra overhead, but it would help with determining where in the heck it could work
 
@Sherlock9 do you know how simple that is?
I'm dumb that I didn't do it earlier
row_possibs = (r for r in itertools.product([0, 1], repeat=DIM[1]) if valid_row(r))
row_possibs = (r for r in itertools.product([1, 0], repeat=DIM[1]) if valid_row(r))
well that doesn't quite do it, but it's already better :)
yep, after doing that it finds 20/36 for 6x6 in like 5 sec
so...
 
:D
 
proving the bound is going to be annoying
 
Code please
 
@Sherlock9 I showed you
literally swap 0, 1 for 1, 0
 
7:19 PM
Oops sorry
 
at these sizes you're going to have to start looking towards C or something though
 
I'm considering it
I think trying to code C at 2:20 in the morning might be a tad suicidal though
 
@MartinBüttner oh I think I can explain it
or nope...
nvm
 
@orlp not being able to find one is no prove that it doesn't exist ;)
 
@MartinBüttner you misunderstood me
if you could find one that can't be derived means you have proven it :)
 
7:26 PM
sure, but I was hoping you'd have a prove that each one can be derived :P
 
Did your (6,6) get you anything that tiles the plane, @orlp?
 
no I stopped it as soon as it found > 18/36
we already have tilings for 1/2
what's the point in finding more?
 
finding ones for > 1/2
 
I'm trying to find a tiling > 1/2
ninja'd
 
I don't believe it exists
 
7:29 PM
Half the point of this insanity is finding a tiling > 1/2
Very well, I'll keep looking
 
actually
can't we exclude a ton of numbers
by using LCM?
we don't need to check multiples
e.g. 4/8 is a lot easier to check than 8/8
 
How would that work.? Couldn't you have an 8/16 with a minimum period of 4x4?
 
@feersum I guess if you find a partial tiling (horizontal or vertical) for NxM with size > 1/2 you don't need to check Nn x Mm for any n,m anymore
if you're looking to make the bound 1/2 tight
 
you're trying to show that a 1/2 tiling exists for every period ?
 
no, I'm trying to find a small N x M to bruteforce that has an optimal solution of 1/2
because that would show that the infinite plane is optimal at 1/2
 
7:38 PM
if you have a 4x8 solution, that doesn't imply that 8x8 can handle the same density
because what we find for 4x8 is not necessarily a tiling
 
@MartinBüttner no, but if it's partially tilable it does imply that 8x8 can't be worse than that
e.g. if we find that 3x6 can tile horizontally for 5/9, then we don't need to check 6x6 anymore
since that can also have density 5/9
 
Of course
 
I don't see how this proves anything about the infiite plane.
 
That's why we stopped checking 3xN
 
@feersum If I can brute force, say, 6 x 8, and find that it can't contain more than 1/2 on squares
then that means the infinite plane can't have more than 1/2 on squares
 
7:41 PM
6x8 tiling or non?
 
doesn't matter
or well - I guess non
 
seems implausible to find a max 1/2 with non-tiling
surely you can always have more at teh edges
 
nooo
I'm trying to find one where nothing above 1/2 can exist
oh wait, that's what you meant with 'max' isn'tit
 
I would conjecture that you can always find > 1/2 for a non-tiling finite rectangle
 
And I would conjecture that a tiling > 1/2 exists. Just for the sake of have a conjecture out there. The evidence thus far does not in any way support this conjecture.
 
7:52 PM
Hmm how many people here are Lembik's sock?
 
I'm sorry. What is a sock? Secondary account?
 
Correct
 
@feersum did I miss some drama?
why would he be using sockpuppets?
 
Why sock? And why is our chat called "The Nineteenth Byte". I assume there are stories behind this
 
I suppose this comment only makes sense if you're in this chat room way too much
 
7:54 PM
I just wonder at the origin of the terms
 
@Sherlock9 We score things in bytes and there are nineteen holes in a golf course.
Sock is short for sock puppet, i.e. an account that's controlled by another user, as one would control a sock puppet.
 
Thanks @AlexA.
And aren't there usually 18?
Or am I being n00bish again?
 
The 19th hole is the pub at the end of the golf course
 
Idk, I don't know actual golf, only code golf.
@VisualMelon Is that legit?
 
XD @VisualMelon
 
7:57 PM
I'd believe it
 
In golf, the nineteenth hole is a slang term for a pub, bar, or restaurant on or near the golf course, very often the clubhouse itself. A standard round of golf has only eighteen holes, so golfers will say they are at the 'nineteenth hole', meaning they are enjoying a drink after the game. The concept is similar to Après-ski in skiing. The 19th hole on miniature golf courses is often a hole in which if a hole-in-one is scored, one receives a free game. == References in mediaEdit == The golf stories of author P. G. Wodehouse, which are narrated by his character, the Oldest Member, discuss ...
 
Regular golf seems sinfully boring; one could only hope that the reward at the end of the game is a nice beer.
@VisualMelon I had no idea.
 
Thanks for going with me on this ball-whacking charade. Come on, let's grab a pint
 
and you call yourself a mod? ;P
congrats on that, BTW, I don't think I was around when that happened
 
Oh thanks! :D
 
I think community consensus is that I am wrong. I can no longer live in fear of being wrong since clearly it's a perpetual state.
 
Was I wrong to save your species then?
(Rather than let the foxes of truth hound you out)
 
At it turns out we've been hunted to extinction. I am the sole survivor.
 
and you've evolved into a Magpie(esq being)
 
This is true.
As it turns out, geese are shitty creatures.
 
8:02 PM
Geese are fantastic!
 
is Bigtoes still around?
 
*fanatics
 
Have you not been around since he was Bigtoes?
@Geobits is alive and well.
 
good to know, golfing C# is always more fun when there is a good Java answer to compete with
though I don't like this C# 6 nonsense... far too many golf-friendly features...
 
8:05 PM
I... never expected to hear that from someone who likes both C# and code golf.
 
C short
 
:O
Not a bad C#-based golfing language
 
I love C# because it's simple, I love code-golf for some other reason, I'd rather they stopped adding features to C#
 
@AlexA. y :O?
 
@Optimizer I was using :O to denote a gasp of realization
 
8:07 PM
(also I'm too lazy to download a C# 6 compiler, so I can't use the features anyway)
 
Doesn't that take like, I don't know, all of about 4 minutes?
:P
 
@AlexA. not everyone is in the luxury of good fast internet
 
I did once try, but I couldn't find it or work out whether VS ships with it or not yet
I don't think my IDE of choice supports it yet, but that's just a feeling, I've not checked
 
@VisualMelon intellij?
 
eurgh, no
SharpDevelop
and no-one mention Eclipse
 
8:12 PM
intellij is really nice, I dont think it deserves eurgh
 
it's just the J on the end
 
J is really nice golfing language, you know!
 
I hear it isn't nearly as painful as Eclipse, but I also know people who like Eclipse, but these people usually haven't used VS
 
also, why would an IDE named I C# code not have a C# compiler inbuilt?
 
@VisualMelon Wasn't planning on it. Eclipse is like trying to drive a semi truck, whereas other IDEs are like sedans and sports cars. :P
@Optimizer I agree, IntelliJ IDEA is the best Java IDE I've seen.
 
8:13 PM
@Optimizer it does, but I don't like updating software
 
Why would VS not have the latest C#? Isn't Microsoft the main driver of that language?
 
intellij although being a bit heavy is really nice on having deep integration for language features for majority of languages
@AlexA. not just java, from my experience, JS too
 
@Optimizer Do you know J? It makes no sense to me. :P
 
i dont
 
@feersum I imagine it does, but I couldn't work it out
 
8:15 PM
@Optimizer Yeah, and I think it has plugins for a variety of other languages as well.
 
languages and frameworks!
it has logical support for almost all major frameworks, web or backend.
 
That's awesome!
Have you tried Atom?
 
yeah
 
Do you like it?
 
but the issue with Atom/ST3/similar things is that they are just code editors with a bit of intelligence
they are not full blown IDE with all kinds of voodoo magic support
like intellij can understand my gulpfile.js and pull out the tasks as run configurations and what not. It can read my eslintrc config file and apply those rules itself to show the errors/warnings in the UI.
I liked ST better than Atom, mainly because of speed and support.
 
8:20 PM
ST is Sublime Text?
 
the only thing missing in intellij woudl probably be the advanced multi cursor support of ST
@AlexA. yes
 
Atom has a lot of plugins that can make it function like an IDE. I really like how extensible it is.
And it's FOSS. :D
 
have you tried brackets?
does atom understand your code?
 
atom is not really an ide, but as an editor it is AWESOME
 
like variable/function usage and related stuff?
 
8:23 PM
@Optimizer yes
 
how? using tern?
 
and you can navigate to the part of your code where they are defined
@Optimizer I'm not really sure
 
atom is JS based, right ? just like brackets..
 
yeah it runs in an entire modified instance of chrome
 
@Maltysen Uh, I don't know about that. Are you sure?
@Optimizer No, I haven't tried Brackets but it looks nice.
 
8:28 PM
Hey guys
 
@Maltysen yeah, that is the main concern with both atom and brackets. That is also why they cant match speed of ST
 
> Atom is a specialized variant of Chromium designed to be a text editor rather than a web browser. Every Atom window is essentially a locally-rendered web page.
Wow! TIL.
 
they just took the browser out of the developer tools!
 
 
1 hour later…
9:37 PM
Anyone here?
 
I am
@NathanMerrill Hi
 
I was thinking about doing a challenge where you get an ascii representation of rubberbands laying on a table, and you have to determine whether they are entangled or not.
But now I am not sure whether this is actually solvable=/
 
I don't understand what's going on with the chemistry questions and close/reopen votes. codegolf.stackexchange.com/q/64862/194 was closed today as a dupe of codegolf.stackexchange.com/q/11816/194 , which has just picked up two reopen votes, but the former adds more variety to the site than the latter.
 
@PeterTaylor Yes that was the question I had in mind too, at first glance it seems about of equal difficulty compared to the problem of of finding out whether something is a knot or not (unknotting problem) right?
 
9:41 PM
I think it's the same problem.
 
^
 
I am not so sure about that.
 
Pick a segment from each such that nothing else overlaps; cut the segments and cross-link them; test whether you have a knot or an unknot.
 
You are saying that if you can solve the unknotting problem you can also solve the -lets call it- rubber band problem.
But I think the rubberband problem is actually quite a lot easier.
 
The reduction works the other way too.
 
9:50 PM
@PeterTaylor I do not completely understand this procedure, can you elaborate it? What do you mean by cross linking? (And by picking a segment that 'nothing' overlaps?)
 
0
Q: Non-quadratic equation method of solving the roots of a quadratic trinomial

Ashwin GuptaLike the question says, think back to your High-school algebra class. Write a program which solves for the roots of a Quadratic trinomial WITHOUT using the normal quadratic equation. (HINT: Think completing the square or factoring). The winner will be the smallest example (smallest in terms of by...

 
@NewMainPosts lmao
Field day for Mathematica
 
the "normal quadratic equation" is completing the square
 
^
I didn't even notice he said that until I read it again.
Oh he edited it
> You may not just write a calculator using the standard quadratic equation (thats this: practiceit.cs.washington.edu/images/quadratic.gif
@flawr ffs I was literally just typing that
 
uhh he just deleted it, should I undelete, close vote?
 
9:59 PM
Awh man I was just trying to figure out how to do it in Mathematica with just the coefficients too
 
@Maltysen No
 
@Maltysen Nah, if he deleted it he wants it to stay like that
 
@Maltysen What benefit would we get?
 
@flawr To link two bands into one: pick one segment on each band such that you can draw a simple curve (i.e. topologically equivalent to a circle) through them which only contains the segments; suppose the segments are AB and CD. Delete those segments and add (AC and BD) or (AD and BC), whichever doesn't introduce an intersection.
 
no he specifically said, "Ok, prehaps I need to be a little more specific here. Give me a minute I'll update the rules."
 
9:59 PM
For the unlinking, it's exactly the same.
 

« first day (1763 days earlier)      last day (3066 days later) »