@El'endiaStarman not really. I had a lot of "things" working in an older version of Processing, but it never reached a "playable" version. I guess I figured it wasn't worth my time to finish a prototype until I was sure I would have access to the resources needed to make it "good", and then the huge sweeping update to Processing came out and I never took the time to learn it and update the code to work with it
code-golf
{{Meta: a double enclosure {{...}} means a meta comment.}}
The cosmic number!
There is an old comic strip that relates to this challenge. I've written a blog post on it, as well.
So, your task is to print the steps to get to the cosmic number. To get there, one simply counts the numb...
you know what would be fun: a golfing language with the succinctness of julia or apl, but which is as hard to code in as, say, brian and chuck. (is that a contradiction in terms?)
Colonies of bacteria labelled 1 through 9 live on a segment of equally-spaced cells, with empty cells indicated by 0
0 0 2 0 0 0 1 2 0 0 3 3 0 0
Every second, each colony spreads to adjacent empty cells. If two colonies reach an empty cell at the same time, the larger-numbered colony takes it....
Challenge idea: self-deleting quine: write a p_1 which outputs p_2 which outputs p_3...creating a sequence such that for all p_n, len(p_n)>=len(p_{n+1})>=1, where scoring is done as len(p_1)/(smallest i such that len(p_i)==len(p_{i+1}))
wait that's a terrible idea, since it's surely possible to write a program where appending a byte always gets a smaller score
Sounds like something where we’ll get programs that get progressively smaller by 1 character within some literal string of sorts until that string is empty
well, what works decently, though not perfectly is aiming to the side of the singularity so that you slingshot into a strafe, and then unloading across the entire screen
@FlagAsSpam In facts, crowd psychology covers a large domain, but this point in particular is quite interesting. Maybe one part of the psychology I like the most
The challenge is simple:
Write a function or program that takes an input x, and outputs the lower case alphabet if x is part of the lower case alphabet, outputs the upper case alphabet if x is part of the upper case alphabet and outputs just x if it's not part of either.
Rules:
The input can ...
Capsa, a card game KotH!
king-of-the-hillcard-games
Capsa, known by many times, including the name Big Two in English, is a popular card game in East Asia and South East Asia, especially throughout China, Hong Kong, Indonesia, Macau, Malaysia, Singapore and Taiwan. There are many variations and...
Yes, number of rounds won and lost. Which should be interesting, since you can have a good bot lose on a bad hand (seen from many times I've played this game
I didn't include that detial yet, because I don't have the Java yet. Speaking of which...
@MartinBüttner I don't remember if it was you that offered to help with the KotH, but if so, I've put the rules in the sandbox (see above)
As said in the post, there are a gigantic number of variations (just look at the Wikipedia link I used), but I used the one that was close enough to the version I play, but not too hard for the eventual coders.
I wish I could travel a little more. I haven't been outside the Jakarta Metropolitan Area in ... might be three years now. (Unless my university is technically outside it. In which case, I haven't been more than 50 km from my house in three years)
@mbomb007, @NinjaBearMonkey, @randomra, @Sp3000, @TheNumberOne, @Dennis, @DigitalTrauma: calling all semi-regular Retina users. I'm going to add more character classes to T-mode next, and could use some feedback what you'd find useful. I'll probably at least add letters, vowels, consonants, each as lower and upper case variants. also thinking about this: github.com/mbuettner/retina/issues/27#issuecomment-144435706
This challenge consists of two parts. The winner will be the solution with the lowest total byte count. The same language must be used for both challenges.
Part 1:
Write a function or program that takes a sentence with only valid words as input, and outputs a list of the used characters, the nu...
^ this is why I don't like squeezing two challenges into one post. I'm pretty sure the first part is a duplicate, and it doesn't affect the second part at all :/
It seems to me that we don't get as many questions on PPCG because the barrier to asking is higher. Thinking of and writing up a good question is difficult anywhere, but on here it's even more so
Browser identifier
code-golfjavascript
There are three major browsers at the moment, Internet Explorer, Google Chrome and Firefox. Sometimes, the JavaScript engines inside of these browsers work a bit differently, and that can break some applications. Therefore, we need a way to identify what b...
Edit Distance of the Words in a Story
code-golf string
This is a multi-step challenge.
Your program must read from this file [pastebin of Project Gutenberg's version of Hound of the Baskervilles to follow]
In any order a) remove anything that isn't a letter, a number or an apostrophe ', b) ma...
not sure how I feel about it. if we had a plain Levenshtein challenge, I'd consider it a duplicate, because I don't think the additional string processing, and the loop over all words adds anything interesting. however, I can't find a plain Levenshtein challenge (although we have edit distance without substitutions), so I'd probably prefer having that without all the fanciness around it.
sounds like a better plan, but I can't tell how much difference there is between edit distance with and without substitutions. I think @PeterTaylor would know though.
Explanation
The edit distance between two strings is a function of the minimum possible number of insertions, deletions, or substitutions to convert one word into another word.
Insertions and deletions cost 1, and substitutions cost 2.
For example, the distance between AB and A is 1, because d...
I kind of get what you mean, but I actually thought it would be a nice challenge.
The part where the output must be exactly the format you need as input is actually a very important part of the challenge, and I can't imagine challenges where this could result in being a duplicate...
I would agree with you if that part was disregarded...
Levenshtein Distance of the Words in a Story
code-golf string
The Levenshtein edit distance between two strings is the minimum possible number of insertions, deletions, or substitutions to convert one word into another word. In this case, each insertion, deletion and substitution has a cost of ...
I think the second challenge will require so many bytes that a few bytes to match up the formats will be quite negligible. (in general, I can see how matching formats could be an interesting twist for linking up challenges, but I don't think that it matters very much here.)
Well, I'll keep it there a while to see if others find it interesting. Maybe I'll end up just deleting it later if not. Maybe I'll try to come up with an interesting one with the matching format twist another time.
It took a lot of time, so the response was a bit disappointing =/ Well well... =)
happens... took me forever to write the controller for Domino Circuits and I only got one answer which was actually written in parallel with the controller while it was in the sandbox.
Rational Number to Repeating Numeral Conversion
code-golf math number-theory restricted-complexity
I'm thinking about writing a rational to repeating numeral conversion challenge; for example, given the input 1/6, the output should be 0.1(6).
Looks like we already have a similar challenge, howe...
@Rainbolt Outlook account (using an exchange server for instance) does the same thing. My phone, PC at home&work are permanently connected to my mail box
I am trying to make a c# puzzle where you have to guess the output of the method. I am obfuscating it to make it difficult by using underscores for variable names, doing some messy recursion within string interpolation and also a bit of bit twiddling. I am just wondering if anyone has any ideas o...
Forgotten Realms date calculator
code-golfdatekolmogorov-complexity
In an effort to level the playing field between languages with built-in date libraries and those without, let's work with a fictional calendar. The Forgotten Realms are a (the?) campaign setting for Dungeons & Dragons. Of cours...
@Sherlock9 there are several possibilities depending on whether you want to restrict to a single language, or allow any. whether you want a convenient interface. whether it needs to be fast or not. whether it should run directly in the browser. etc.
a) Participants implement an interface in the same language as the controller and compiled into a single program that runs everything. Pro: fast, convenient, simple. Con: restricted to a single language. b) Participants write a program which computes a single move based on some input given via command-line arguments. Every turn, each bot is invoked. Pro: Reasonably simple interface. Allows arbitrary languages. Con: Slow. c) Participants write a program which is invoked once and keeps waiting for input from STDIN to produce a new move on STDOUT (in a loop). Pro: Reasonably fast. Allows arbit…
There are also hybrid solutions, where the main mode is to implement an interface in the same language, but you also implement that interface via calling a separate process so that people who don't know the language can write a bot in another language and still participate.
> Footnote: I came up with this when xnor complained that every single date challenge needs the leap year computation. I've failed in eliminating it completely, but at least it's only a single modulo in this calendar.
{["Deepwinter" 30
"Midwinter" 1
"The Claw of Winter" 30
"The Claw of the Sunsets" 30
"The Claw of the Storms" 30
"Greengrass" 1
"The Melting" 30
"The Time of Flowers" 30
"Summertide" 30
"Midsummer" 1
"Shieldmeet" 1
"Highsun" 30
"The Fading" 30
"Highharvestide" 1
"Leaffall" 30
"The Rotting" 30
"The Feast of the Moon" 1
"The Drawing Down" 30]2/\4%!{A/~(;+}|}:M;
'1l", "/+-3>~~;;:YM{1$a&}#YM<1f=1b\;\~+Y365*Y3+4/++(l~+365 4*)md\4*\_365>{366-\)\365md@@+\}&)1$M{_0=1=2$<}{(1=@\-\}w0=~2<{\;}&]:\" DR"+]", "*
In an effort to level the playing field between languages with built-in date libraries and those without, let's work with a fictional calendar. The Forgotten Realms are a (the?) campaign setting for Dungeons & Dragons. Of course, they have their own calendar. (It's called the Calendar of Harptos,...
code-golf
{{Meta: a double enclosure {{...}} means a meta comment.}}
The cosmic number!
There is an old comic strip that relates to this challenge. I've written a blog post on it, as well.
So, your task is to print the steps to get to the cosmic number. To get there, one simply counts the numb...
Colonies of bacteria labelled 1 through 9 live on a segment of equally-spaced cells, with empty cells indicated by 0
0 0 2 0 0 0 1 2 0 0 3 3 0 0
Every second, each colony spreads to adjacent empty cells. If two colonies reach an empty cell at the same time, the larger-numbered colony takes it....
The challenge is simple:
Write a function or program that takes an input x, and outputs the lower case alphabet if x is part of the lower case alphabet, outputs the upper case alphabet if x is part of the upper case alphabet and outputs just x if it's not part of either.
Rules:
The input can ...
Capsa, a card game KotH!
king-of-the-hillcard-games
Capsa, known by many times, including the name Big Two in English, is a popular card game in East Asia and South East Asia, especially throughout China, Hong Kong, Indonesia, Macau, Malaysia, Singapore and Taiwan. There are many variations and...
pommitedData <- data.frame()
if(exists(c("errCoverPeriods","missingEndCover","missingStartCover","errClasses","missingClasses"))){
pommitedData <- rbind(errCoverPeriods,missingEndCover,missingStartCover,errClasses,missingClasses)
}
Browser identifier
code-golfjavascript
There are three major browsers at the moment, Internet Explorer, Google Chrome and Firefox. Sometimes, the JavaScript engines inside of these browsers work a bit differently, and that can break some applications. Therefore, we need a way to identify what b...
Explanation
The edit distance between two strings is a function of the minimum possible number of insertions, deletions, or substitutions to convert one word into another word.
Insertions and deletions cost 1, and substitutions cost 2.
For example, the distance between AB and A is 1, because d...
Rational Number to Repeating Numeral Conversion
code-golf math number-theory restricted-complexity
I'm thinking about writing a rational to repeating numeral conversion challenge; for example, given the input 1/6, the output should be 0.1(6).
Looks like we already have a similar challenge, howe...
