Does anyone know why the questions page says there are 2884 questions but this SE data explorer query only returns 2557? I know the data explorer only updates once a day but there's no way its 300 off.
@Optimizer Not sure what's going on. It works for me in Firefox but I can't get it to work in IE with any line separator...it does work in chrome though.
I just posed this question on math.se math.stackexchange.com/questions/1118700/… . If we extend it to ask for the number of different reachable orientations I suspect strongly there is no closed form
The number of reachable snake orientations
Imagine a 2d snake formed by sticking n identical squares horizontally in a line. This snake can rotate any part of its body by 90 degree. By doing repeated rotations it can make a lot of different snake body shapes.
rules
One part of the snake's...
@Optimizer Right. For the record here's a pastebin of what the snippet produces when run with the preset params. I believe it's exactly what grc's program prints.
I don't think Mathematica can generate polyominoes, but if it does, it shouldn't be hard to form a graph from then, and then there is a built-in for the hamiltonian path
@Lembik So I wrote a hacky program and it says 1,1,2,4,8,18,46,115 for N=1 to 8. If that's anything to be trusted, then it doesn't match anything in the OEIS
It's probably more likely that I have a bug somewhere :P
@MartinBüttner How good is Mathematica with Hamiltonian'ing 100k nodes? Cos you could kill this question pretty easily
Actually it's probably easier looking at Eulerian paths
For those with a little linear algebra background, the challenge is as simple as this: determine the eigenvalues and eigenvectors of a given complex 2x2 matrix. You may skip ahead to The Challenge for I/O details, etc. For those who need a little refresher on eigensystems, read on.
Background
T...
okay, I think the jigsaw puzzle challenge is good to go, although I'll probably need to tweak the snippet a bit once it's posted and I can test properly.
I'm not sure of how much use this would be on other SEs, but on CodeGolf.SE, we use Stack Snippets more often to actually provide useful functionality, than to show that some code of interest is actually working.
In that case, no one wants to look at that huge wall of code, all you want is the s...
So I should check manually then? k (I've never dealt with complex eigenvectors before, because maths education always likes to give you nice numbers for all problems, unless it's analysis)
Prelude, 12 bytes
One of the few problems, where Prelude is actually fairly competitive:
1(v!v)
^+^
This requires the Python interpreter which prints values as decimal numbers instead of characters.
Explanation
In Prelude, all lines are executed in parallel, with the instruction pointer t...
KSFT just created a language (probably) 10 minutes back and it supposed just a single unicode based code character biased from the question in which he just posted the answer :D
creates OptimizerGolf which a single character to solve words within words within words challenge
Copy this pastebin into a markdown editor like dillinger.io. This was potentially going to be part of a contest but SE has 30k character limits and it might be considered spamming the dummyimage site...
Works in Chrome for me, but there's this moment when the images are loading and it looks like pixels crawling from the left of the screen trying to find their respective spots
(I'm still waiting on MathJax for this one, so no title/nifty backstory yet and only a very rough writeup)
The challenge will be: Calculate the two-sample Kolmogorov-Smirnov statistic for two integer arrays.
Given an array A and a real number x, define the distribution function F by
F(A,x) = (...
Would asking vimgolf style questions be on topic on vi/vim? This is a type of question that is poorly suited for SO and most of the other SE sites. While it is conceivable that such a question would be suited to CodeGolf.SE, they only have two vimgolf questions there. It also does not feel clear ...
well I guess, it's not that necessary... you've got literals for 0 to 9. you've got variables for 10 to 20. most larger numbers can either be obtained with a few characters of arithmetic (and are rarely needed), and for really big numbers you're going to base-encode them in a string anyway
alternatively, you could do something crazy that the meaning of a digit depends on whether the last command executed on that voice was also a digit. if not, it pushes the digit. if it was, the top of the stack is multiplied by 10 and the current digit is added
I wonder what messed up stuff you could do by jumping into the middle of such a literal
I think in general, I'd first try to get as many CJam features as possible in, which don't require multi-character syntax. then one could fix some Prelude things, like allowing implicit ( or ) at the beginning or end of the program
and last, I'd try to fix some things I don't like about CJam
the thing I'm wondering about most is whether you can get something like CJam's blocks into Prelude
The number of reachable snake orientations
Imagine a 2d snake formed by sticking n identical squares horizontally in a line. This snake can rotate any part of its body by 90 degree. By doing repeated rotations it can make a lot of different snake body shapes.
rules
One part of the snake's...
(I'm still waiting on MathJax for this one, so no title/nifty backstory yet and only a very rough writeup)
The challenge will be: Calculate the two-sample Kolmogorov-Smirnov statistic for two integer arrays.
Given an array A and a real number x, define the distribution function F by
F(A,x) = (...
