Since Perl is the only language I know at a non-total-newbie level, I should make a Perl-only KOTH. I'm not sure if very many people would would participate, though.
@PhiNotPi If you're writing the controller in Perl, I'd suggest handling communication with the bots via command line. Each bot is a script (as in Caveman Duels) and you call it each turn with the history as command line arguments, then you read the response from their STDOUT.
I just posted a simple strategy yesterday, that gets the 1024 tile and some 3000 points (which is not the score you'd have in the game though), but that's not the optimal strategy anyway, that was just to get something working at all
I almost got the 8k tile once, and the 4096 tile quite regularly
once you figure it out you can get to 2048 pretty much every time
the annoying thing is just that obviously the game length also doubles with each new tile you want to achieve, so when you're going for 8k the game can easily take 45 minutes or an hour
the other is that once you fill one row (say the bottom row, if your highest tile is in the bottom left corner), then you keep your next-highest tile in the bottom right corner so you basically create a snake through the grid
Your task is to build a program (using only printable ASCII characters and/or tabs and newlines) that prints out exactly the characters in the printable ASCII space (0x20 to 0x7e) that don't appear in your program's source code (in any order, however many times you want).
The shortest code to do...
@MartinBüttner not good, the 4-bit parity checker has taken 2.5hours already, I'm pretty new to this whole solving thing, but I can't shake the feeling I'm doing something completely wrong xD
I think it's time to make use of a good old HashTable
also not quite true, because a) there could be a closer pair that has to travel further because they are swapped and b) the could both move all the way through the array ^^
This is an Idea for a code-golf challenge
When was the last time the date was divisible by n?
A date can be represented by an unsigned integer as such: YYYYMMDD. What you need to do, is write the shortest program that figures out when a the date was divisible by a give number n. And then return...
@Geobits I've edited Underwater (the mines). For now I only made their AoE only 3x3x3 because otherwise only the middle layer of shark zone is safe from them... that seemed a bit tough
@overactor I don't think it makes a difference... in the end, I'll iterate through the dates using a date-library, convert each date to the required number and abort when I find one that's divisible
@Geobits I think I need to redefine the hunting behaviour of jellyfish though... the easiest thing seems to be to say that they always keep their up-up-down-down pattern, but if there's an animal in any of the 9 relevant cells, it will pick that cell instead of its default pattern
@overactor I prefer to be liberal with that so as not to punish languages which have long keywords for functions or a hard time reading from STDIN. let me fish out an example spec from one of my challenges
Given a setup of dominoes your task is to figure out which dominoes fall and which don't.
Input
Take a rectangular ASCII representation of a domino setup. The following characters are used for the ASCII grid:
(space): empty cell
|, -, /, \: dominoes
Dominoes can fall in 8 directions, which...
But do they go back to the previous space and resume the pattern, or resume it from where the prey was? The latter would allow them to drift out of their zone.
(subtly promoting my question once more before the bounty ends tomorrow)
@Geobits they would have to go back (which wasn't specified). but specifying that seems hard than just saying: they always do up-up-down-down. if there's a neighbouring animal in the destination layer, go there. otherwise go randomly diagonally when going up or straight down when going down.
This is an Idea for a code-golf challenge
When was the last time the date was divisible by n?
A date can be represented by an unsigned integer as such: YYYYMMDD. What you need to do, is write the shortest program that figures out what was the last time the date was divisible by a give number n ...
sorry, it's an expression I use, I'm not sure if other people use it who are not in my circle of nutty friends, it doesn't mean anything, it's just an acknowledgement
This is an Idea for a code-golf challenge
When was the last time the date was divisible by n?
A date can be represented by an unsigned integer as such: YYYYMMDD. What you need to do, is write the shortest program that figures out when a the date was divisible by a give number n. And then return...
Given a setup of dominoes your task is to figure out which dominoes fall and which don't.
Input
Take a rectangular ASCII representation of a domino setup. The following characters are used for the ASCII grid:
(space): empty cell
|, -, /, \: dominoes
Dominoes can fall in 8 directions, which...
