« first day (1351 days earlier)      last day (3507 days later) » 

12:34 AM
@Geobits wrote up a spec for that ^. let me know what you think
 
 
4 hours later…
4:21 AM
First answer on somebody else question on PPCG :P
 
 
5 hours later…
8:54 AM
0
A: Sandbox for Proposed Challenges

Beta DecayNotes to Tabs code-golf kolmogorov-complexity Challenge Given a list a notes, you must return the corresponding tablature. Notes The notes must be in the range of A to G inclusive and the octave range being 2 to 7 inclusive. The format is note-octave with # representing a sharp and b represe...

 
 
3 hours later…
11:30 AM
Free challenge idea for someone to take: Create a Wireworld interpeter (is that what you'd call it?)
And award a bounty for someone who bootstraps it
 
12
Q: Simulate the Wireworld cellular automaton

PhiNotPiWireworld is a cellular automaton that was designed to be resemble electrons flowing through wires. Its simple mechanics allow the construction of digital circuits. It has even permitted the construction of an entire computer. Your mission is to create the shortest Wireworld implementation in y...

 
Oh wow, I thought answers would be longer..
 
I wonder if one could figure out the rule to implement it with Mathematica's CellularAutomaton
 
There might be a simpler way though... most cellular automatons can be encoded in a single number
 
11:49 AM
Ahh.
 
 
4 hours later…
3:34 PM
0
A: Sandbox for Proposed Challenges

Beta DecayPFD, HCF & LCM code-golf math Challenge Given two numbers, you must find the prime factor decomposition (PFD) of the two numbers, then using the PFD of each number, calculate the highest common factor (HCF) and the lowest common multiple (LCM). Examples Input: 20, 40 Output: 20= 2^2 * 5 40 ...

 
3:58 PM
@MartinBüttner I'm going to give a talk on Marbelous at a small unconference in Boston today
 
@Sparr sick :D
what's the conference?
 
Barcamp Boston
gonna quickly go over stackexchange, PCCG, this room, genesis of the language, spec development, and then a bunch of the existing examples
with any luck I might snare another developer :)
 
sweet :) let me know how it goes!
I still really want to write a JS-based interpreter, because that could really kickstart writing nice tools
but I have no idea when I'll ever have the time for that
if I actually find any free time this (academic) year, first I want to spend it on turning one of my game prototypes into something releasable
 
 
2 hours later…
6:02 PM
@BetaDecay How come you deleted and reposted that sandbox post instead of editing it?
 
6:34 PM
@MartinBüttner Something went weird and posted it before I was done. I finished it then posted it, realised it's been posted already and deleted it
 
ah, I see
I was just wondering
 
7:25 PM
@PeterTaylor regarding your comment, smallest score wins on that challenge
the actual problem is that a negative score is better than a positive score
 
7:36 PM
@BetaDecay One would think that they would be higher voted as well (hint, hint!) ;)
@MartinBüttner Ah, ok.
 
@PeterTaylor apart from your usual issues with popcons, can you see any problems with this proposal? ;)
 
Sorry, I need to send about 25 e-mails before I can look at it.
 
oha
no rush!
 
7:58 PM
@Doorknob the sandbox got unfeatured
 
8:09 PM
@PeterTaylor Haha :) Probably one of the longest golfscript programs
 
0
A: Sandbox for Proposed Challenges

MOnsDaRProgram to solve a Tetris puzzle The challenge is about finding an optimal solution on how to place a number of given shapes. It is oriented on the principle of Tetris, where it is optimal to pack the given pieces as tight as possible. These are the rules: There are predefined Tetris shapes...

 
8:29 PM
@MartinBüttner "Each event is either a list of dying characters, or a list of groups of characters (signifying which characters are currently together)". I presume that [[0],[1,2,3],[4],[5,6],[7,8,10,11,12],[9],[13]] means that characters 0, 4, 9, and 13 are each alone but alive. That could be clearer. Even more importantly, you could clarify whether the "together" lists in which a character appears will be contiguous; and whether it's guaranteed that all characters appear in the first one.
 
not sure what you mean by contiguous, but you're right about the rest
if you just mean whether each character appears in each grouping, then yes, as long as they are alive
I've got a reference implementation in Mathematica, which satisfies exactly the minimum requirements and nothing more
 
Yes, it's fundamentally a question about the minimum amount of state which needs to be tracked.
The other thing is that you might want to mention that output can be vector or raster graphics file or display on screen (or whatever subset of that you want to accept).
 
oh, did I forget that? sorry, I'll add it.
 
I'll never get people's voting patterns. You post an answer, spend waaay too much time thinking about how to improve it, and minutes after you do, you get a downvote...
 
@BetaDecay codegolf.stackexchange.com/questions/26128/hunt-the-wumpus has some which are twice as long. And codegolf.stackexchange.com/questions/3485/what-comes-next is one of the longer ones I've written (not counting ones which are mainly a big lookup table).
 
8:40 PM
@Dennis some people...
@Dennis while you're here... is there a short way to reverse an array in CJam? and how is that not a built-in?
 
@PeterTaylor I wonder if anyone's ever written anything greater than 500 chars without any code bloat...
 
@MartinBüttner W% should be the shortest way.
 
ah, that makes sense. thanks!
I forget about %s weird indexing feature
 
@BetaDecay My ungolfed file for Hunt the Wumpus is 6kB. But most of that is comments about the representation of the icosohedral group.
 
@PeterTaylor Wow!
 
9:17 PM
@PeterTaylor thanks for the feedback, proposal updated
the reference implementation is also ready... I guess I might try something new and post it tonight instead of during the busy hours of a weekday
 
 
1 hour later…
10:21 PM
I was thinking about doing a SemVer related code golf, but there's this not particularly well-specified but closely related challenge and I'm not entirely sure how not to make mine a duplicate of that.
@Peter Taylor, Duplicate Police Officer, do you have any suggestions? ^ ;)
Validation isn't too interesting, because there's a fairly simple regex for it. But I think that leaves only comparison and sorting, which are essentially the same. Of course, there's also the possibility for a program that bumps version numbers, but that's also not as interesting as comparison. It's just that that seems very close to the debian versioning one.
 
@Martin Sandbox has been re-featured
 
@Doorknob awesome
 
10:51 PM
@githubphagocyte meta.worldbuilding.stackexchange.com/a/325/234 "part time sporadic temporary" sounds very... committed... :D
Posted it... let's see how this goes:
0
Q: Create xkcd-Style Narrative Charts

Martin BüttnerIn one of the more iconic xkcd strips, Randall Munroe visualised the timelines of several films in narrative charts: Source: xkcd No. 657. Given a specification of the timeline of a movie (or some other narrative), you are to generate such a chart. This is a popularity contest, so the answer w...

 

« first day (1351 days earlier)      last day (3507 days later) »