# Sandbox for Proposed Challenges

This "sandbox" is a place where Code Golf users can get feedback on prospective challenges they wish to post to main. This is useful because writing a clear and fully specified challenge on your first try can be difficult, and there is a much better chance of your challenge being well received if you post it in the sandbox first.

Sandbox FAQ

## Posting

Write your challenge just as you would when actually posting it, though you can optionally add a title at the top. You may also add some notes about specific things you would like to clarify before posting it. Other users will help you improve your challenge by rating and discussing it.

When you think your challenge is ready for the public, go ahead and post it, and replace the post here with a link to the challenge and delete the sandbox post.

## Discussion

The purpose of the sandbox is to give and receive feedback on posts. If you want to, feel free to give feedback to any posts you see here. Important things to comment about can include:

• Parts of the challenge you found unclear
• Problems that could make the challenge uninteresting or unfit for the site

You don't need any qualifications to review sandbox posts. The target audience of most of these challenges is code golfers like you, so anything you find unclear will probably be unclear to others.

If you think one of your posts needs more feedback, but it's been ignored, you can ask for feedback in The Nineteenth Byte. It's not only allowed, but highly recommended!

It is recommended to leave your posts in the sandbox for at least several days, and until it receives upvotes and any feedback has been addressed.

## Other

Search the sandbox / Browse your pending proposals

The sandbox works best if you sort posts by active.

To add an inline tag to a proposal use shortcut link syntax with a prefix: [tag:king-of-the-hill]. To search for posts with a certain tag, include the name in quotes: "king-of-the-hill".

Get the Sandbox Viewer to view the sandbox more easily!

# Merging Words

## Input

Two strings, and two numbers: "hlwl", "elo_ord!", 1 2

These may be function parameters, STDIN or language equivalents.

## Output

The second string merged into the first string. The numbers specify how many characters to add when merging.

This is what happens:

h  l  w  l        //notice there is only 1 char per group (first number)
el o_ or d!      //2 chars per group here (second number)
-------------
hello_world!


More formal-ish procedure:

• Remove the first n chars from the first string and append it to r, where n is the first numerical input and r is the output string
• Remove the first k chars from the second string and append it to r, where k is the second numerical input
• Repeat the last 2 steps until both the first and the second string are empty. You may assume that first_string.length / second_string.length == n / k

## Test Cases

input: aaaa bbbb 1 1
output: abababab

input: abcd iiiiiiii 1 2
output: aiibiiciidii

input: chmeeo aln 2 1
output: chameleon

input: emblem ezzent 3 3
output: embezzlement


This is code-golf, so shortest code wins!

• Does the order of the input parameters matter? Can be input be formatted as something parsable (e.g., "aaaa" "bbbb" 1 1)? Jun 23 '15 at 4:47
• @Dennis The order does matter - start with the first string, and the input can be pretty much anything - I'll clarify that. Jun 23 '15 at 11:20
• FWIW this is 4 characters plus a couple for stack manipulation in certain golfing languages. Jun 23 '15 at 13:29
• What I meant was if the input could be read as "hlwl" 1 "elo_ord!" 2 or 1 "hlwl" 2 "elo_ord!" or even 1 "hlwl" "elo_ord!" 2, for example. Jun 23 '15 at 14:28

# Can you lose from this chess position?

## Introduction

You are an arbiter who supervises a very large number of chess tournaments. Thus, you frequently rule on whether a player who runs out of time may claim a draw based on Article 6.9 of the FIDE Laws of Chess:

[...] If a player does not complete the prescribed number of moves in the allotted time, the game is lost by the player. However, the game is drawn, if the position is such that the opponent cannot checkmate the player’s king by any possible series of legal moves.

In order to be able to perform your job more efficiently, you decide to create a computer program that determines whether it is possible for a player to be checkmated from a given position.

## Regulations

The input will be a position with White to move, with at least one legal move available. You may assume that in the initial position, neither player will retain castling rights and no en passant capture will be available. Additionally, you may assume that the existence of en passant is irrelevant to the correct output. Your program must determine whether, starting from the input position, there exists any sequence of legal moves that ends in Black checkmating White's king.

Either a program utilizing standard input and output, or a function accepting a string and returning a number is acceptable.

Input will be given in FEN notation, but excluding the last 4 tokens – only the locations of the pieces on the board are described.

The program shall output 1 if it is possible for white to be checkmated, or 0 if it is not.

### Restrictions

• Your source code must fit inside a post on this site.
• If the program exceeds 1 minute of thinking about a position, it is equivalent to an incorrect output.

The winner is the first competitor to submit a correct program. A program shall be considered correct if no one provides an input that causes the program to fail to produce correct output in time for three days after the program is posted.

## Examples

Input

kb6/8/8/8/8/8/8/KB6


Output

1


Input

1kb5/8/8/8/8/8/8/KB6


Output

0


Input

3k4/8/1p1p1p1p/pPpPpPpP/P1P1P1P1/8/8/3K4


Output

0


## Feedback

Suggestions for improvement are welcome. I would most like to have some input on the victory condition. Is it too difficult to achieve? Should I score it on a fixed set of positions instead?

• The three day rule is a bad one. If an answer is incorrect, it's incorrect, and the possibility that no-one paid it much attention in the first 72 hours after posting shouldn't change that. Sep 19 '14 at 19:45
• This is interesting. Here's two slightly tricky test cases: 8/8/p1p1p1pk/P1P1P1q1/5P1K/6B1/8/5b2 and 7k/2PPRPRP/p3P1PP/8/8/8/P7/K7. Sep 20 '14 at 15:58
• Hmm so maybe there should be a new rule that you are losing again, if someone provides a counterexample to your program at any date? @Lopsy nice example requiring a bishop promotion :) Sep 20 '14 at 16:18

Am I offering a bite that's more than people are willing to chew?

## Truth Table Solver

### Goal

This code golf challenge is to display a rule that is valid for a given truth table.

### Input

The input into the program is a boolean array, though you may choose how this is formatted (array, string, etc.) Each value in the array is true or false (or 1 or 0 or any other boolean pair). The index of the value represents the truth table inputs and the value itself is the result of applying the unknown rule to these inputs.

For the truth table inputs, A is the least significant bit of the index. B is the second-least significant bit, and so on. The number of indices in the table determines the number of inputs: log2(n).

For example:

index c b a value
0   0 0 0   0
1   0 0 1   0
2   0 1 0   0
3   0 1 1   1
4   1 0 0   1
5   1 0 1   1
6   1 1 0   1
7   1 1 1   1


### Output

Given this truth table, your program must determine the rule is, in this case, (a&b)|c and output it. The variables may be in any order and printing redundant brackets is fine.

### Requirements

Rules may include any of the following operations NOT (~), AND (&), OR (|), XOR (^) and identify priority with brackets.

### Test Cases

Here are some test cases, expressed as a string of boolean results:

0100              (~a)&b
00011111          (a&b)|c
01101000          a^b^c
0000011101110111  (a|b)&(c|d)
0100010100010000  a&(((~b)|c)^d)


### Scoring

The shortest code after two weeks wins the contest.

• The requirement to "support the operation... XOR" doesn't make sense to me. The obvious way to get the shortest program is to output in DNF, and XOR is unnecessary for that. The requirement to "identify priority with brackets" seems to contradict the example output ~a&b. Jul 3 '15 at 6:24
• What happens if a boolean array can be expressed in multiple ways? Do we output all possible options or just one? Jul 3 '15 at 10:06
• If you want to include a specific range of operators without having answers never use some of them (due to DNF as mentioned by Peter Taylor), you could require the shortest rule, instead of just any rule that works. Jul 3 '15 at 16:01
• Thanks for the feedback! After reading about DNF, I see now the easiest solution is to simply output every "true" row of the truth table which makes this purely an exercise in data transforming, not problem solving, eg. (a&b&~c)|(~a&~b&c)|(a&~b&c)|(~a&b&c)|(a&b&c) Jul 5 '15 at 23:32
• I want to take this one. Jan 1 '16 at 0:01

# Translate Treehugger to BrainF**k

### Overview

This problem deals with two esoteric programming languages that I will briefly describe for completeness.

Brainfuck is a language that has only 8 commands. Imagine a tape of values (generally 0-255) stretching infinitely to the right, initialized to zero, and an instruction pointer P pointing to the first element:

|-----|-----|-----|-----|-----...
|  0  |  0  |  0  |  0  |  ...
|-----|-----|-----|-----|-----...
^
P


The eight commands effect the pointer and tape in the following way:

+ ===== increment the value that P currently points to
- ===== decrement the value that P currently points to
, ===== read a byte from stdin into the location that P points to
. ===== output the value that P points to as an ASCII character
> ===== move P one cell to the right
< ===== move P one cell to the left
[ ===== if the value pointed to by P is zero, jump past the matching ] ( while(*P){ )
] ===== if the value pointed to by P is non-zero, jump to the preceding [ ( } )


Some finer points, for the purposes of this question:

• Adding one to 255 yields 0, and decrementing 0 yields 255.
• Moving left off of the tape causes the program to abruptly halt.
• All [ must be matched with a single ]. They may be nested.

Treehugger is a language derived from Brainfuck, but differs greatly in how memory is stored. Instead of viewing memory as a tape, view memory as a binary tree that expands infinitely downward:

       P
v
0
0---/ \---0
/ \       / \
0   0     0   0
.   .     .   .
.   .     .   .
.   .     .   .


P begins at the top of the tree, and again all values are initialized as 0. Most of the commands are exactly the same as corresponding Brainfuck commands, but there are two differences:

< ===== move P down the left branch of the tree once
> ===== move P down the right branch of the tree once


There is also one new command:

^ ===== move P one node up the tree


It is simple to translate Brainfuck to Treehugger by replacing every < with a ^. Translating Treehugger to Brainfuck, however, is far more difficult.

### Input

Your program or function will take in a list of characters from +-<>^,.[], representing a complete Treehugger program.

• You may assume that the input ends in some terminating character, like a newline or EOF.
• You may assume that, other than the optional terminating character, every character is one of the 9 commands.
• The Treehugger program will have balanced [ and ].
• The Treehugger program will not attempt to move up one node from the top of the tree at any point.
• The Treehugger program will never contain a , character inside of a [] loop. The program will always take a finite, known number of input bytes.
• The Treehugger program will terminate for all inputs.

Input must be taken as a string of characters through stdin or a function argument.

### Output

Your output should be a functioning Brainfuck program that takes the same number of inputs and provides the same output as the corresponding Treehugger program. Brackets must be balanced, and the code must never move left off of the tape. Your Brainfuck program must terminate.

### Rules and Scoring

Your score for this challenge is:

Length of your code + 0.1 * the length of each test case's output

Lowest score wins!

Standard Loopholes are disallowed.

### Test cases

Coming soon to a challenge near you...

Is this interesting?

Too easy/hard?

Is the scoring system appropriate?

• I do not think this is possibly. And lol "Soon" Aug 9 '16 at 1:01

# Proposed King-of-the-Hill: Synchronous Bughouse Chess960

I have an idea for what I think could be a fun and somewhat different KOTH contest. However, before I put in the work writing explicitly detailed instructions and writing/deploying a test server, I want to make sure that (a) there will be sufficient interest to go through this effort and (b) the best way to design the contest and restrictions if people would like to play.

Chess960 is a chess variant in which the starting positions of the back-rank pieces are randomized with constraints such that there are 960 possible starting positions. Bughouse chess is a team-based chess variant played asynchronously on two boards in which teammates hand the pieces they capture to their teammates to potentially drop on the board.

Synchronous Bughouse Chess960 (SBC960) is a chess variant I developed to combine these two variants and to impose some synchronization rules to make it suitable for a tournament. Each of the two boards is set up independently using the rules of chess960 of the other (thus making for 921,600 overall starting positions). Game play is organized into orderly rounds during which each player takes his turn in the following order: team 1 white, team 2 white, team 1 black, team 2 black. On a player's turn, he may move a piece according to chess960's rules, drop a captured piece according to bughouse chess's rules, or delay.

Each player starts the game with five delays. When a player uses a delay, his opponent's next turn is skipped (at no cost to the opponent other than perhaps momentum). Delays are legal moves. Play continues until a player has no legal actions when his turn in the round comes up (no legal moves, no legal drops, and no remaining delays). When that condition comes, the outcome of the game is determined by whether that player is in check. If so, the team who has checked the player wins. If not, the game ends in a draw. For convenience, a position is only considered "checkmate" if a player is in check and has no legal moves left.

My KOTH tournament idea is to have players design AIs to play SBC960. I think this game has some interesting possibilities because of the team-based play. For example, rushing for the win on one's board might be a losing strategy for a player if the other team can checkmate his teammate faster. It might also be viable for a player to allow himself to be checked toward checkmate if one's teammate can achieve checkmate before that player runs out of delays. Also, the many starting positions makes it impractical for anyone to write an entry that uses opening libraries.

So, the first question is:

1) Would anyone be interested in participating in an SBC960 tournament? If at least four people would compete, I am willing to put in the work to get this together

If people are willing to play, then I need to know the best way to structure the rules for the entries. This entails the server-client interface (STDIN/STDOUT? sockets with TCP/IP?), whether to permit people from designing AIs that think when it is not their turn, and whether I should have an official "pre-play" round so that AIs can learn how the other entries play. I see the opportunity to make a KOTH that is different than most of the KOTHs on the site, but I want to know:

2) What are people's recommendations for the best way to design the entry rules?

I would appreciate any feedback.

• Team KotH is tricky. The only way that I think you really get to assess each answer's strength is to play with homogeneous teams: i.e. two of Alice's bot (one white, one black) vs two of Bob's bot (one white, one black). Jul 21 '15 at 17:32
• @PeterTaylor I had intended to use homogenous teams for at least some of the games to act at least as a tie-breaker. I think it might be possible to use ANOVA to determine how much an AI's results correlate to its abilities. Of course, I'd have to relearn ANOVA to determine whether this thought is correct. Jul 21 '15 at 18:45

# Vowel-Consonant Imbalance

Sandbox question: Is it too easy/too close to an existing question? Related ones I found: Find words containing every vowel and Finding the most 'unique' word

You should write a program or function which receives a list of space-separated words as input and outputs or returns one of the words with the greatest difference between its vowel and consonant counts.

E.g.

"cars" has 1 vowel and 3 consonant so the difference is 2
"queue" has 4 vowels and 1 consonant so the difference is 3


If multiple words have the same maximal difference, exactly one (any of them) should be returned.

todo

todo

## Examples

todo

This is code golf so the shortest entry wins.

• IMO this is too easy, but if you decide to post it then it needs an unambiguous working definition of "vowel". I assume that input can be mixed case, but e.g. is y a vowel or a consonant? (If you want to be realistic then the answer is "It depends", but I'm not sure I could write a clear and accurate spec for when it's a vowel). What about accented letters? Jul 22 '15 at 6:01
• @PeterTaylor Thanks, if I post it, I will clarify these. Input will be only lowercase letters and spaces. Vowels will be aeiouy. But it is really easy. Maybe I'll post it on a very slow day once... Jul 22 '15 at 10:48

# CJam Expander

Input: a program written in CJam. You can accept input however you'd like.

Output: the same program ready to be put into a PPCG answer. You must:

• Not change the horizontal position of any token in the program.
• Put each token one line below the previous one except } which must appear on the same line as the corresponding {. The token immediately following a } will be one line below the }.
• For this challenge, every letter is considered a token except literal strings and numbers which count as one token regardless of character length.
• Add e# to the end of every line. The e#s must line up vertically two spaces to the right of the last character in the program.
• Either prefix each line with four spaces or surround your output with <pre> and </pre>.

## Example:

Input: 4,{"Happy Birthday "\2="Dear CJam""to You"?N}%

Output:

    4                                               e#
,                                              e#
{                                         }   e#
"Happy Birthday "                         %  e#
\                           e#
2                          e#
=                         e#
"Dear CJam"              e#
"to You"      e#
?     e#
N    e#


## Bonus:

If you output a header and footer like the one below, multiply your score by 0.8. Using the same input, here is an output that qualifies for the bonus:

#CJam, 46 bytes

4,{"Happy Birthday "\2="Dear CJam""to You"?N}%

Explanation:

4                                               e#
,                                              e#
{                                         }   e#
"Happy Birthday "                         %  e#
\                           e#
2                          e#
=                         e#
"Dear CJam"              e#
"to You"      e#
?     e#
N    e#

[Try it online.][1]



Of course, you have to adjust the byte count to match the input. You are not required to make a working link for the online demo (although that would be cool).

• Similar, but with different I/O format and language specificity. Jul 21 '15 at 17:19

# Sort a CSV list by key...imperfectly.

Anything I missed and/or overlooked here? I'm pretty sure I closed up most of the holes here. Also, what is there that could use some improvement?

Another question: would this be better tagged as ?

# Introduction

You are working for some company you can't stand, two-week notice already turned in, and you've just been tasked with sorting all the CSVs the company has gathered over the years. This doesn't sound like much, except your boss, whom you also don't like, has demanded you implement your own sort. He doesn't care about Big-O whatever (he has never even heard of the term), but he just wants it done. You want to get back at him for making you do this, so you want to make that sort imperfect. At least you know he won't have time to check it until you're gone.

# Objective

Your task is to write a program that sorts a CSV table (incorrectly), by key.

A correct program for purposes of this challenge:

• doesn't use one of the tried-and-false, unfunny techniques.
• takes two arguments (in order): the key to sort by, and optionally a separator, defaulting to a comma (,).
• takes the CSV via standard input, in the following format:
• Each row is separated by a Unix-style line feed.
• Each entry within each row is delimited by the separator.
• Each entry is unquoted/etc. It is solely delimited by the separator.
• Each entry may be assumed to not contain an instance of the separator or a newline.
• The first row indicates the key names. The successive rows are the data that needs sorted, by key
• emits the sorted CSV via standard output.
• The emitted data must also adhere to the above format, including the separator. It must be syntactically correct.
• looks completely innocent, despite being completely and totally wrong. That's the underhanded spirit.
• Please don't use Unicode lookalikes. It's not funny nor original, especially after seeing it multiple times on a single question.

In this case, the values for the key key are 1, 2, and 3.

foo,key,value
spammer,1,32nefr2u34
ball,2,304u23rne2
blarger,3,32o4u3jnk4


# Invariants

• The input CSV is assumed to be correct, including each row having the same number of entries. At least they weren't made by such air-headed people.
• The entries may have varying lengths.
• The associated values for the key is assumed to be a float (decimal not required) in textual form, base 10.
• The list may vary in length.

# Requirements

• At least 1% of the list must vary from the "correct" output every single time. This may mean entries that are out of order, lost, or corrupted. This may also include entire columns going missing (in which 100% is "incorrect").
• This is only required when there are at least 4 entries in the input.
• The keys themselves are not counted as part of the list, but they don't necessarily have to remain intact.
• It must print at least 50% of the data it took in, but more than 100% of the original is permitted.
• As a special case, empty stdin allows empty stdout, and input just consisting of the headers may simply print just headers coming out.
• The program must have no other external side effects other than what is required to do the above.

# Other information

• The sorting algorithm is up to the implementation. It doesn't matter, as long as it sorts, the sort is stable, and the algorithm's complexity is bounded (i.e. no Bogosort, infinite loops, etc.).
• No other features may be added, including a help message.

# Example

Input:

foo,key,value
ball,5.2,304u23rne2
spammer,1,32nefr2u34
blarger,3.1,32o4u3jnk4


Output (correct):

foo,key,value
spammer,1,32nefr2u34
blarger,3.1,32o4u3jnk4
ball,5.2,304u23rne2


Output (passes this challenge):

foo,key,value
spammer,1,32nefr2u34
ball,5.2,304u23rne2
blarger,3.1,32o4u3jnk4


The person with the highest number of votes wins!

• The spec as written seems to allow emitting the empty string as the only output. Jul 20 '15 at 13:21
• @PeterTaylor Good catch... Jul 20 '15 at 13:24
• Most underhanded questions are tagged as both underhanded and popularity-contest. Since the winner is determined by the number of votes, I'd use both tags, and drop code-challenge. Jul 21 '15 at 6:46
• @es1024 Done. <filler text> Jul 22 '15 at 4:10

# Save the bunny!

This King of the Hill competition is about a 2D flawn populated with bouncing balls and bunnies. The balls will collide with each other and the boundaries. If a bunny gets hit by a ball, it´s dead teleported away (for cuteness sake).
Your task is to write a AI for the bunnies, such that they live as long as possible.

### The AI:

The AI shall be a C++ Class with a constructor that takes a pointer to the array of balls and a function that returns the direction the bunny should go as a angle. Of course AIs that modify the game will not be accepted. @ Meta: Will be more specific once the framework is finished.

### Scoring:

Competitions will be run on several dates based on the valid submissions, after that the video will be posted on Youtube.
To minimize randomness, there will be several runs and a 3 second spawn protection.

## Meta

I will do the framework in the next few weeks and enhance this post with pictures, source code and more specific stuff. Is the basic idea clear?

• Say two bunnies are really good at dodging and just plain don't get hit. Is there a time limit (to tie), or how do you ensure there is just one winner? Jul 24 '15 at 12:39
• I will increase the number of balls, until they die Jul 25 '15 at 9:36
• I was hoping (hopping...?) it would be something like that :) Jul 25 '15 at 14:20

# Weight Configuration

## Introduction

Gyms have machines that contain a stack of weights and a pin. You insert the pin into the hole that matches the amount of resistance you want, and then you work out. However, the machines often have an additional set of smaller weights at the top that are pinned onto a fixed piece of the machine; you can unpin these weight and slide them down to sit on top of the big stack to add a few more options for your workout. In ASCII form, these weight stacks look something like this (this one is annotated):

-----------   }- top of stack, always required
___|___|___   \
|____5____|   |
___|___|___   |
|____5____|   |
|   |      }- "neck" section
|   |      |
|   |      |
__|___|__    /
_|_____o_|_   \
|_20___o__|   |
|_30___o__|   |
|_40___o__|   }- weight stack
|_50___o__|   |
|_60___o__|   /


...and so on. Notice that there is a smaller block on top of the big stack that has no number; putting the pin in this block means there is no extra resistance beyond the base amount the machine provides. If you wanted to exercise with only 5 or 10 resistance on this machine, you would put the pin in this block and then unpin one of the extra weights.

## Challenge

Given the number of small weights on the machine, the configuration of the large weights, and the level of resistance someone wants to work out at, you must output a picture of the correct configuration of weights so that the given resistance is met. The small weights always have a value of 5 (pounds, kilos, stones, whatever). For example:

### Input:

3 [20,30,40,50,65,80,100] 45


### Output:

-----------
___|___|___
|____5____|
___|___|___
|____5____|
|   |
|   |
|   |
|   |
___|___|___
|____5____|
_|_____o_|_
|_20___o__|
|_30___o__|
|_40___O__|
|_50___o__|
|_60___o__|
|_70___o__|
|_80___o__|
|_90___o__|
|_100__o__|


One of the 5 weights has been unpinned and now sits on the stack; the 40 weight has the pin in it (as denoted by the capital O). Another valid solution would be to put the pin in the 30 weight and slide all of the extra weights down onto the stack, as both would achieve 45. That would look like this:

-----------
|   |
|   |
|   |
|   |
|   |
|   |
___|___|___
|____5____|
|____5____|
|____5____|
_|_____o_|_
|_20___o__|
|_30___O__|
|_40___o__|
|_50___o__|
|_60___o__|
|_70___o__|
|_80___o__|
|_90___o__|
|_100__o__|


Notice the length of the "neck" in both cases of the machine; the number of rows in the neck section must be exactly 2*(number of extra weights)+4. In this case, since there are 3 extra weights, that number is 10. No matter how the extra weights are positioned, there must be 10 rows (because when you slide a weight down the neck, part of the neck doesn't disappear!), and extra weights that are pinned at the top must have a row of neck between them (as in the examples). Since the weights slide down, the lowest weight must be used first, then the next, and so on. All the 5s are centered, and all of the numbers on the large weights are left-aligned to the third column.

## Input specifications:

The three pieces may be inputted in any format you like (newline separated, space separated, list in any format of your choosing, etc), subject to the following restrictions: The number of extra weights is always the first piece of input and will be between 0 and 4. The list of weights is the next input; each element will be between 15 and 200 and a multiple of 5; the whole list may be assumed to be sorted. The target resistance is last and will be between 0 and 220; it will also be a multiple of 5.

## Output specifications:

Output a weight stack as specified above, with the pin in the appropriate place and the appropriate extra weights slid down onto the stack such that the target resistance is met. If the target resistance can't be met with the given configuration, you may either output an unmodified stack (with all extra weights pinned at the top, and no pin inserted), an error message, or nothing. Some resistances have multiple configurations that achieve it; you are only required to output one of them, and your program need not output the same one every time.

### Whitespace:

• Trailing whitespace on lines is okay and need not be uniform.
• Leading whitespace on lines is acceptable as long as the leading whitespace on each line is the same (this doesn't include the whitespace required to draw the neck section or zero-weight pin block).
• Leading and trailing newlines are acceptable.

## Scoring

This is , so lowest byte count wins. Multiply your byte-count by 0.9 if instead of only outputting one configuration when there are multiple solutions, you output all of them (either side-by-side with at least one empty column between them, or one after the other with at least one blank line between them).

Tags:

Suggestions? I think the neck bit is a little confusing and there may be too much going on.

• I think it might be good to show the 30 possibility too, because I'm not sure how the output is supposed to look when you have small weights stacking. Aug 13 '15 at 2:56
• @Sp3000 I edited it to show both versions and I tried to clarify the thing about the neck height. Aug 13 '15 at 3:07
• It's a bit clearer, but I'm still a little confused - does the neck height depend on the number of extra weights (2*(number of extra weights)+4 I'm assuming) or is it always 10? Because "for this reason the extra weights will always be between 0 and 4" seems to suggest the latter to me Aug 13 '15 at 3:11
• (also, as with most ASCII art challenges - are there any rules on leading/trailing whitespace either before/after the entire output or before/after each line?) Aug 13 '15 at 3:11
• @Sp3000 Let me tweak the requirements a bit. Aug 13 '15 at 3:30
• @Sp3000 Okay, I added stuff about whitespace and removed the thing about "for this reason the weights..."; it doesn't really matter why I chose 4 as the maximum, I just thought it might help the reader understand the specifications about the neck. I've personally never seen machines with any number other than 2, but I assume they must exist (and it seems like there wouldn't be any with more than 3 or 4). Aug 13 '15 at 3:46

# Theoretical Analysis of Pulley System

(I think it is gonna be a code golf challenge?)

## Introduction

In rope access and rescue, as well as sometimes in climbing, caving and rock climbing you need to build pulley systems for hauling equipment or rescuing injured people. Here we will look at them from a more abstract perspective. As those systems can get arbitrarily complex we will limit ourselves to a certain class of pulley systems: They are one dimensional (only two opposing directions) and there is only one fixed anchor. Further we assume that there is one piece of load on one end of the rope and unit of force pulling at the other end of the rope.

## Challenge

Write a program that accepts a pulley system encoded as a string (see below) that returns the actual mechanical advantage (AMA) - polynomial.

## Introduction of symbols

• Rope There is one continuous piece of rope, beginning at the load and ending where the force is applied. The rope is not cut, always just one piece.

• Attachment points:

• Anchor: In each example we consider here, there is exactly one anchor (you can imagine it as the ceiling). Other than that, the anchor behaves the same way as a knot (see below):

• Knot: You can attach an unlimited number of pulleys to each knot. Those connections will also be shown as black lines in the following graphics, but do not count as rope.

• Pulley: A pulley can be attached to a knot (or the anchor), (indicated by the black lines from center of the pulleys to the knots). When the rope is passing a pulley (the lines that are tangent to the circle), it acts as a redirection (rope coming in in the opposite direction of the rope going out).

• Load: In each example we consider here there is exactly one piece of load. It is connected to one end of the rope.

• Pulling force: In each example we consider here there is exactly one point where external force is applied, this is the other end of the rope.

## Theory: The T-Method

(You can skip this if you are already familiar with how to calculate the mechanical advantage of pulley systems assuming a friction coefficient.)

### Theoretical mechanical advantage (only an intermediate step, we do not use this for the challenge)

With the so called T-Method we can calculate the theoretical mechanical advantage (TMA) of a pulley system. Here we use the assumption that a rope going through a pulley has the same tension on both sides of the pulley. We define the applied force (tension) to be one unit and follow along the rope in order to successively figure out the force/tension on each piece of rope, pulley or knot and eventually the load. The force on the load is the TMA of the whole pulley system. (The TMA is only considered for teaching how to calculate the AMA and usually has no practical application.)

Each redirection of the rope (=pulley) creates some friction so the assumption of having the same amount of tension on both sides of the pulley can lead to way too optimistic results. We can improve this model by assuming that each pulley has an efficiency 0<=X<=1. This means that if we apply and amount of force F to the rope on one side of the pulley, the rope on the other side of the pulley will only experience a force of X*F. Here an example with X=0.9 (90% efficiency):

(The AMA with known efficiencies is a great tool for estimating the real mechanical advantage of a pulley system especially if you have to rely on low efficiency pulleys/redirections, as most have an efficiency of <<95%. But there are only a few pulley systems that are actually used in the mentioned applications.)

Assuming that every pulley has the same efficiency X we can now use the same procedure as with the TMA in order to find the AMA. If we do not know the efficiency X we have to use X as a variable. When calculating the AMA of a certain pulley system with an unknown efficiency we get a polynomial in X for the AMA. This is what your program has to do for a given pulley system.

## Input format

The input consists of a string of lower- and uppercase letters (a-z and A-Z). For a given pulley system, we start at the load and follow along the rope. Each time we encounter an attachment point (a pulley, a knot or the anchor) we write down the corresponding letter. We use uppercase letters if the rope is attached via knot to that attachment point or a lower case letter when the rope goes through a pulley. The attachment points are labeled alphabetically in the order of first occurrence during the rope traversal. Each time you find a knot, you can assume that the rope will go on in the same direction. Each time you find a pulley, you can assume that the rope gets redirected by 180°. The anchor point always gets the letter Z.

## Output format

The output should comprise a list that encodes the polynomial coefficients. E.g. the polynomial a_0 + a_1 * x + a_2 * x^2 + a_3 * x^3 + …+ a_n * x^n will be encoded like so: [a_0, a_1, a_2, a_3, …, a_n]

## Other Examples:

### 11:1

META: Is this ok/clear enough so far? Are there any mistakes? Can you understand it? I would of course add more examples.

• Go for code golf. I can't think of any other challenge type which would fit Aug 19 '15 at 8:46
• Thanks for the input! Do you think the challenge is clear enough/did you understand the stuff I've written down? Aug 19 '15 at 18:43
• I'm not 100% on the maths involved, but I got most of it Aug 19 '15 at 18:53
• It would be more readable if you trimmed a lot of whitespace off the images. And I don't find the diagrams at all intuitive: I can't work out which parts of the system are rigid and which are rope, or what's going on with the three-way joins. Aug 20 '15 at 17:27
• @PeterTaylor Thank you for pointing this out! I indeed forgot to add some specs. I now updated the section where the symbols are explained, is it better now? Aug 20 '15 at 20:52

# Write a Foo-immune program

In The Programming Language Quiz, Foo has quickly become one of the most annoying languages. Ever. Various people have started to "immunize" their code to avoid it being valid Foo.

Now, here's the challenge. You need to write a polyglot. A polyglot that appears to work in Foo but does something totally different versus the intended language. For instance:

a=(1)
print "Hello, World!"


would appear to work in Foo, but it actually loops indefinitely (the (1)). In Python (the intended language), it prints Hello, World! (if that wasn't already obvious :).

# Rules:

• You may not just rely on just Foo's printing of string literals, which means snippets like print "HHello, World!"[1:] are invalid. You have to put something else, too.
• Your program may not print any error messages when run in Foo.
• Try not to be boring. This is a popularity contest, after all!
• I don't understand the first rule. Also you might want to explain a bit how Foo works, why many codes would unexpectedly work in Foo (i.e. that it prints strings literally) and what counts as "appears to work in Foo", because otherwise the challenge really only makes sense to people who have participated actively in the quiz. Aug 27 '15 at 16:15
• I was thinking about this as well. It's a tricky sort of challenge. I was leaning towards a set of three or four specific (reasonably simple) tasks written in different languages that also work in Foo. It would have to have some rules around code embedded in comments and other loopholes I suppose. If you can make this question work, may I suggest !foobar as a title :) Aug 27 '15 at 20:49
• "Write a polyglot which does two different things" is definitely Too Broad. Aug 29 '15 at 19:30

## Invert the Fundamental Transformation on permutations code-golf

A permutation like

[3, 5, 1, 2, 4, 6]
1->3, 2->5, 3->1, 4->2, 5->4, 6->6


can be decomposed into cycles

(3, 1) (5, 4, 2) (6)


There's many ways to write these cycles, but we can fix a canonical form by requiring that:

• In each cycle, the greatest element is written first.
• The cycles are sorted in increasing order of greatest element.

In this form, we don't even need parentheses to demarcate the cycles. Just from the list of numbers

3, 1, 5, 4, 2, 6


we can infer that the cycles starts at the numbers that are greater than any to their left.

 3, 1, 5, 4, 2, 6
*     *        *
(3, 1)(5, 4, 2)(6)


From here, the original permutation [3, 5, 1, 2, 4, 6] can be uniquely recovered, and your task is to write code that performs this recovery.

Input: A list of n distinct numbers 1 through n. Optionally, the value n itself.

Output: The permutation f that produces that canonical form cycle list, listed or printed as [f(1), f(2), ..., f(n)]. Format is up to you.

You may optionally work with 0-indexed values 0 ... n-1 instead of 1 ... n.

• Don't forget to permutations Aug 29 '15 at 19:24

# 3-Hole Golf Course: Text Formatter

This is a series of three code golf challenges. The over-arching idea is that in each of them, you write a program that processes text in some way, and if you pipe an input text through all three solutions (with a small amount of glue code), it spits out a nicely formatted paragraph.

## Hole 2: Line Wrap

You are given as input a hyphenated piece of text, and the maximum width n ≥ 2 of a line. The output shall be a newline-delimited string, obtained by greedily splitting the input into lines of length at most n characters. Lines can be broken between words (replacing a space with a newline), after a tilde (replacing it with a hyphen), or after a hyphen (inserting a newline after it; this is needed with words like well-known). All tildes which are not replaced by hyphens should be removed, and this should be taken into account when computing the lengths of the lines. The correct output for Hy~phen~ate this sen~tence! and 20 would be

Hyphenate this sen-
tence!


A syllable that's at least n characters long and not the last syllable of a word shall be cut after the n-1st character, and a hyphen shall be inserted there before the line break. The same applies to the last syllable of a word that's over n characters long.

## Hole 3: Justification

You are given as input one line of text, and the desired width n of a line, which is at least the length of the input. Your output is that line, but with extra spaces added between the words to make its length exactly n. The extra space should be added in an aesthetically pleasing way, so we require the following.

• The lengths of any two runs of spaces differ by at most 1. This means that for some number k, every run of spaces between two words shall be of length k or k+1. For example, we could have runs of only 5 or 6 spaces between the words.
• The list of lengths of these runs shall be balanced, in the following sense. For any two contiguous sublists of the same length, the number of ks in them differs by at most 1. For example, the list of lengths 5, 6, 5, 5, 6, 6, 5 is not balanced, since the length-2 sublist 5, 5 and 6, 6 contain 2 and 0 occurrences of 5, respectively. The list 5, 6, 5, 5, 6, 5, 6, on the other hand, is balanced.

These constraints do not uniquely specify the output. For example, for the inputs Hyphenate this sen- and 20, the two acceptable outputs are

Hyphenate  this sen-


and

Hyphenate this  sen-


If the input contains only one word, it should be left unchanged.

## Sandbox notes

In all of the above holes, we can add some constraints to the input, if the challenge would otherwise be too complex (all hyphens and spaces occur between letters, all punctuation occurs at the end of words etc). However, I'm a little concerned that the holes may still be too complex. In the first hole, I can relax the case-insensitivity of the hyphenation list, and in the last hole, the second requirement can be dropped, but I feel that the second hole is already about as simple as I can make it.

• I'm confused about the first hole: if hyphens are a known problem, why does the hyphenated word input use hyphens rather than tildes? In the second hole, for consistency I think you should replace "at a tilde" with "after a tilde". The cut at the n-1st character doesn't seem complex to me: it's just a case of how the "where should the cut be?" variable is initialised. Aug 25 '15 at 20:19
• Also, I think the given definition of balanced in the third hole doesn't say what it's intended to say. In particular, subsequence is almost certainly not the word you want to use. Aug 25 '15 at 20:26
• @PeterTaylor Thanks for the input! I tried to clarify the balance condition; I think it says what I want it to say, but it's hard to write clearly. Aug 25 '15 at 21:17
• The point is that 2, 2 is a subsequence of 1, 1, 2, 1, 1, 2. Perhaps you could use the word sublist? Aug 26 '15 at 5:19
• @PeterTaylor Oh, I see what you mean. Edited. Aug 26 '15 at 14:04

# Enough jQuery?

As a general rule of thumb, jQuery is a vital part of any program. It is really great and does all things. Your job, as a quality-control expert, is to ensure that a given program meets industry standards. Only programs that use jQuery are eligible for your seal of approval.

Write a program which takes an HTML file as input, and returns a High-Quality (TM) HTML file as output. An existing HTML file is deemed as high-quality if it contains a script tag with the word jquery in it. Examples include the following:

<script src="jquery.js"></script>
<script src="//code.jquery.com/jquery-1.11.1.min.js"></script>


This condition is satisfied whenever there is the string <script src=", followed by "></script>, with the string jquery located somewhere in the middle.

(I'm not sure if I should make this condition more precise. It's probably good enough.)

If the given file meets quality standards, simply output it as-is. If there is no enough jQuery, however, output the file with the string <script src="jquery.js"></script> at the very top, so that everyone can see that it's a fixed, bug-free program.

• <script type="text/javascript" src="..."></script>? Sep 6 '15 at 19:42

# The Algebra of Reflecting Points

This is a challenge based on manipulating points with a specific set of operations, each dealing with the reflection of some points over others.

Warning: There's not actually a challenge here yet, just the basis for a challenge that could be to "simplify the given expression" or something.

## Lists of Points

The fundamental object is an ordered list of points, like (A,B,C) or ([2,3],[5,8],[6,8]).

## Reflection

A r B represents the reflection of point A across point B, resulting in a new point C so that B is the midpoint of AC.

A r (B,C,D) represents the reflection over a series of points, and is equivalent to A r B r C r D.

(A,B,C) r (D,E) represents (Ar(D,E),Br(D,E),Cr(D,E)), with either list being of any positive length.

The result of the reflection operator is a list of points that is the same length as the first operand. (If the first operand is a single point, then the output is a single point.)

A list with a single point is that same as that single point. (B) == B

Lists can be arbitrary grouped inside of other lists. (A,B,C,D) == (A,(B,C),D) == ((A,B,C),D)

## Simplification

A point reflected over itself is an identity, CrC is the same as C. Any point reflected over the same point twice is an identity, rCrC can be removed.

(A,B,C) equals (C,B,A)

For any three points ABC there exists a unique fourth point D=C-B+A such that anything r (A,B,C) = anything r D. This means that any long chain of ArBrCrDrErF... can be reduced to have fewer than three rs.

((A,...,B)r(C,...,D)) == ((D,...,C),(A,...,B),(C,...,D)) and (ArB) == (B,A,B)

# Examples

Show that Cr(CrA)rB == Cr(BrArC)

Cr(CrA)rB         #original
Cr(A,C,A)rB       #expanding 4th simplification rule
CrArCrArB         #the list is equivalent to a series of rs
CrAr(C,A,B)       #grouping to form a list
CrAr(B,A,C)       #swapping, the 2nd simplification rule
CrArBrArC         #expanding list
CrCrArBrArC       #Identity operation of C=CrC
Cr(C,A,B,A,C)     #listifying
Cr((C,A),B,(A,C)) #further grouping
Cr(Br(A,C))       #using the 4th simplification rule
Cr(BrArC)         #expanding parenthesis


Here is this proof visualized geometrically.

# Whose Llama is it anyways?

BetaDecay posted a legit looking movie poster in chat, which got me into thinking that this could be a very nice challenge!

Your task is to overlay a nifty llama poster on top of a movie poster in a way that it still looks a legitimate movie poster. The image posted by Beta Decay is:

a http://pictures.boxxspring.com/pictures/960x0/100588

Your program will be provided with an input of fixed size (TBD) movie poster of any popular movie and a fixed llama cutout to overlay that poster as arguments. You may scale (proportionally), rotate or translate the llama cutout anywhere on the movie poster to make it look like a llama is photobombing the poster. At the same time, the output image should still look like a legitimate movie poster in a way the above poster feels real. You cannot perform any operations on the movie poster and no other operations on the cutout other than scaling, rotation and translation.

This is a popularity contest, so the answer with the most net votes wins. Voters are encouraged to judge answers by:

• The correct placement of the cutout such that it does not outright look like a cutout
• The scaling of the cutout to match with people/objects in the movie poster
• The placement of the cutout with respect to the movie text. i.e. The cutout should not hide the movie title in a way that its no longer understandable.

Input

Two images in any common image format. The input can come as paths to the images or the images themselves (if your language support image input) either as function arguments, ARGV, STDIN or equivalent.

The first image (movie poster) will be of fixed resolution and the second image (the llama cutout) will be of enough resolution in order to have good quality even after scaling or rotation.

Output

A single image of the same resolution as the movie poster image in any favorable image format.

[TBD]

# Test Images

Here are a few images to test your algorithm on. Click on the images to get the actual resolution.

TBD

Please include some examples for these test images (along with other examples if needed) in your submission. Its also a good practice to briefly explain your algorithm as well.

# Help Agent Zigzag with his secret messages

The WW2 double agent Eddie Chapman — aka "Agent Zigzag" — used an unusual cipher to communicate with his German controllers. It is described in the appendix of Ben Macintyre's book about Chapman and can also be viewed at the National Archives, apparently.

Read the following description and write a program to encrypt and decrypt messages using this system.

Your program should accept three inputs via stdin and/or command line switches:

1. A keyword
2. A flag to select either encryption or decryption
3. A message to be encrypted or decrypted

The output should be the corresponding ciphertext/plaintext, arranged into groups of 5 letters separated by single spaces. You may assume that the keyword consists entirely of uppercase letters, but should accept plaintexts and ciphertexts containing mixed case characters, punctuation and spaces. Non-alphabet characters should be stripped from the input and should not appear in the output (which may only contain groups of 5 uppercase characters separated by spaces, with an optional line break at the end). The date value used for keyword processing should be obtained from the system clock using the local time zone.

This is a code-golf challenge. The shortest code (measured in bytes) will win.

### 1. Keyword processing

Write out the keyword, and below each letter write the position in which this letter would appear if the letters were all sorted alphabetically. If the same letter appears more than once, number them from left to right. For example, the 14-letter keyword CONSTANTINOPLE would be processed as follows:

C   O   N   S   T   A   N   T   I   N   O   P   L   E
2   9   6   12  13  1   7   14  4   8   10  11  5   3


(Notice how the three Ns are numbered 6, 7 and 8.) Combine this sequence of digits into a single number, and multiply by the current date (from 1 to 31). For example, if the transmission is being made on the 8th of the month:

2961213171448101153 x 8 = 23689705371584809224


### 2. Encryption

Pad the secret message to a multiple of five characters in length by appending the null character X as many times as necessary, then encrypt Vigenere-style by cycling each letter through the alphabet by offsets corresponding to successive digits of the number calculated at step 1. For example, the message

Have arrived safely and in good health. Awaiting further instructions.


is encrypted as follows:

havearrivedsafelyandingoodhealthawaitingfurtherinstructionsx << Plaintext
236897053715848092242368970537158480922423689705371584809224 << Key (repeated)
JDBMJYRNYLEXIJMLHCPHKQMWXKHJDSUMIAIICKPKHXXBQLRNQZUWCGBIXPUB << Ciphertext


because 'H'+2='J', 'A'+3='D', 'V'+6='B', etc.

Finally, read off the encrypted message in groups of five characters:

JDBMJ YRNYL EXIJM LHCPH KQMWX KHJDS UMIAI ICKPK HXXBQ LRNQZ UWCGB IXPUB


• For languages that don't have system clock access, is it acceptable to take the date/time as an additional input? Sep 23 '15 at 14:09
• @Geobits Would you mind if I said no? We have so many code-golf questions that are dominated by esolangs, I thought it would make a change to have one that favours higher-level languages. (Although it looks like Pyth can do dates...) Sep 23 '15 at 14:55
• I don't personally mind since I don't tend to use them. Some might, so I figured it was better to ask/clarify while it was sandboxed rather than on main. Sep 23 '15 at 14:57
• It's not just about esolangs: removing the direct coupling with the system clock allows test cases which work consistently. Sep 23 '15 at 20:19
• @PeterTaylor But only 31 test cases are needed. Sep 23 '15 at 22:02

Well hello there, fellow golfers. The time has come for us to take part in the game. Time for the official Illuminati Confirmation!

# Illuminati Confirmed?

Nah, just joking. We actually want to hide even better - by making conspiracy theorists look ridiculous.

For that, you need to create code in whatever language you want to. Your task is to print the Eye of Providence, as an ascii art. The program may take input, but it shouldn't rely on it.

However, there's a catch. You need to hide as many non-obvious references to Illuminati in source code as you can. One particular requirement is that your code must have an "Illuminati confirmed" sentence hidden somewhere(although it doesn't have to be plain string - in fact, it shouldn't; you can have it hidden by placing it as a first letter to every line, etc. - be creative!)

And because it's , the most upvoted and creative code wins!

Now I want feedback before posting it - what else should I have in here? What is not clear? And if you come up with better "lore chit-chat"(I actually had no afflatus) - feel free to help me.

• You need to hide as many non-obvious references to Illuminati in source code as you can: One problem you may run into is that I think it's been proven by the internet at large that you can make anything an Illuminati reference if you twist it enough. Sep 24 '15 at 17:22
• Also, pretty sure the Illuminati has already been confirmed since it was a real and historical secret society. Sep 24 '15 at 17:56
• @mbomb007 Nonsense! Sep 24 '15 at 18:59
• @Geobits What is your suggestion then? I am honestly counting on community, so some stupid answers like "Well, I have a word 'rock' rock is four characters, and four - 1 = 3, triangle also has 3 sides - Illuminati Confirmed" will be downvoted, and some clever ideas will get attention. Sep 24 '15 at 19:05
• This is an art / wordgame contest, not a programming contest. I'm not as strongly against this sort of thing as some, but there's a fair chance this will get closed. Sep 24 '15 at 21:08
• @steveverrill what I had in mind wasn't "Print the prettiest and funniest image and code, but rather to get people creative. This post is one of my inspirations - Perl and Brainfuck are bottles; C makes heavy use of macros to call the function in a funny manner, and while there are many other "plain" programs, the most creative are the most upvoted. This is similar to mine. There is more of that, buut looks like this shouldn't be closed. Sep 24 '15 at 22:07
• The 99 bottles of beer question is 4 years old and things were different back then. Nevertheless the issue was raised in the top comment on that question. There was a big attitude change just after the christmas tree challenge, in my opinion probably caused partially by Code Trolling. I'm not saying don't do it, just be aware of the issue. James Webster's recent cake question did quite well, though it did attract some close votes. The recent Back To The Future question was closed immeditately. Sep 24 '15 at 22:35
• @steveverrill I'm sorry, I have no idea what you're talking about. Could you please introduce me to the issue of Code Trolling, and provide some examples? Sep 25 '15 at 8:29
• Code Trolling was a particular class of open ended questions. The tag description is here. codegolf.stackexchange.com/tags/code-trolling/info It got out of hand. The history is too long and emotive to discuss in a comment, but it seems the challenges have been deleted. There are many meta questions on the subject. I've picked this one for you. meta.codegolf.stackexchange.com/q/760/15599 Sep 25 '15 at 8:56
• @steveverrill Okay, thanks for your insight. I will think about what you guys said, and maybe post the question - the worst that will happen is that iit will get closed - but hopefully it will spawn some clever and funny answers. Sep 25 '15 at 9:21
• Will an ASCII art version of the Eye of Providence be added in the question, or will we have to make one ourselves? Sep 25 '15 at 15:52
• @ASCIIThenANSI That's what I asked in other topic(well, I did it badly). I'm afraid to lock it to one particular output, because this way they can only get creative with code. What do you think? Sep 25 '15 at 19:11
• If you designed the exact Eye of Providence that we had to produce, it would go better as codegolf than popularitycontest. A good codegolf would require a fair amount of repetition in the pattern (compressing completely random strings is boring.) I guess it's fair to assume your design would be symmetrical. But since you want a popularity contest, just go for a popularity contest, and see if it flies high or if it gets shot down in flames. There's only one way to find out for sure, and you won't do it with meta posts. That said, Geobits makes a good point, that you need to address. Sep 26 '15 at 9:39

# 1,2,3,4,...n-2,n,n-1

Your goal is, with an input "n", to print the numbers 1-n BUT the last two values are flipped. The numbers must be CSV (Comma separated values)

n must be >= 3 (And an integer)

For example, with an input n="10", your output should be as follows: 1,2,3,4,5,6,7,8,10,9.

An input with n="3", your output should be as follows: 1,3,2.

• Get rid of the requirement that you can't just embed a string, please. How about printing 1,2,3,...,n-2,n,n-1 for a given input n?
– Lynn
Oct 3 '15 at 11:16
• @Mauris Added this in, thanks for your input :) Oct 3 '15 at 20:52
• Shouldn't it be "last two values" instead of "last two digits"? In the example, the swapped items are 9 and 10, and 10 is not a digit. Oct 5 '15 at 5:14
• @RetoKoradi Ahah good catch, edited it thanks! Oct 5 '15 at 7:12
• @FryAmTheEggman Got it in, thanks! Oct 6 '15 at 20:21

# The /\/\aze of Mirrors

sniffs...something smells...fishy.

The reason being that there's actually a fish! But it's at the end of a maze of mirrors that you have control over. Your task is to rotate the mirrors until you can see that delicious-smelling ><>. Luckily, there are only nine mirrors, so it doesn't take you long to find a solution.

However, if you encounter this again in the future, you don't want to have to actually do the work yourself. Computers are so much better at it. So you decide to write some code to solve it for you. The shorter, the better, because you don't want that fish to rot!

## The situation

Your program must accept a single positive integer n as input. It then has to find a solution for an n by n mirror maze with the following conditions:

• You, the observer (>), is seated next to one corner.
• The fish (F) is placed next to the opposite corner, on the adjacent wall if n is even and on the opposite wall if n is odd.
• The maze is toroidal because its designers installed cameras and screens.
• However, there is a wall behind the fish, so you can only see it from inside the maze.
• You must use all of the mirrors. No shortcuts!
• Bonus: take an additional non-negative integer x as input and solve the maze for when the fish is x spaces away from the corner (where x=0 is its usual place), flipping to the other wall if x is odd.

## Example solutions

1
+-+
>/F
+-+

2
+--+
>/\|
|//|
+-F+

2 1
+--+
>/\F
|\/|
+--+

3
+---+
>\/\|
|//\|
|\/\F
+---+

4
+----+
>/\/\|
|//\\|
|\\//|
|//\\|
+---F+


## Rules

• No standard loopholes, as usual.
• Your program must output the solution in ASCII like what I've shown above.
• Scoring is in bytes, unless you have the bonus: multiply by 0.8.

I look forward to seeing all the amazeing solutions! Ha! Sorry, that was bad.

• Can I adopt this abandoned proposal?
– user58826
Jun 9 '17 at 12:20
• @programmer5000: Yes, you may. Jun 10 '17 at 3:49

# Categorical logic [on hold]

Inspired by this question:

The point of this challenge is to create a function or program that takes 3 short phrases and returns the logical assessment of the phrases.

### Input

Each of the three phrases will be in the form: [All|Some] [A|B|C] are [A|B|C]., where the two A|B|C elements are different. The string Therefore,{space}, where {space} is a single space character, precedes the third phrase and reduces the initial capital of the third phrase to a lower case letter.

You may choose the input source and the separation of the strings. For example, STDIN with three concatenated phrases, text file, phrases separated by newlines, and taking the phrases as command-line arguments in quotes are all acceptable.

### Sample input

With three concatenated phrases as example format.

• Some tees are moos. All moos are yees. Therefore, all tees are yees. (output: falsy)
• All A are B. All A are C. Therefore, some B are C. (output: ????)
• All submissions are answers. Some submissions are winners. Therefore, some answers are winners. (output: truthy)

### Output

• Output for a logically correct combination of phrases must be a truthy value.
• Output for a logically incorrect combination must be a falsy value. This is also the case if the input is logically unsound e.g. All A are B. No A are B. ...
• Output for a logically uncertain combination must be the following string: ????

The output may be followed by a single newline.

### Clarifications for finicky logic

• Some is a subset of All. The following statement is badly written, but truthy: All A are B. All A are B. Therefore, Some A are B.
• The following statement is also truthy: All A are B. All B are C. Therefore, some C are A.

### Scoring

This is , so shortest code in bytes wins.

You may reduce your score by 10% if your values for A|B|C can contain spaces. You may assume that the value for A|B|C will not contain the word {space}are{space}).

You may reduce your score by a further 20% if your function or program also correctly handles No as input as well as All|Some.

Standard leaderboard code goes here. Tag suggestions are welcome!

• You should add what the expected output is for the sample imputs you give, so that one does not have to find if a sample is logically sound (and possibly be mistaken) Oct 13 '15 at 9:23
• Working on a table of expected output. It's bigger than I had expected, and I haven't yet included 'No' as an option... Oct 13 '15 at 9:42
• What is logically unsound about All A are B. Some A are B.? That's just equivalent to All A are B. There is at least one A. Oct 13 '15 at 13:27
• @Peter Taylor, You're right. A couple of prods at the table has turned up logical differences for the same statement in different places. I don't have enough time to fix this right now, so am putting the question on hold until I can make a clear definition of required behaviour for different cases. Oct 13 '15 at 13:58
• "All answers are submissions. Some submissions are winners. Therefore, some answers are winners." This doesn't seem truthy to me. A simple substitution: All cats are animals. Some animals are birds. Therefore, some cats are birds. Oct 13 '15 at 17:08
• In the few minutes at a time I'm spending on this, I'm struggling to be logically consistent. I feel that All A are B. Therefore, all B are A is false because of the presence of Therefore in the statement. My gut wants me to categorise All A are B. Therefore, all A are C as logically uncertain, yet applying the same logic this should actually be false (as should all logically uncertain combinations). I'll have a search but would appreciate it if anyone already knows of a definitive source. @Geobits: thank you, I've corrected that example. Oct 14 '15 at 14:08

# Two mountain hikers want to meet, but must stay at the same altitude

This question is totally inspired by this question on Puzzling SE. For ease, I have reproduced the original question here:

Two hikers are separated by a two-dimensional mountain range, like the one shown below. The mountain range alternates between peaks and valleys, connected by straight lines.

Both hikers are at sea level, and the mountain range never dips below sea level.

The two hikers want to meet up with each other. Prove that they can do this while staying at the same altitude as each other for their entire journey. They are allowed to backtrack.

## Input/Output

### Meta: what input/output format would be better?

Continuous:

• Input: a list of ordered pairs (x,y) that represent the peaks and valleys.
• Output: a sequence of positions where one hiker or both changes direction, formatted like so:
(x1 y1) (u1 v1)
(x2 y2) (u2 v2)
(x3 y3) (u3 v3)
...

Discrete:

• Input: a sequence of heights that represent the height of the terrain (with no flat portions). (I.e., 0 1 2 3 4 5 4 3 4 5 6 7 6 5 6 5 4 3 2 3 2 1 0, maybe with steps larger than 1?)
• Output: the left/right moves each hiker has to make, outputted like
L R
L L
L L
R L
...

## Scoring

• Scoring is in bytes.
• Bonus: -5% if your program produces optimal solutions.

### Meta:

• I'm pretty sure this is not a duplicate, but still, is it?
• I'd like a better title. Would "Mountain Hikers" be good enough?
• Any other feedback?
• Is the input sorted? Also, I don't understand the first output format. Oct 29 '15 at 16:15
• @feersum: Sorted in the x-direction, yes. The rationale behind the first output format is that as the hikers are moving, they're both moving in one direction (not necessarily together). However, when one reaches a peak or valley, the other will stop and change direction. The output should have the positions of the hikers at these moments. Oct 29 '15 at 19:25
• I think that allowing the input to have deltas of more than 1 would potentially require the hikers to make fractional steps, which would certainly complicate the spec. I don't think the bonus has any point: if you look at the many many existing questions about reachability in a graph (which is what this is), I think you'll find that most of the answers do breadth-first search and thus produce optimal solutions. Oct 29 '15 at 22:21
• @PeterTaylor: Yeah, I realized last night that delta > 1 is a problem in the discrete case (if I want hikers to always be at integer steps). You're probably right about the bonus being pretty much useless. Oct 29 '15 at 22:24

# Bridge Flowers code-golf

One of the example inputs for this challenge is a really minor puzzle in Undertale, and the example output is the solution. You have been warned.

In the Underground, there is a mysterious plant known as the Bridge Flower. They always come in groups of four Bridge Seeds, and have some interesting properties:

• When dropped in water, a Bridge Seed floats away from you in the direction you were facing when you dropped it. It floats until it hits a wall or another Bridge Seed, at which point it stops moving.
• If four Bridge Seeds are touching, forming a straight line, and none of them are moving, they will bloom into Bridge Flowers. Bridge Flowers can support a monster's weight (or a human, but when will that ever happen?), hence the name.
• Another mysterious plant, the Bell Blossom, has a special interaction with Bridge Flowers. The Bell Blossom can be rung to turn all Bridge Flowers back into Bridge Seeds and return them to their original spot.

Consider this map, where . is ground, is water, and X is a Bridge Seed. You'll always be on the part of the map where the Bridge Seeds are. The gap is only four tiles wide, so it's quite easy to make a bridge of Bridge Flowers.

........    ........  |  ........    ........
..X.....    ........  |  ........    ........
.X.X....    ........  |  ........XXXX........
..X.....    ........  |  ........    ........
........    ........  |  ........    ........


Here's a slightly more difficult gap to cross. Even though the straight-line distance is longer than four tiles, you can make it across with a little bit of thought.

........       ........  |  ........       ........
..X.....       ........  |  ........       ........
.X.X....       ........  |  ........       ........
..X.....       ........  |  ........       ........
........       ........  |  ........       ........
..         ............  |  ..     XXXX............
..         ............  |  ..         ............


Here's one that's even trickier than the last two. Most of this river is three tiles wide or fewer, so you can't simply make a straight-line bridge across! Thinking outside the box, though, you'll arrive at the solution.

....   ............  |  .... X ............
...   .............  |  ...  X.............
....   ............  |  .... X ............
.....  ............  |  .....X ............
....   ...X.X......  |  ....   ............
....   ...X.X......  |  ....   ............
..............  |       ..............
............  |         ............


For this challenge, write a program or function that takes a map like the ones here and outputs the same map, but with the puzzle solved (the Bridge Seeds moved to the final position of the Bridge Flowers). If there's more than one possible answer, any of them will do. You may assume there will be exactly two areas of land separated by water, with the one that you start on denoted by the presence of exactly four Bridge Seeds.

If the program can't find an answer... well, just because it's impossible doesn't mean you should give up! Don't lose your Determination! Output Ding to sound the Bell Blossom, reset the Bridge Seeds and try again!

• It took me quite a while to understand the examples. At the very least I think you need to explain that you can pick up bridge seeds from the ground, and clarify "floats until it hits a wall or another Bridge Seed" to define hits. (I think it must include being adjacent to in directions perpendicular to the direction in which it's floating - or am I missing something?) It might also be worth stating explicitly that you don't have to drop them all from the same point. Nov 5 '15 at 22:07

Based on this question in the Puzzling SE. Not 100% sure on the scoring, and this is my first time posting a PPCG challenge, so I'd appreciate any suggestions on improving it.

# Unicode Box Drawing

Write a program which outputs a diagram using all of the standard Unicode box drawing characters:

─ │ ┌ ┐ └ ┘ ├ ┤ ┬ ┴ ┼
═ ║ ╔ ╗ ╚ ╝ ╠ ╣ ╦ ╩ ╬
╒ ╕ ╘ ╛ ╞ ╡ ╤ ╧ ╪
╓ ╖ ╙ ╜ ╟ ╢ ╥ ╨ ╫


The diagram should have no loose ends, so:

┌┐ <-Allowed  ┌┐ <-Not allowed  ┌┐┌┐ <-Allowed
└┘            └┴                └┴┴┘


Also, single lines should line up with other single lines, and double with double:

├─, ╟─, ╠═, ╞═ <-Allowed  ├═, ╟═, ╠─, ╞─ <-Not allowed


The diagram must use each of the 40 characters at least once, and must form one contiguous, connected shape. Because the characters might look different depending on your browser font, do not consider the space between double lines to be an actual separation. Separations can only be between two characters. In other words:

┌╖ <-Allowed  ┌┐┌┐ <-Not allowed
└╜            └┘└┘


Your code must compute the diagram from scratch. You may not create an already existing diagram and just print it out. A bonus of 20% will be awarded if your program outputs a different valid diagram based on a random seed. (This seed may be provided as input, or you may use system time, read the seed from a file, or any other means you choose.) Note that a random seed may be provided externally, but the diagram itself may not. If you implement this bonus, please provide multiple examples showing different output.

This is code-golf, so scoring will be based on the number of bytes in the source code. In addition, the length of the output will also be counted. You get 40 characters free to account for the required characters. Any additional characters will come at a 10% penalty. This includes spaces/tabs, and any duplicate graph pieces. Newlines are free (to be fair to the differences between OSs).

If your program produces multiple outputs of different lengths (due to randomness), you may use the shortest output produced, but you must provide a seed that results in that output so it can be verified. Since this might be difficult if you used system time as a seed, entries using system time must somehow prove that they are capable of producing the smallest claimed output. (For instance, if they produce the same length output every time, or produce the minimum claimed output at least 50% of the time.)

So in summary:

• Take length of source code in bytes.
• Add 10% for each whitespace character (not counting newlines) or duplicated character in the output.
• Subtract 20% if you implement the random seed input.

Standard loopholes apply.

• "You may not create an already existing diagram and just print it out." This is probably too fuzzy. There many shades of hardcoding. Starting from including the string plainly in the code, over decoding a Base64-string which magically happens to give the correct result, all the way to "cleverly" pruning the possible diagrams your code tries to find, because you know there is a valid one in the search space. You can work around all of that by requiring programs to take some input: e.g. the actual set of characters that need to be accounted for. Nov 4 '15 at 15:22
• Additionally, this might make an interesting code challenge instead of code golf. Nov 4 '15 at 15:22
• You should probably also define contiguous, because some of the answers on the Puzzling.SE question have shapes which don't look contiguous (but are considered contiguous) because they have gaps inside the double-line characters (e.g. the "separate" box in the top left corner in the second example of the accepted answer). Nov 4 '15 at 15:24
• @MartinBüttner This problem is caused by different rendering of the unicode characters. Here is how it looks in the SE Android app: i.stack.imgur.com/PlQWI.jpg Nov 4 '15 at 16:05
• @Sleafar Oh, interesting. Might be worth mentioning anyway if some fonts display it differently. Nov 4 '15 at 16:07
• Yeah, most fonts I've seen they look like they do in Sleafar's image. For whatever reason, the one used on SE does not. I think it would probably be much harder if you considered those double lines to be actual separations. As for the hardcoding, I didn't want this to be just another "Print out <blah>" challenge, there's tons of those. It's much more interesting if you have to derive such a graph in code. (Which is why I added the bonus for using a random seed, because then you KNOW it's being generated on the fly.) Nov 4 '15 at 17:56
• To avoid the hardcoding issue, I'd suggest generalizing the puzzle in some way, perhaps by giving a multiset of components to use.
– xnor
Nov 4 '15 at 21:51
• Problem with using a multiset of input is you'd now have to validate said input to make sure that it's even possible to create a graph with no loose ends using the given inputs. I think the idea of using an input parameter which is just a random seed should be sufficient to ensure the results were not hard-coded in some way. Also, there's nothing stopping you from hard-coding it and printing the same thing every time, you just won't be eligible for the 20% bonus that way. (Is 20% enough? I feel like generating a valid graph is orders of magnitude more difficult than just printing one...) Nov 4 '15 at 22:52
• You could take the multiset as input and require that at least the characters in it have to be used, possibly others. The scoring could combine source code size and output size for a set of test cases. Nov 5 '15 at 2:16
• I don't like the idea of using preset test-cases except as examples. For one, it makes it possible to hardcode valid graphs for just the test-cases, which is contrary to the spirit of the challenge. Also it limits the challenge to a few already-solved cases instead of making it more general. As Sleafar found in his answer in puzzling, there are many perfect solutions for a given set, and I wouldn't want everyone to just use the same algorithm and thus produce the same graph. I could see providing some examples, but I don't want to use only the example input for scoring purposes. Nov 6 '15 at 14:21

# Find pattern in pixel carpet

[insert story why this needs to be as short as possible]

Given an image the goal is finding the biggest* connected* pattern of pixels, that occurs more than once. If there is more than one distinct pattern of maximum size, find the one that occurs more.

The output should consist of mask (bw image) of the size of the input, that is black where the copies of the pattern were on the original image, and white otherwise.

# * Specs

• Biggest as in number of pixels
• connected means four connected

Two instances of the pattern must not overlap.

# Meta

• consider rotations / mirroring of the patter too, or only translations?
• runntime requirement?
• "You are a carpet salesman who is looking for stains in a carpet to maintain your reputation. However, since you are locally known as the 'guy who sells dirty carpets', you don't have the money to buy new hardware, and you only have a tiny hard drive and a terrible camera to try to find them with. Therefore, you're going to need a really small program in order to try to find these stains." Nov 7 '15 at 18:53
• @VoteToClose Then it must be runnable in embedded system? A Raspberry Pi, maybe. Nov 16 '15 at 15:18
• @ChristianIrwan Let's say it is an arduino=) Nov 16 '15 at 20:32

## Optional parentheses

In text, parentheses can denote optional asides. These (often intrusive) additions can be read or skipped over, either option giving a valid sentence. Given a string with parentheses, possibly nested, output all possible readings where each parenthesized section may be omitted.

The(( quick)( brown)) fox jumps( over the( lazy) dog).

The fox jumps.
The quick fox jumps.
The brown fox jumps.
The quick brown fox jumps.
The fox jumps over the dog.
The quick fox jumps over the dog.
The brown fox jumps over the dog.
The quick brown fox jumps over the dog.
The fox jumps over the lazy dog.
The quick fox jumps over the lazy dog.
The brown fox jumps over the lazy dog.
The quick brown fox jumps over the lazy dog.


The outputs can be in any order, but must be distinct. Note the case of (( quick)( brown)), where omitting both quick and brown is redundant with omitting the whole expression. But, the input won't contain any parens that enclose the empty string or are redundant with another pair of pairs.

You may not use regular expressions.

The input string will consist of only letters, spaces, punctuation .,, and parens (). The parens will be properly matched.

• So the example is an invalid input? Nov 17 '15 at 10:20
• @feersum It's valid, but in trying to clarify the redundancy condition, I realized it's unclear what ( quick)( brown)( quick brown) should give. Hmm.
– xnor
Nov 17 '15 at 10:23
• "You may not use regular expressions." T_T Nov 17 '15 at 11:20
• @MartinBüttner Would it make you happier if I made reg-exp and non-reg-exp two separate "leagues"?
– xnor
Nov 17 '15 at 11:21
• Hm, I don't know. I wonder if it's a bit of a duplicate of this. If I was allowed to use a regex approach, my answer would be almost the same (instead of repeatedly moving the contents of the parentheses to a new line, I'd duplicate the line and remove the parentheses from one of the copies, and the parentheses together with their contents from the other; followed by duplicate removal). Nov 17 '15 at 11:24
• (Also note that even Retina can't beat a non-regex approach in Pyth on that challenge, so I doubt it'll be much different here.) Nov 17 '15 at 11:25

## Compete with awk

The goal of this challenge is to see if the assertion often see in question on SO is true:

This would be faster in whatever

# Test Input

A 10 million lines file generated by this script line:

awk 'BEGIN{for (i=1;i<=10000000;i++) print (i%5?"miss":"hit"),i,"  third\t \tfourth"}' > file


$head -10 file miss 1 third fourth miss 2 third fourth miss 3 third fourth miss 4 third fourth hit 5 third fourth miss 6 third fourth miss 7 third fourth miss 8 third fourth miss 9 third fourth hit 10 third fourth  # Goal: The main goal is to compete with awk, to benchmark it will be on this challenge description: • Split each line on any number of spaces (regex [ ]+) • If the line start by hit X with X being an even number • print fields: 4th 1st and 3rd (in this order) Example output (first 5 lines): fourth hit third fourth hit third fourth hit third fourth hit third fourth hit third  Restrictions: The idea being to compete with awk, your program must behave on the same way: • The file must be read. • The match and output order must be modifiable as an awk program can be (Needing a simple code update is OK, it has not to be a command line parameter). • The number of line in input file should be considered unknown. • As long as your output can be piped to awk, the submission is valid. # Validation: Pipe the output of your program to awk '!seen[$0]++{unq++;r=$0} END{print ((unq==1) && (seen[r]==1000000) && (r=="fourth hit third")) ? "PASS" : "FAIL"}'  If it show PAST, you're in :) # Winner The fastest code would win, to bench yourself here is a mawk version really competitive (which won't count toward answers as I think it's pretty hard to beat): awk '/^hit +[0-9]*[02468] / { print$4, $1,$3 }' file


I've build a test suite on github here which build a result table here.

Answers will be integrated within it to bench all answer on the same machine, if there's a specific way to launch your program, make it appear in the answer so I don't penalize your answer by the way it is launched.

### Side challenge:

If you wish to save me time and craft a pull request to include your code in the test system, you're welcome.

• 1. "Split each line on spaces" would IMO split the line miss 1 third fourth into 15 fields. A possible rewording might be "split each line around the regex [ ]+" (where the otherwise unnecessary [] prevent MarkDown from trimming the space). 2. The question as worded is a bit too special-cased, as is the awk code you provide. If it's permissible to optimise the regex to /hit [0-9]*0/ because you know a priori the form of the input, why would it not be permissible to optimise further and write print "fourth hit third\n"*1E6? Nov 19 '15 at 21:02
• @PeterTaylor Thanks for the feeback, I reworded a little to be more specific on restrictions and avoid too much test input optimizations. Nov 20 '15 at 10:20
• I still think your reference answer is cheating with /hit [0-9]*0 /. To match the challenge description it should use /^hit +[0-9]*[02468] / Nov 20 '15 at 11:18
• @Peter ok, it does no difference in timing at end anyway (at least nothing I've been able to see on slow machines when benchmarking the codes present on GH) Nov 20 '15 at 11:24

# Count up by factor keys

TODO: Better title

### Information

Let the factor key of a number n be the result of the following process:

• Compute the prime factorization of n: n = p1e1 * p2e2 * p3e3 * ... where all pi are prime, distinct and in increasing order, and all ei are positive integers.

• Compute each piei; call these factors the fi. So n = f1 * f2 * f3 *....

• Convert each fi to a string.

• Concatenate all the strings together.

• Evaluate as a number.

Examples:

The factor key of 2376 is 82711, since 2376 = 23 * 33 * 11 = 8 * 27 * 11.

The factor key of 931 is 4919, since 931 = 72 * 19 = 49 * 19.

As a special case, the factor key of 1 is 0.

### Challenge

Output all positive integers, starting from 1, in increasing orders of their factor keys. If two numbers have the same factor key, output the smaller number first. The output must be separated by a delimiter, but this delimiter can be any non-numeric character. If you choose spaces, your output should start with the following:

1 2 3 4 5 7 8 9 11 13 16 17 19 6 23 10 25 14 27 29 31 37 41 12 43 28 47 36


This is , so the shortest solution in bytes wins.

• In the case (I'm not sure whether it occurs, but you haven't stated that it doesn't) that two numbers have the same factor key, can they be output in any order or do you want to define a tie-break? Nov 30 '15 at 12:35
• @PeterTaylor It does occur (see 36 and 49), but the question states "If two numbers have the same factor key, output the smaller number first."
– user45941
Nov 30 '15 at 20:48
• By reverse engineering, it seems that the e_i must be non-zero. That's worth stating in the spec, and backing up with an example (i.e. any odd number greater than 1). Nov 30 '15 at 22:18
• @PeterTaylor Done. Nov 30 '15 at 22:25

This is currently WIP, but please post feedback if you have any!

# Best General-Purpose Compression

### Abstract

This paragraph is meant to summarize, the binding rules are below.
Your task is to implement the best general purpose compression algorithm in the context of this challenge. You will be given a file corpus which contains a mix of different file types. The goal is to beat an existing answer in terms of overall size. The size is determined by the size of the compiled compression program (and decompression program if they are two different programs) plus the compressed size of the corpus. Your algorithm must beat standard 7z with default settings by at least 10 bytes, or if there is an existing answer, this answer by 10 bytes.

### Corpus

This paragraph lists all files that are part of the input to your program, their size and the baseline 7z score in 7z 9.38 beta. Licenses are linked where needed. Disclaimer: There is no political or humorous motivation behind the choices. All files were chosen because of their representation of certain formats or unique compression behavior.

Natural Language

Uncompressed:      146 119
7z 9.38 beta:       17 142
File name:    articles.law


#2 - ASCII - Pre-Flight Launch Preparation for the Space Shuttle: DownloadSave-As

Uncompressed:        44 515
7z 9.38 beta:        15 304
File name:    6_2_4_4_2.TXT


#3 - ASCII - 1984 News report archive about the Bundespost Hack: DownloadSave-As (transcribed by Chaos Computer Club, cites full-text articles from Die ZEIT, taz et al.)

Uncompressed:      102 242
7z 9.38 beta:       32 382
File name:    boh-20f8.txt


#4 - ASCII - (Unofficial historical transcript of) His Last Bow by Arthur Conan Doyle: DownloadSave-As (lic. Public Domain)

Uncompressed:           330 042
7z 9.38 beta:           110 481
File name:    doyle-his-382.txt


#5 - UTF8 - Transcript of the Rosetta Stone translated to English: DownloadRAW->Save-As (lic./© The Nile, Notes for Travelers in Egypt, by E. A. Wallis Budge, 9th Edition, London, Thos. Cook and Son, [1905], pp. 199-211)

Uncompressed:                  18 270
7z 9.38 beta:                   6 299
File name:    Rosetta_EN_UTF8+BOM.txt


Source Code (+ Markdown)

#1 - C - CPU control code taken from the linux kernel: DownloadRAW->Save-As (lic. GPL, Rusty Russell)

Uncompressed: 18 866
7z 9.38 beta:  5 683
File name:     cpu.c


Uncompressed: 59 792
7z 9.38 beta: 11 921
File name: COMBAT.BAS


#3 - XML - The 9/11 Wikimedia dump: Download (lic. GFDL, CC-BY-SA 3.0)

Uncompressed:                                40 557 621
7z 9.38 beta:                                   578 993
File name:    sep11wiki-20071116-pages-meta-history.xml


#4 - C# - Source of the .NET Framework System.Array (CLR): DownloadRAW->Save-As (lic. MIT)

Uncompressed:  133 646
7z 9.38 beta:   15 172
File name:    Array.cs


Uncompressed:          284 394
7z 9.38 beta:           73 585
File name:    jquery-1.11.3.js


Binary Media

Uncompressed: 10 482 521
7z 9.38 beta: 10 434 631
File name:    flower.jpg


#2 - MP3 - "Mariam's Cake" by Robin Grey: Download (lic. CC-BY-NC-SA 3.0)

Uncompressed: 8 468 990
7z 9.38 beta: 8 162 146
File name:     cake.mp3


Uncompressed: 37 834 326
7z 9.38 beta: 14 652 746
File name:    street.bmp


Uncompressed: 6 173 898
7z 9.38 beta: 6 013 047
File name:     home.mp4


#5 - binary - Block of cryptographically secure random data, a.k.a. "The Incompressible File": Download

Uncompressed: 100 000
7z 9.38 beta: 100 129
File name:    rnd.bin


### Rules

(De/)Compression Program and Algorithm

1. The program used to compress and decompress a file is the compiled executable (or executable script).
2. You may use two or more programs and ship additional files if needed, however only one program per step (a step is de- or compression) is executed.
3. No program or part of a program is allowed to request resources that are not included in your distribution. Exceptions are standard system resources (clean install, i.e. a Java runtime would not be available when you use Windows).
4. You may use linux-, windows- or architecture-specific code.
5. You must not modify files or file names. The file names listed above are binding. Note: Some downloads may not carry the file name, you have to rename them (case-sensitive). The file names of compressed files do not matter. However, the original file names must be restored after decompression.
6. You can use any existing or new algorithm. Content mixing is of course allowed, however, you may not call any compression routines available on your system (or language). You program must be a self-contained implementation.
7. Your algorithm must not specifically target this corpus, it has to be general purpose. You are however allowed to target the used file types (e.g. by identifying the type via "Magic Bytes" and adjusting the algorithm accordingly).
8. The (de)compression program only accepts one argument, a file name. Piping program output somewhere or providing anything else is forbidden. (I.e. you'll have to write the output file yourself).

Your compression program is called 15 times, once for every file in the corpus:

comp articles.law
comp ...


This process must produce 15 compressed files on disk in the same directory (original files can be overwritten). (comp is just an example name, you don't have to use this name)

Decompression is similar. Your decompression program (which may be the same executable) is called 15 times, once for every file in the corpus:

decomp ...


Where ... is the file name of the compressed file. This will produce the original 15 files on disk (with their original file names) (compare the SHA256 when in doubt).

Neither the compression or decompression program may take any additional command line parameters.

Scoring

Your score is P+C, where

• P is the size of all programs used in your distribution
• C is 15 files, the compressed corpus

in bytes.

• The source code for all parts of P. (Is not counted in the score).
• A link to a GitHub repository containing both P and C. Means you actually have to run your solution and include all compressed files. If your repository features additional files that should not be included in your score (gitignore, README etc.), put the scored files in a separate folder.

To beat someones score, your score has to beat it by at least 10 bytes. If some answer has the score X, then your answer has to have a score of N <= X-10, where N is your score. The starting score is set by 7z.

• Answers without source code for P,
• answers without compressed files, or where compressed files run against P produce anything but the original corpus,
• answers that contain only partial solutions.

For clarity, here's how an answer might look like:

I did this algorithm X. This code is used for compression:

<comp.c>

and this for decompression:

<decomp.c>

I used windows, my score therefore is 9001:

comp.exe:          234 bytes
decomp.exe:        124 bytes
Compressed files: 8643 bytes

repository here: github.com/foobar42.


Current score: 423,424 (P) + 40,229,661 (C) = 40,662,085
Set by: 7z 9.38 beta (Win32) on 2015-12-18

• I love this, even if it's above my skill level. I hope it gets posted!
– cat
Dec 18 '15 at 3:18
• 1. "The file names listed above are binding" for what? My best guess is that the compressor has to store the original filename in the file, and the decompressor has to output to that name, but I didn't notice that that was stated explicitly anywhere. 2. comp articles.law: are we required to use command-line arguments and to pick an output filename ourselves, or could we use stdio and invoke as comp <articles.law >articles.law.myz? 3. "Your answer must include ... A standard ZIP file". How? Dec 18 '15 at 8:38
• @PeterTaylor 1. It is irrelevant how the file name is stored, however it must be restored after decompression. I'll add that. 2. The compressed filename is not specified in the rules so it can be anything. According to the current rules comp <articles.law >articles.law.myz would be invalid. The only calid way to call one step is program file, files must be created by the step program. I'll add that. 3. I'm thinking of changing this part to "GitHub Repository". Suggestions?
– user42643
Dec 18 '15 at 16:12
• I would posit that there is no such thing as truly "General-Purpose Compression", at least in an information-theory sense. Text (and various other formats) compress nicely because they are not general. But compression of random data will not give any gain in the long run. Dec 18 '15 at 20:47
• @DigitalTrauma GP in terms of compression algorithm means that the algorithm does not specifically target the specific files in a test suite. ZIP for example is a GP algorithm, as most other algorithms.
– user42643
Dec 18 '15 at 20:53
• Rather than using GitHub repos, I think the best approach is to require all answers to be deterministic and then the scores can be verified by just running them. Dec 19 '15 at 12:26