« first day (1625 days earlier)      last day (3223 days later) » 

2:28 AM
What's a good 126x126 pixel image about PPCG or SE that can be decently made with with 16 basic colors?
 
 
5 hours later…
7:09 AM
@Calvin'sHobbies An aesthetic Piet program
@Phase If this is a golfing language, then multi-digit probably. If not, the you can decide.
 
I want to make a lisp related challenge
maybe a codegolf that can make the smallest lisp interpreter?
 
been done
 
link?
 
ah well there's this but it doesn't even support any kind of recursion/looping
 
7:24 AM
most of the work of the challenge is to define the actual requirements of the lisp
like, probably only for integer atoms
then you'd need quote, if, lambda, procedure calls, set and define, and some builtins, like + - * / < = car cdr cons eq? list? null? number? procedure? symbol? at least?
 
7:39 AM
hrm
for added challenge I might do it in GOLF
and make the winning criterion binary size
 
 
2 hours later…
9:43 AM
0
Q: ASCII Dragon's Curve

FatalizeIntroduction The Dragon's Curve is a fractal curve that notably appears on section title pages of the Jurassic Park novel. It can very simply be described as a process of folding a paper strip, as explained in the Wikipedia article about this curve. The first few iterations of the generation o...

 
9:57 AM
@AlexA. yes
 
10:17 AM
0
A: Sandbox for Proposed Challenges

isaacgpopularity-contest Make a code formatter for a golfing language Many golfing languages are very difficult to understand for the casual or even experienced user. Golfers often arrange the code to clarify and explicate the program. However, doing so manually is often a time consuming process. We'...

 
10:37 AM
If possible I'd like some comments on my proposed challenge.
 
closed as too broad
 
Well.. Apparently Joe has quite a major flaw. It doesn't support unicode.
 
@feersum Are you talking about mine? How is "Make a code formatter that adds whitespace to a golfing language program to make it more readable" too broad?
 
@isaacg "readable" is subjective.
 
@feersum Aren't popularity contests supposed to be subjective?
We've had 'nice-looking image' contests
 
10:50 AM
@isaacg Yes, but they should compete on a quality that can have a high level of agreement between users, even if it is not mathematically describable
 
Hm. Is there any way the concept can be rescued, in your opinion?
 
Adding the extra lines in a rule-based way was already done a lot of times, I believe
 
Yeah, and I'd like this to be more language-agnostic.
 
11:20 AM
Also, "By "Golfing language" I essentially mean a language that is more likely to be used for a code-golf question on this site than for other purposes." seems like a pretty bad golfing language definition... something like BF could also fit the bill
Did you mean "esoteric language"?
 
 
4 hours later…
3:53 PM
Algorithm puzzle
given an array of length N, containing integers [0, N) once each in arbitrary order, can you 'invert' the mapping such that if a[i] = j then after the operation a[j] = i in O(1) memory? if yes, how efficiently?
 
Yes by following the index cycles?
 
0
Q: Hexadecimal Counter

Phase Hexadecimal is a base 16 counting system that goes from 0 to f. Your job is to make a counter that will count up hex numbers until the program is stopped. Example: $ python counter.py 1 2 3 4 5 6 7 8 9 a b c d e f 10 11 12 13 14 15 16 17 18 19 1a 1b 1c 1d 1e 1f 20 21 22 23 24 25 26 27 28 29 2...

 
4:11 PM
@Sp3000 how do you keep track of the cycles?
remember, things CAN map to themselves
e.g. a[5] = 5
 
1 number to track start of cycle, another to track the current index in the cycle and a temp? Technically this is O(log n) memory though, because you need O(log n) bits to store n
 
I wish the drawing challenges wouldn't all be ascii-art
I like to actually draw things but find ascii a tedious chore
 
Needs more turtle golf :P
 
turtle golf?
 
from turtle import*
 
4:21 PM
never used it
 
See here for an example
I think it's only in there to get kids into programming in Python :P
 
Maybe it would be fun it I worked on my 2d language...
 
Yeah, we probably both need to add some writing capabilities, cos the matching part of the asteroid question could have been done in what, 10-20 bytes?
@orlp Looks like my problem is not so much keeping track of cycles - it's keeping track of which cycles I've already gone though :/
 
4:48 PM
@Sp3000 Include the permalink. Let that browser burn. :P
 
21 looks awfully long for the I-knew-this-challenge-would-end-up-like-that answer
For starters you can drop the s after A,
Well... nvm you're gonna drop a lot more now :P
 
@Sp3000 It crashed my browser xD
 
It's a infinite loop, what did you think would happen? :P
 
Dropped and dropped.
Sadly, "A0:G":,:^ is one byte longer.
 
5:06 PM
@isaacg All questions should have an objective spec. Pop-con is a subjective decision about which is the "best" answer out of the ones that meet the spec. If it becomes subjective whether or not an answer meets spec then the question is definitely off-topic.
 
@Sp3000 Did you see the latest revision of aditsu's LCS answer? He found a way to exploit the small alphabet.
 
I gave up on LCS when I realised you don't need to do 20 1000-longs in an hour, but will take a look :)
Ahaha 31, you guys are nuts :P
 
20x1000 will run out of memory, but 250x250 works just fine. For short enough strings, it actually gets faster if there are more of them.
 
5:24 PM
That's pretty impressive then :)
 
I was thinking about making a fastest-code challenge about LCS. I'm just not sure how much the C answer could be improved.
 
Probably a fair bit :D
 
n strings of length k would probably make completely different challenges depending on which parameter is fixed.
@BrainSteel If you think so, it's probably true.
 
My algorithm is fairly naive, with a couple of tricks thrown in. There are always more tricks, even if I can't find them.
 
0
Q: Check over hand values for single-suited Mahjong

Sp3000Mahjong is a tile game that is immensely popular in Asia. It is typically played with four players, and the goal of the game is to be the first person to complete a valid hand using the tiles. In mahjong there are three tile suits plus honour tiles — for this challenge we will only consider hands...

 
5:40 PM
@NewMainPosts What, no tag?
@BrainSteel I'm not really sure what your code does, tbh.
 
:P
 
I guess someone doesn't want to be whacked with a trout >.>
@Dennis Want me to write up an explanation?
(I'll have to remember how it works)
 
A brief summary of the algorithm would be great.
 
I'll try and get that done today ;)
 
Thanks!
 
5:50 PM
@Sp3000 What, no tag?
 
You can add it if you love trouts that much ;D
 
people, spam @Sp3000 with this ^ question
I am not gonna play the hero here
 
That's okay, we'll edit it in after @Geobits makes it an official thing. Right, Geobits?
 
sounds like a plan
 
Then Doorknob can't blame us.
 
5:54 PM
Don't worry, even if he blames us, we can back-blame him for not being around :P
115YKk
 
6:16 PM
best idea I ever had: github.com/phase/fifth/commit/…
 
6:53 PM
Hmm no Golfscript answer for the antiferromagnetism question yet?
I'd give it a go but I've already added two answers...
 
7:32 PM
@BetaDecay I might do one
 
7:47 PM
@Phase Go for it :D
Shouldn't be too hard to get a short one
 
 
2 hours later…
9:37 PM
@Sp3000 someone came this close to beating you to the bounty...
 
0
Q: MS Paint is underrated

grovesNLMS Paint was always a great time waster, but it was shunned by most graphic designers. Perhaps people lost interest because of the jarring color palette, or because of limited undo levels. Regardless, it's still possible to generate beautiful images with just the standard brush and default color ...

 
10:01 PM
@NewSandboxedPosts I updated this challenge, and will probably post it in about 24 hours
 
 
2 hours later…
11:31 PM
0
A: Sandbox for Proposed Challenges

Nathan MerrillHow to Create Your Own Dating Website Dating websites make lots of money. You want lots of money, so you're going to make a dating website. However, we all know that the most important part of any dating website is the algorithm, so you need to build that first. When your customers will sign ...

 
11:50 PM
1
Q: Sum of smallest prime factors

Nicolás SiplisSF(n) is a function which computes the smallest prime factor for a given number n. We'll call T(N) the sum of every SF(n) with 2 <= n <= N. T(1) = 0. T(2) = 2. T(3) = 5. T(10000) = 5786451. The winner will be the one who manages to compute the largest T(N) given 25 seconds of runtime. Each pro...

 

« first day (1625 days earlier)      last day (3223 days later) »