# What is the Sandbox?

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

See the Sandbox FAQ for more information on how to use the Sandbox.

## Get the Sandbox Viewer to view the sandbox more easily

To add an inline tag to a proposal use shortcut link syntax with a prefix: [tag:king-of-the-hill]

• How are tags added to questions? – guest271314 Jan 9 at 7:51
• @guest271314 You can use this markup to create a tag in a draft: [tag:code-golf] – DJMcMayhem Aug 29 at 15:19
• Why no featured anymore? Can't we have it auto-added or something? – JL2210 Sep 26 at 15:57
• @JL2210 We now have a permanent info box that links to the Sandbox, so the featured tag isn't necessary – caird coinheringaahing Sep 29 at 13:43
• I think the sentence 'replace the post here with a link to the challenge and delete it' may specify that the deletion should be done immediately . – AZTECCO Oct 5 at 19:39

# Build a Rorschach Generator

2 possible challenges:

## 1.

Help a poor struggling game dev write some code to quickly and efficiently generate a Rorschach inkblot.

Using your language of choice, generate a Rorschach inkblot. You may use any method of generating a random seed.

The generated image must be in black and white and reflect down the middle of the image. This is a code golf so the shortest submission will win.

OR

## 2.

Help a poor struggling game dev write some code to quickly and efficiently generate a Rorschach inkblot.

Given 2 input images (a source image and an image of a template inkblot), convert the first into the Rorschach inkblot of the second without changing the colours of the image.

You may assume that the images are the same size, however you may not display the original image unaltered. Anywhere in the template where the RGB values of the pixel are (255,255,255), you may not display the original image. The produced image must be vertically mirrored, so you will have 2 copies of the source image distorted and reflected in the result.

Then I'd provide source images some of which would probably be shamelessly stolen from either the Voroni Map or the Mona Lisa Colour Palette questions because those questions are awesome.

My thoughts:

I'm essentially hoping to get the source image in a twisted demented fragmented form, similar to if you gave a small child red cordial then the source image and a blur tool and said go nuts. I feel like my second challenge has potential, but I feel like I need to improve the challenge description and detail exactly what I want to be produced, but I'm not sure how to do that without a wall of text and without unnecessarily restricting the challenge.

• Your suggestions aren't code-golf. Code-golf means that the shortest code in byte/char wins. First of all, you should determine what will be the winning criterion. It will be hard to determine some if you want to keep it as a code-golf AND a pop-con. The first one is more designed to be a pop-con, as submissions can be creative. The second one is too restrictive to be a pop-con : for the same images, ouput will always be the same. It would go as a code-golf. Be aware that image-processing is language retrictive by essence, and that could be badly welcomed as a code-golf :) – Katenkyo Jun 23 '15 at 14:31
• Not necessarily a duplicate, but something to look over to make sure yours differs sufficiently Make a Rorschach image – trichoplax Jun 23 '15 at 16:48

# [Insert] Nerd Sniping Pattern (Series)

Having learned from Prime Nerd Sniping Pattern that hoping an optimal solution will not be spotted too quickly is not a good idea, I'd like to judge how much interest there is in a series of similar contests that have been demonstrated to not have an achievable optimal solution, allowing long term open ended competition.

Each one would need work to demonstrate this lack of an achievable optimal solution, and I'll put that work in if there is suffficient interest here.

For example, there could be a Fibonacci Nerd Sniping Pattern, Factorial Nerd Sniping Pattern, and so on. Each one would need to have a different method of defining the scoring pattern, so that different optimisation techniques and algorithms would be required for each one. This is what would ensure they are distinguished from each other as separate challenges in a series, rather than near duplicates.

# What I've learned from my mistake with the primes

The prime scoring pattern had a checkerboard optimal solution because all of the scoring pixels were on opposite coloured checkerboard squares to the pixel being scored. I need to avoid this in any future scoring patterns, and more generally avoid any pattern that divides the image into two regions for scoring (where all of one region are scored by combinations of pixels from the other). Intuitively, there should be plenty of mixing.

As I think about it more, I'll add ideas here on things to rule out and things to ensure I have before considering a pattern scoring rule ready for posting.

# Build a Mahjong AI

Mahjong is a traditional Chinese gambling game played throughout Asia in which four players draw and discard tiles in order to try to complete a hand of 14 tiles.

In this problem, a specification for a simplified version of Mahjong called "PPCG Mahjong" was given. Your task in this problem is to build a program that will play a version defined here called "Full PPCG Mahjong" (hereafter known as the FPM rules).

Your program will be an online program, taking input as it plays the game. (that does not necessarily mean it needs networking capabilities, but it means that it will output in reaction to ongoing input, not just all input at once.)

## Tiles

There are 34 types of tiles in FPM.

1. The “bǐng”/“pin” (餅) tiles, also known as the circle tiles / dot tiles. These will be represented in text with a number from 1 to 9 and then the letter b, as in 1b, 2b, up to 9b.

2. The “suǒ”/“sou” (索) tiles, also known as the bamboo tiles. These will be represented in text with a number from 1 to 9 and then the letter s, as in 1s, 2s, up to 9s.

3. The “wàn”/“man” (萬) tiles, also known as the character tiles. These will be represented in text with a number from 1 to 9 and then the letter w, as in 1w, 2w, up to 9w.

The three tile types totalling 27 tiles above are called the number tiles.

1. The “fēng”/”fuu” (風) tiles, also known as the wind tiles. There is one wind tile for each cardinal direction. These will be represented in text with the letter of the wind's cardinal direction in capitals, repeated twice, as in: EE, SS, WW, or NN.

2. The “yuán”/“gen” (元) tiles, also known as the dragon tiles. There is one red, one green, and one white dragon, represented as ZZ (for zhōng 中/center), FF (for 發/fortune), and BB (for bái 白/white) respectively.

The two tile types above are called the honour tiles. There are four of each type of tile, for a total of 136 tiles.

## Objective

The goal of Mahjong is to form a complete hand, which consists of four sets and a pair.

A set is one of:

• A sequence of number tiles. (e.g. 5w 6w 7w or 3s 4s 5s)

• A triplet of any tile (number or honour tile). (e.g. 3b 3b 3b or EE EE EE)

• A quadruplet of any tile. (e.g. 3b 3b 3b 3b or EE EE EE EE)

A complete hand will have 14 tiles if there are no quadruplets present; each quadruplet adds one tile to the hand's size, up to a possible 18.

## Gameplay

Mahjong is a game played in several hands (局, ).

At the beginning of each hand, each player receives a text input of START [Wind] [Round number]. Each player is then given an input of 13 tiles, represented as a set of 13 space-separated strings (e.g. 1b 9s BB 3w 6w 4b ZZ 3w 5w 2s 6b NN NN) and assigned a different seat wind depending on where they "sit" at the virtual table (given as a single letter out of NESW).

Starting with the player at position East and moving clockwise around the compass, each player takes a turn in which:

• The player whose turn it is will be given a tile (自摸牌, zìmōpái) from the "wall" (the collection of tiles that have not been drawn or dealt yet) as a two-character input.

• The player can take actions during the standby phase:

• If the player has four of the same tile in his hand, it can call kong (槓, gàng) and draw an extra tile. Those tiles must stay as a quadruplet from then on and cannot be used for anything else. The program does this by outputting kong [quadruplet tile] as text.

• If the player previously called pung on a triplet and has a fourth of the tile, it can call kong as well.

• If the player's hand is complete with this drawn tile, it may declare hu in which case the hand ends.

• The player will then produce an output of whatever tile it decides to discard. The tile that was discarded will be propagated as output to the other players in the form [seat] [discarded tile] (e.g. E 8w). The players can then call that tile if it will complete a set:

• The player immediately after the discarding player may call chi (吃, chī) by outputting chi as text during the call phase, to complete a sequence.

• Any other player can call pung (碰, pèng) to complete a triplet, similarly by outputting pung as text. Pung overrides chi when it happens.

• Any player can also call kong (槓, gàng) to complete a quadruplet, also by outputting text, in which case they are given an extra tile as text input.

• Any player can also call hu (胡, ) to complete their hand regardless of whether they are completing a sequence, triplet, or pair. Hu overrides both pung/kong and chi.

• If a player does not want to call tiles, it must output pass.

The turn immediately goes to the player who called the tile, and they skip their draw phase, discarding another tile immediately. If nobody called a tile, the next player draws one. At any point if a player calls, the other three players will receive an input indicating that the player in that seat made a call and what was called.

• For chi, the input will be in the form of [seat] chi [other two tiles] (e.g. S chi 6w 7w).

• For pung and kong, the input will be in the form of [seat] pung/kong. This is because all the tiles are identical to the called tile anyway.

• For hu, the input will be in the form of [seat] hu [all other tiles in hand].

In the above three cases, the tile being called is always the previously discarded tile.

• For a kong during the standby phase, the input will be in the form of [seat] kong [kong tile], because the kong tile is not implied to be the previously discarded tile.

• For a hu during the standby phase, the input will be in the form of [seat] hu [tile drawn]

Once a tile is called, the set that it makes is locked in place and cannot change for the rest of the hand. So if two tiles would make use of a tile in a called set, they may not use that tile.

A hand ends when either somebody calls hu validly or there are no more tiles to draw. (There is no dead wall in this game.) At that point, all players will receive an input of END to signal that the round has ended, and a summary of their points.

If somebody other than the dealer won, then the deal rotates. If the dealer or nobody won, then the deal stays the same. After four deal rotations, the prevailing wind also rotates.

A game of FPM consists of 16 such deal-rotations (rounds), such that each player gets to play one round with each combination of seat wind and table wind. Each player starts with a bank of 500 points. At the end of 16 rounds, the player with the most points is the winner of the game.

## Example gameplay interaction

> START HAND EAST 1
> 1b 4b 6b 2s 9s 3w 3w 5w 6w NN NN ZZ BB
> E       // The player is East (dealer)
> NN      // East drew the north-wind first.
BB        // East decides to discard the white-dragon.
> S 3w    // Nobody called it, and South discards a 3-character.
pung      // East wants to pung the 3w tile.
ZZ        // East discards the red-dragon
> S pung  // South pungs the red-dragon.
pass      // East has no use for this tile, so it passes.
> W kong 2s    // West declares a standby kong on 2-bamboo.
> W 3b    // West discards a 3-circle.
pass      // East passes again.
> N chi 2b 4b  // North chi-s it with a 2b and 4b.
> N 7s    // North discards a 7-bamboo.
pass
> 2w      // East's hand: 1b 4b 6b 2s 9s 2w 5w 6w NN NN NN -- 3w 3w 3w
2w        // East doesn't need the 2w, so he discards it.
> S hu 2b 3b 4b 7s 8s 9s 2w 6w 7w 8w ZZ ZZ ZZ
// South wins on that tile. The 2w completed his pair.
> END
> 496 506 499 499  // Their current point counts. South's hand was worth
// 2 points, so East pays 4 while the others pay 1.
> START EAST 2
> [13 more tiles]
> N       // The deal rotated, and this player is now North.


## Brackets

Your program can participate in one of three levels of gameplay:

• Level 1, where every hand is worth exactly 8 points, and the only thing that matters is completing hands.

• Level 2, where every hand is worth the number of points in the points table section below, but any hand can still win.

• Level 3, where every hand is worth the number of points in the points table, but a hand must have at least 8 points total with that system to win.

(TBD)

## Penalties

The following are invalid moves:

• Failing to produce an output when required.

• Discarding a tile that is not in your hand, or when it is not your turn.

• Calling chi on any player other than the one immediately before you, or calling any tile that does not actually complete a set in your hand.

• Calling hu when your hand is not complete, or when your hand value does not meet the minimum point requirement in level 3 gameplay.

If your program makes an invalid move, the move will be rejected, your program will pay 20 points to each of the three other players, and for the rest of that round, it will be a "forced tsumogiri" player, which automatically discards every tile it draws and never calls anything.

## Special Rules

There are no special rules such as dora or furiten in FPM. Any person may complete a hand at any time as long as it is a valid complete hand.

• Sounds fun :) I hope there'll be enough entries to actually play a game though – Sp3000 Jun 24 '15 at 4:34

# Team Gun Battle

This is an individual competition, where the goal is to be the last player surviving. Fighting always takes place between two teams. At the beginning, every player is randomly assigned to one of two teams and placed randomly on the board.*

Each turn, a player can move north, south, east or west or stay. In addition to moving, they can also shoot a bullet north, south, east, or west. Note that players won't know about other players' movements when they move, but the shoot() method is called after all moving has taken place. The player can choose to shoot a light bullet, which travels 4 squares per frame and does 1 damage, or a heavy bullet, which travels 2 squares per frame and does 3 damage. The bullets do move on the same step they were shot in, so if a target is less than 4 units away, you can shoot a light bullet without any chance of the target dodging.

Every player has a starting health of 30 and 30 bullets to shoot.

After 1000** or so steps, the round will end. Whichever team has more players alive will be considered the winners. Ties will be broken by whichever team has the highest total health.*** Every player not on the winning team will die, and the winning team will be split up into two new teams. This means that half of those who were originally on your side are now your enemies. Another 1000 steps are executed and another winning team is chosen. This process repeats until there is only one player left.

This has some interesting strategic consequences. For example, if your team is winning, it is in your interest to start shooting players on your own team because they may not expect it and you will have to fight them eventually. Similarly, you don't want to waste all of your bullets on the first few rounds because your bullets and your health is not replenished after each round. I like trichoplax's suggestion where ammunition and health could be slightly restored after each round. You want to get your teammates to do as much work as possible before killing them.

The controller almost ready. This is the spec:

public class Player1 extends Player {
public Direction move(World w, int stepsLeft) {
// stepsLeft = # of steps left in round
// List of players: w.getPlayers()
// List of bullets: w.getBullets()
Player p1 = w.getPlayers().get(0);
// Check health: p1.getHealth()
// Check # of bullets left: p1.getBullets()
// Check team: p1.isOnSameTeam(this)
// Check position: p1.getPosition()
return Direction.NORTH; // always move north
}
public Bullet shoot(World w, int stepsLeft) {
// similar to above
return new Bullet(Direction.NORTH, true); // heavy bullet shot north
}
}


*I think the board should be a square with side length 3*(# of players). Hopefully this would make to not too sparsely populated.

**Exact number to be determined. It may be based on the number of players (higher # of players = more steps until the end of the round). 1000 seems like a good number.

*** I'm working on a system that's somewhat more fair. Currently, if there was originally an odd number of players, they were split with one random team getting an extra player. Obviously, that team has a significant advantage under this system. Perhaps it could be percentage of surviving players?

• It sounds like it would be easy to forever avoid opponents by just staying off their orthogonal lines. What happens if it never gets down to one player for that reason (or everyone runs out of bullets)? – Geobits Jun 25 '15 at 16:37
• @Geobits If everyone runs out of bullets, then I have two options I'm considering: a) Nothing happens, and when the 1000 frames ends at the end of the round, one team is randomly chosen to proceed (that is the default when teams tie exactly; if one team has higher total health than the other, then that team wins) b) everyone's bullets are replenished. Which is better? – soktinpk Jun 25 '15 at 17:06
• Would it help to give everyone some extra ammunition at the start of each round, but also let them carry over whatever ammunition they saved from the last round? – trichoplax Jun 25 '15 at 17:21
• If you were feeling mean you could make the arena wrap and have bullets not stop until they hit someone. So dodged bullets will keep looping across the arena, slowly filling it up until there's no way for everyone to avoid them. – trichoplax Jun 25 '15 at 17:22
• @trichoplax I like your first idea. The second seems like a little harsh since you have a lot less control of who your bullets hit. – soktinpk Jun 25 '15 at 17:30
• I did think it might be a little too mean :) – trichoplax Jun 25 '15 at 17:31
• If everyone runs out of bullets, then there is obviously a knife fight. – feersum Jun 25 '15 at 21:40

A few minutes ago, I posted this question as a popularity-contest which was quickly put on hold as too broad. Specifically, the "there are no restrictions on what the programs/functions do" was apparently not quite right. A commenter also suggested that an empty program would be a possible answer which I knew, but didn't necessarily want to restrict as I think the popularity contest would have taken care of that. I'd be interested in any suggestions people have to make the question more appropriate for PPCG.

Also, I plan on asking with the tags popularity-contest and restricted-source. Does that seem right?

Here is the question:

Inspired by the bonus in this question

Write some code that can be run in multiple directions. In each direction, the code must be a complete program or a function. The code must be written in one language (so for example, you cannot have a python program that is also a whitespace program when run backwards).

### Explanation of "multiple directions"

abcd efgh
ijklm
nop


Then backwards is

hgfe dcba
mlkji
pon


And sideways is

a n
bio
cjp
dk
l
em
f
g
h


### Trivial example

Brainfuck

 .
.+++++++++
+++++++++
+++++++++
+++++++++
+++++++++
+++++++++
+++++++++
+++++++++
+++++++++.
.


### Notes

• there are no restrictions on what the functions/programs do
• your code must be able to run in at least two directions, but more is better
• abuse of comments is frowned upon but allowed
• Welcome to the sandbox! You deleted your post before I could add another comment, so here's what I wanted to say: What makes an answer "good" in this question? If we go by the criteria "your code must be able to run in at least two directions, but more is better", which the empty program satisfies, that seems a little contradictory. Thus I think it's good to place some sort of restriction on the programs. I think source-layout is better than restricted-source - take a look at the questions there and see what you think :) – Sp3000 Jun 27 '15 at 6:17
• Also, as is even if the question wasn't closed as too broad, it'd probably be closed as a duplicate of this question, which you might want to also take a look at. – Sp3000 Jun 27 '15 at 6:18
• Thanks, I'll look through those questions. And I think you're right. That other question is pretty similar. I might just let it go. – sudo rm -rf slash Jun 27 '15 at 13:40

### Allongiator code-golf

There are a lot of acronyms on the internet -- ROTFL, RTFM, NSA, laser, taser, and so on. Your job is to write code that, given an acronym, can figure out what that acronym might stand for. You'll be given an alphabetically-sorted list of words that you can use, to be provided in the format of your choice.

Note that if you're given an actual acronym, you don't have to provide what it really stands for. As an example, given ROTFL, you could output "rolling on the floor laughing", or you could output "rearrange orange thrice free language".

### Input

1. A dictionary of all of the words you're allowed to use. This is guaranteed to have at least one word for each letter; your program is allowed to do anything it wants if it encounters a letter that it can't find a word for.
• Not necessarily in alphabetical order
• All in lowercase
2. A string of lowercase letters, with no whitespace, punctuation, or non-letter characters.

They can be given in any format you want. For example, the acronym could be the first command line argument and the dictionary the rest of them, or they could be arguments to a function, or given via standard input, or whatever.

The dictionary contents can be found [here].

### Output

1. A string containing a space-delimited list of words that form the acronym given as input, from the dictionary given.
• No trailing whitespace except for a single optional newline
• The words must be chosen (pseudo-)randomly from the dictionary -- that is, if I run it twice with identical inputs, I should get different outputs1.
• It doesn't have to make sense or be plausible or grammatically correct. Any words that start with the right letters will do; however, bonus points2 to anyone who manages that.

Since this is , the shortest answer wins.

All the standard prohibitions apply here, though with the note that accessing the dictionary from the web is acceptable, so long as it's the unmodified dictionary and nothing else.

1: Barring practically impossible situations.
2: That is, a browser cookie

Sandbox (foot)notes:

This may very well be a duplicate. I looked around as much as I could, but I don't even know what this is called, so I didn't find much. Apologies if it is.

Would they be acronyms or initialisms? I'm not sure.

I'll add the actual dictionary once I've found a nice one that isn't massive.

• A quick search for acronyms turned up this – Sp3000 Jun 27 '15 at 6:31
• @Sp3000 ...I even upvoted that question and I forgot about it. Should I delete this post? – Nic Hartley Jun 27 '15 at 6:32
• I'm not sure tbh... might be good to get a second opinion, since I'm not sure whether that one being a popcon changes anything – Sp3000 Jun 27 '15 at 6:33
• @Sp3000 Alrighty. I'll leave this up. (Thanks for replying so quickly, by the way) – Nic Hartley Jun 27 '15 at 6:51
• Eww, CR..... =) – Faraz Masroor Jun 28 '15 at 3:42
• @FarazMasroor Nooo my secret is revealed (I recognize you from that meta question! Hi!) – Nic Hartley Jun 28 '15 at 3:42

## Introduction

You're fed up. You've tried to sell your car but failed, not knowing whether your price is too high, too low or people are just too picky. Then a programmer decides to take a look at your car and makes you an offer using a program that he had written for judging a car's worth.

## Challenge

Given a car's make, model and mileage, you have to find how much a car is worth using the method below. The shortest program to do so wins.

If the make or model of the car is incorrect, you must output "Error: [input make/model] is invalid".

## Method

First of all, you should scrape all of the prices and mileages of all of the listings on AutoTrader.com of the specified car. Next, plot these on a graph (this graph is not needed to be shown) of mileage against prices.

On the graph you should draw a line of best fit. Now you can read the price on the line of best fit for the specified mileage of the car. Now output this with a dollar sign before the price.

## Example

None of these prices are correct output

Ford Fiesta, 200 miles

Input: ford, fiesta, 200
Output: $15000  Subaru Outback, 0 miles Input: subaru, outback, 0 Output:$27000


## Example script

Here's my example test script in Python 2.7 (uses autotrader.co.uk though, not .com):

from BeautifulSoup import BeautifulSoup
import urllib2, sys, re, pylab

model, make, mileage, postcode = sys.argv[1:]
mileage = int(mileage)

soup = BeautifulSoup(page)

results = soup.findAll("div", {"class":"search-result__content"})

cars = []

for j in results:
pricetag = j.findAll(text=re.compile(r"&pound;.*"))
price = int(pricetag[0].replace(',','').replace('&pound;',''))

mileages = j.findAll(text=re.compile(r".+ miles"))
mileagecar = int(mileages[1].replace(" miles","").replace(",",""))

cars.append([mileagecar, price])

x = [k[0] for k in cars]
y = [i[1] for i in cars]

poly = pylab.polyfit(x, y, 2)

print("£"+str(int(pylab.poly1d(poly)(mileage)+0.5)))

• I believe scraping autotrader.com violates their visitor agreement. Section 5 seems to imply that it's illegal as well (though that may well depend on the jurisdiction). – Geobits Jul 1 '15 at 20:00
• @Geobits Damn it haha... I'll look for some kind of API for another online car sales site... – Beta Decay Jul 1 '15 at 20:01
• I'm also not sure where the pounds/dollars difference comes in. Both of those cars are available in the US, for example, but output is in pounds. I don't see anything in the input to say which to use. – Geobits Jul 1 '15 at 20:05
• @Geobits It was based on whether the program used AutoTrader**.com** or .co.uk – Beta Decay Jul 1 '15 at 20:07
• Well... I mean I got that. But it's a code golf; why would you use the longer one? I assumed there had to be some reason you made the choice, not just because you felt patriotic ;) – Geobits Jul 1 '15 at 20:09
• For instance, what if I decide to use the US site, and there are no matches for a particular make/model (even if there may be on the UK site)? Is my output "wrong"? – Geobits Jul 1 '15 at 20:10
• @Geobits I see... Well I'll limit it to an American site when/if I find one – Beta Decay Jul 1 '15 at 20:14
• Doesn't really matter where the site is from, really, as long as it's one site. Or there's something in the input to determine that. If the input was, say ford fiesta 200 dollars (or us/uk, gbp/usd, etc) then that part wouldn't be an issue. – Geobits Jul 1 '15 at 20:15

# Meta-Manufactoria

Manufactoria is a pretty great programming game. However, instead of writing machines to solve the problems, your goal is to write a program that creates the machines for you. If you are already familiar with Manufactoria, then for the next section, you only need to read the italicized phrases.

# The Rules of Manufactoria

In this version of Manufactoria, you are placed in a 9x9 world. The input generator is in the center top square (4, 0), and the output acceptor is in the center bottom square (4, 8). When input is generated, it moves immediately down.

Input is represented by a robot that has a queue of colors. Output will be the same robot, but the queue may contain a different sequence of colors. Robots must always eventually end up in the output square. There are 2 colors available, Red and Blue.

Each tick, the robot moves 1 square. The direction the robot moves, and any modifications to the queue is determined by the square it is on. There are 3 types of squares:

1. Movement square. This square either moves the robot North, East, South, or West and does not affect the queue. You cannot have two movement squares on the same tile

2. Choice square. This square moves the robot based on the top color in the queue. The general Choice square moves the robot east if red, west if blue, south if empty, and never north. This square can be rotated or reflected to change the directions traveled.

3. Writer square. This square writes a color to the back of the queue, and moves the robot in a given direction.

# STDIO and Scoring

Your program will be passed two lists of the same length, one containing the inputs, and the other containing the outputs. Each item of each list contains only the R and B characters, representing the input queue.

Your output is the board that solves the Manufactoria puzzle. Each square is represented by two characters. The first character represents the square type, the second represents the direction. The square types can be:

• Movement
• Choice
• Red writer
• Blue writer.
• .. Empty square
• II Input
• OO Output

The directions are: - North - East - South - West.

The direction listed for a choice tile represents the direction traveled if the queue is empty. If the direction is lowercase, the tile is reflected (which swaps the colors).

The program which solves more puzzles than any other program wins. In the event of a tie, the tiebreaker is the program that produces the most efficient solutions. Efficiency is measured by the number of times the robot moves across all of the solutions.

Your program should be a general solver. I may add puzzles to the ones listed below at any time.

# Sample Puzzles

The solutions given below don't necessarily have to do what the title indicates. Your program's solution also doesn't have to match the ones listed below. It only needs to solve the inputs given. The format below is

[Inputs] [Outputs]
Solution Map


Example 1: Don't do anything

["","R","B","RRBR","BRRBRB"] ["","R","B","RRBR","BRRBRB"]

........II........
........MS........
........MS........
........MS........
........MS........
........MS........
........MS........
........MS........
........OO........


Example 2: Print second R and anything after:

["","R","B","RR","BRB","RBRBBB"] ["","","","R","","RBBB"]

........II........
..MSCSMWCSMW......
..RSMEMEMS........
BECsMEMEMS........
........MS........
........MS........
........MS........
........MS........
........OO........


Example 3: Reverse String (This doesn't reverse any string, it only works for the examples listed)

["","BBR","B","RRB","BRRRB","BBRB"] ["","RBB","B","BRR","BRRRB","BRBB"]

........IICsMERS..
......CECSCEMSBS..
......RSMSCEMSMW..
......REMSCEMS....
........MSRSMS....
........MSRSMS....
........MSRSMS....
........MSBWMW....
........OO........


Example 4: Only include Rs

["R","","BBR","BRR","B","RBRBRBBR","BBBBBBRRR","RBBBRBRBBB","RRRR"] ["R","","R","RR","","RRRR","RRR","RRR","RRRR"]

........II........
........MEMEMEMS..
MSCSMWCSMWCSMWCSMW
REREMERERSMW..MS..
........MSMWMWMW..
........MS........
........MS........
........MS........
........OO........


• Sounds extremely difficult. – feersum Jul 7 '15 at 3:07
• I enjoyed playing that game...Hard indeed. :-) – Spikatrix Jul 7 '15 at 12:39

(Need a title.)

Write two programs (or functions) in the same language for these two tasks:

1. Given a list of integers, split at every non-negative integer. If there are two or more consecutive non-negative integers, your program should preserve the empty list between them.
2. Given a list of lists of negative integers, concatenate the lists and insert non-negative integers between them. The inserted integer after the nth list (zero-based) should be n.

Alternatively, you can increment every integer by one for both tasks. So you split at positive integers, accept non-positive integers in task 2 and the inserted integers start at 1.

The input for task 1 and the output for task 2 should have the same format, with the exception that one can be the string representation of the other in your programming language. The same goes for the output for task 1 and the input for task 2.

Your score is the total length of your two programs times (30 + their Levenshtein distance). Lowest score wins.

Input:  [-5 7 8 -5 2 -6 -3 -3 8]
Output: [[-5] [] [-5] [-6 -3 -3] []]


Input:  [[-5] [] [-5] [-6 -3 -3] []]
Output: [-5 0 1 -5 2 -6 -3 -3 3]

• if(1>2){code1}else{code2}. There's no need to ever have the edit distance any greater than 1 or 2. – John Dvorak Jul 12 '15 at 6:03
• better yet: if(input[0] instanceof Array<int>){code1}else{code2}. Haskell might be able to pull this off even more cleanly because the typeclasses are resolved at compile time, meaning that even empty arrays have the proper type. – John Dvorak Jul 12 '15 at 6:06
• The first task description is extremely unclear. What does it mean to split? How can one preserve something that didn't exist in the first place? – Peter Taylor Jul 12 '15 at 16:55
• @JanDvorak If the answer is less than 30 bytes, it is beneficial to remove a byte while increase the edit distance by one. But maybe I should change it to the length plus the edit distance. – jimmy23013 Jul 12 '15 at 19:48
• @PeterTaylor It just works like the CJam and GolfScript /. I'll try to reword it later if I get the scoring method working. – jimmy23013 Jul 12 '15 at 19:50

# Return of the 5318008

## Introduction

A week or so ago, I posted the challenge 5318008, with a massive reaction. Now, I want you to do the same again but with musical chords.

## Challenge

Given a word list, you must output a list of words which can be formed using musical chords. However, the word must also sound good too.

The chords which you may use are:

A B C D E F G


These are all the major chords without the flat/sharp chords.

A word will sound good if all of its letters are within the same key. All the chord progressions which you must concern are listed below:

• A major: A D E G
• B minor: D G A
• D major: D G A
• E major: E A B D

Other progressions such as G or C major could not make any word because all of the major chords (which were not sharps or flats) were consonants.

For my tests, I used the UNIX wordlist, gathered by typing:

ln -s /usr/dict/words w.txt


Or alternatively, get it here.

There are some uppercase letters in the dictionary, so make all of the letters in all of the words in the dictionary lowercase.

## Winning

The shortest code to output a list of words wins.

• What about A minor? – Nathan Merrill Jul 13 '15 at 17:03
• @NathanMerrill No vowels in Am, just C F and G – Beta Decay Jul 13 '15 at 17:05
• I don't understand then. A minor includes "a" and "e" – Nathan Merrill Jul 13 '15 at 17:09
• What about case sensitivity? Also I'm expecting this to end up as a regex challenge, if I've understood the problem correctly – Sp3000 Jul 13 '15 at 17:10
• @Sp3000 Edited to say that all words should be converted to lowercase – Beta Decay Jul 13 '15 at 17:13
• @Nathan Sorry, I was talking about chords instead of notes :/ – Beta Decay Jul 13 '15 at 17:14
• So I'm to assume that A would only be included if A major is a subset of the key? – Nathan Merrill Jul 13 '15 at 17:18
• @Nathan Uhh yes – Beta Decay Jul 13 '15 at 17:22
• Ok. Also, B minor and D major include the same notes, so the notes listed should be the same. D major shouldn't have the C, as it has a C#. – Nathan Merrill Jul 13 '15 at 17:24
• I don't know much about music theory, but from what little I do know I find this question very confusing. A B C D E F G doesn't look like a list of chords, but like the scale of C major. If by the "key of C major" you mean the tonic chord of the scale of C major, that would be C E G, which is not all consonants. I also promise to downvote any question which allows people from one specified nation to answer a different question to people from the rest of the world. – Peter Taylor Jul 13 '15 at 19:25
• @PeterTaylor Refer to this: The chord chart...lists all the common traids and four note extended chords belonging to the key of C major. – Beta Decay Jul 13 '15 at 19:35
• Yes, but that doesn't clear anything up. Unless... are you sure you're not confusing chords with chord progressions? – Peter Taylor Jul 13 '15 at 20:55
• @PeterTaylor Yes, that's exactly what I meant. I didn't know the word for it – Beta Decay Jul 13 '15 at 20:58
• You are definitely confusing notes and chords here. B minor and D major both contain the notes B C# D E F# G A, The possible chords are Bm Em F#m Dmaj Gmaj Amaj and C#dim, with F#m and Em often subsituted for Fmaj and Emaj. One valid interepretation is that both keys contain all these chords, another is that the minor is just B E (F#) and the major is just D G A. Under no circumstance can Bm be considered D G A. You are also misusing the word progression. This refers to the sequence of chords in a particular song and has nothing to do with the chords available in a particular key. – Level River St Aug 8 '15 at 12:32
• A major contains A B C# D E F# G# so the only natural notes are ABDE,which is what you have written for E major. E major contains one additional sharp E F# G# A B C# D# so the only natural notes are E A B. – Level River St Aug 8 '15 at 12:35

# Break out of the digital world!

Note: The tag is just something I knocked up quickly, if anyone has any better ideas please let me know.

## Challenge

You must write a morse code to ASCII translator using an external device (such as a button or the spacebar on the keyboard).

### Dots

A button press is a dot when it has been pressed for 0.5 seconds or longer and released.

### Dashes

A button press is a dash when it has been pressed for 1 second or longer and released.

### Exit

A button press is an exit when it has been pressed for 5 seconds or more. This should end the program and display the result.

### Space

A space is when there has been no button input for 1 second. This should move on to the next letter.

Your code should support every character on the following:

http://zunkworks.com/images/bluetoothmorse/morsecode1.gif

## Winning

The shortest code wins. You may write this in any language that allows input from an external source. For example, Arduino or Python (on a Raspberry Pi).

• Does this actually have to be able take input from hardware? Can you allow feeding in simulating data? I think a standard format like a sequence of numbers measuring current/voltage every millisecond would make it more accessible. – xnor Nov 18 '14 at 1:35
• While I do own an arduino, I see absolutely no reason why this challenge should be limited to using an external switch. Is there anything wrong with using the space bar or a mouse button? If it HAS to be an external switch, how about I rip open my mouse and connect an old doorbell push across one of the mouse button contacts? – Level River St Nov 27 '14 at 20:45

# VSEPR Strikes Back!

(Note: I know that the VSEPR method fails sometimes, and that there are exceptional molecules. This is addressed in the scoring system, and otherwise the challenge is about the molecules which conform.)

Most people who have taken an introductory chemistry course know about molecules, and (probably) the VSEPR theory of chemical bonding. Basically, the theory predicts the shape of a molecule given three main properties: the central atom A, the number of atoms bonded to the central atom X, and the number of lone electron pairs E on the central atom. Applying the VSEPR theory is simply a matter of finding the values of X and E (A always has an implied value of 1, as we'll see). This is called the AXE method. For example, a molecule which has 1 lone pair and 3 atoms bonded to the main atom is AX3E1, which is the trigonal pyramidal configuration.

## The Challenge

Your job is, given a covalent chemical compound, to output the geometrical shape of the molecule inputted. But wait! exclaim the exasperated programmers, you can't expect us to input all of the molecular data for every element! Of course we can, but I'm not feeling particularly masochistic today, so born was the scoring system below.

The input is any molecule, such as CO2 or HgCl2, and the output should be the name of the shape and NOT the AXE form. Ions should have their charge put in parenthesis directly after the ion, such as CO3(2-) or NH4(1+). 1- and - (and 1+ and +) are all acceptable.

## About the central atom A

In most cases, the central atom will be apparent. It usually has no subscript in the chemical formula: the C in CO2 is the central atom, for example. In a few cases, though, you might face compounds like ethelyne (C2O4), in which no clear atom is the central one. In this case, it is worth noting that such compounds are usually symmetrical, and considering any carbon to be the central atom will do.

## Scoring System

The base score is the number of bytes the program takes.

1. There is a minimum of 6 elements to be implemented for input; every 5 extra you add multiplies your score by 0.9.
2. Multiply your score by 0.8 if you can make your code work for ions.
3. Multiply your score by 0.9 if you can detect ionic compounds (VSEPR only works for covalent compounds) and reject them accordingly.
4. Multiply your score by 0.8 if you also output the bond angles.
5. There are certain classes of molecules which VSEPR fails to predict correctly, due to various reasons. (Check the first link in the post for the section on the exceptions.) Multiply your code by 0.9 per class if it returns those correctly.

## Test Cases

The parts in brackets are optional bonuses from above.

CO2: CO2 -> linear [180*]
HgCl2: HgCl2 -> linear [180*]
H2O: H2O -> bent [104.5*]
[CO32-: CO3(2-) -> trigonal planar 120*]
BrF: BrF3 -> T-shaped [90*]
[NaCl: NaCl -> Ionic compound]
XeF4: XeF4 -> square planar [90*]

Notes:
- The bonding patterns are not valid when the central atom is a transition metal (so don't do that.).
- Standard loopholes apply.

# One transparent colour sprite

## Overview

This challenge will only involve a hex string as input and a hex string as output, but will be explained in terms of computer graphics.

Given a fixed size background image, a smaller fixed size sprite image and its location, place the sprite on the background image allowing the background to show through for one specified colour of the sprite image.

## Details

• The background image will always be 32 by 18 pixels.
• The sprite image will always be 8 by 8 pixels.
• The colours will always be in the range 0 to 3 inclusive.
• There will always be exactly one transparent colour, from 0 to 3 inclusive.
• The location (x, y) of the sprite may be outside or partially outside the background image.

## Input

Since all inputs will always be the same size, there will be no separators, just a single string of hex digits.

To avoid having to define negative inputs, the top left pixel of the background image will be (128, 128), increasing left and down, and x and y will be defined by 2 hex digits each, giving a range of 0 to 255.

The input hex string will be made up of:

• Background pixels, 2 per hex digit, a string of 32 * 18 * 0.5 = 288
• Sprite pixels, 2 per hex digit, a string of 8 * 8 * 0.5 = 32
• Transparent colour, a single hex digit (the most significant half of the hex digit is unused)
• Sprite x and y, 2 hex digits each, a string of 2 * 2 = 4

The input will therefore be a string of 288 + 32 + 1 + 4 = 325 hex digits with no separators.

## Output

The output is the finished 32 by 18 pixel image, as a string of 288 hex digits with no separators.

## Format

### Pixel order

Each image is ordered in English reading order, left to right then top to bottom. That is, the pixels are listed in rows. The first pixel listed will be the top left. This applies to both the background image and the sprite image.

### Colour encoding

Pixel colours are encoded 2 per hex digit, most significant first.

For example, the hex digit B corresponds to binary 1011. This means the first pixel has value 10 = 2 and the second pixel has value 11 = 3.

### Transparent colour

Since the single transparent colour is encoded in one hex digit, which normally holds 2 colours, the first 2 bits (most significant) are ignored and the last 2 bits (least significant) are used to represent the transparent colour.

For example, the hex digit D corresponds to binary 1101. The 11 is ignored and the 01 is used to indicate colour 1.

Although the first two binary digits are always ignored, you may not assume they are always 00. They may take any value and all hex inputs of the correct length should produce a valid output.

### Coordinates

x and y are encoded as 2 hex digits each, most significant first.

For example, the hex string 2A corresponds to binary 00101010, and decimal 42

### Case sensitivity

Your code may accept input as either upper case or lower case hex digits, or both. If it only accepts one or the other case, it must also output in the same case.

You may not choose an arbitrary 16 characters to represent hexadecimal. You must use either (or both) of the following as input:

0123456789abcdef

0123456789ABCDEF


You must choose one or other (not both/mixed) to use as output. That is, you may accept inconsistent inputs if you wish to, but the output must be either always lower case or always upper case.

# Sandbox thoughts

• I'm considering adding example inputs and outputs and maybe a snippet to verify the output of arbitrary inputs for testing.

# Live Tennis Scoreboard

In this challenge, we're going to create a tennis scoreboard that could (theoretically) be used in an actual tennis match. The tennis scoreboard will display the score while listening on STDIN. As new results come in on STDIN, the tennis scoreboard will update itself accordingly.

### Description of Input

When the scoreboard is first instantiated, it will be provided input for two strings -- these are the names of the competitors. This can be via command line arguments, user input functions, etc.

After that, the scoreboard will recieve input via STDIN. These correspond to events that the scoreboard should reflect in the score.

• 0

The first player has scored a point.

• 1

The second player has scored a point.

• U

Undo the previous point and revert to the previous state of the scoreboard.

The scoreboard must handle games, deuces, etc. as described in the next section.

### Terse Description of Tennis Scoring System

This section here describes the exact rule set to use.

A match is between two players. To win a match, a player must win three sets. To win a set, a player must win at least six games and have a two-game lead over their opponent. To win a game, a player must win at least four points and have a two-point lead over their opponent.

The number of sets and games won are displayed as is. Points are displayed as follows in order of priority:

• 1 point = 15
• 2 points = 30
• 3 points = 40
• Number of points won are equal to the opponent = 40
• Number of points won are one greater than the opponent = Ad

Tiebreaks are optional. Implementing tiebreaks grants you -40 to your score.

### Scoreboard Format

During the first set and first game:

Name | x
Name | x


where x is the point display for each player.

During the first set:

Name a | x
Name a | x


where a is the number of games won by each player.

During the second set:

Name b a | x
Name b a | x


where b is the result of the first set.

During the third set:

Name c b a | x
Name c b a | x


where c is the result of the second set.

etc. for fourth and fifth sets.

Example:

Federer 5 6 6 3 2 | 0
Murray  7 4 4 6 2 | 15

• A bit of a far stretch, but it would be cool if you could point the programs at URL which gave the scores for an actual tennis match – Beta Decay Jul 27 '15 at 8:04

# Punch buggy?

As some of you might know, "punch buggy" is a children's(?) game that involves spotting Volkswagen Beetles and punishing other players. For reference, the car on the left is a punch buggy, while the car on the right is not:

Your task is: given an image, determine whether there is a punch buggy shown in it. Entries will be scored by percent correct among all n (TBD) test images. If there is a tie, it will be broken by run time on my computer (specs will be posted on main).

Test images may contain just about anything, and come in various sizes. Most will be automobiles of various types, but I will make sure they have a maximum of one auto in them (so if you see a non-matching car, you don't need to look for more). I won't use toy cars or heavily modified cars to try to fool you. Images will be pulled from Google Image Search, and will be of varying quality (from ad-quality to candid in-the-yard).

This is not a Kolmogorov complexity challenge. The point is not to recognize specific image files, but to recognize a Beetle in any picture. If it looks like someone is cheating this, I will change to a different test set and re-score.

### Spec

Input is the name of an image file in JPG or PNG format (should I restrict this to one?).

Output is Punch Buggy! if a punch buggy is present in the picture, and any other non-empty string if not.

Programs are run once per image. I will write a simple test controller for this using STDIO, so programs must be runnable from the command line, using a language that is freely available on Ubuntu.

You are allowed to read/write other files, but only in a folder with the relative path /yourProgramName. You are allowed to read files whose names are passed as input via STDIN.

### Sandbox

Yes, this seems a bit difficult to me, too. I don't see that as a problem. Is there anything that isn't clear about the task or spec? Other notes/questions/suggestions?

If it needs fluff (I'm not sure yet), it will probably be something like "help my robot become more human via children's games".

• Personally, I don't think this is that hard. You just look for a large grouping of yellow pixels around the centre of the image. I think you should limit it to a PNG. – Beta Decay Jul 29 '15 at 13:21
• @BetaDecay That would only work if all punch buggies are yellow and all other images/cars are not. The images shown here are only representative samples. The test cases will include various cars of various colors at various angles in various lighting conditions. – Geobits Jul 29 '15 at 13:27
• Ohh I thought Punch Buggy was when you have a yellow car, not just a Beetle – Beta Decay Jul 29 '15 at 13:30
• Ah. That's the Yellow Car Game. Similar, but yea, that would be a different difficulty level. – Geobits Jul 29 '15 at 13:32
• I afraid even if you people try to recognize buggies their results will come from randomness and overlearning on the provided images. Recognizing a car at all would be a difficult task itself. – randomra Jul 30 '15 at 11:49
• If you want to avoid this being a kolmorogov challenge, would it help to provide a much larger training set and test on a small subset of this that is not announced in advance? That does introduce a deadline excluding future submissions though. – trichoplax Aug 1 '15 at 18:30
• @trichoplax Not necessarily, because you could always test the new submissions using the subset (which is still unannounced) – Beta Decay Aug 5 '15 at 11:48
• @BetaDecay good point. That makes this sort of challenge seem much more promising. – trichoplax Aug 5 '15 at 12:27
• @trichoplax Though it could still be a kolmogorov complexity because a program could be programmed to recognise all pictures in the album, and choosing a subset wouldn't stop that program from getting full marks – Beta Decay Aug 5 '15 at 12:37

Question about symmetry in ascii grid (temp title)

Synopsis: Given a grid of ASCII characters, determine if, and in what ways, the grid is symmetrical.

Some characters are symmetrical to others. For example:

• d is symmetrical vertically to b
• W is symmetrical horizontally to M
• O is symmetrical both ways to O
• ! is symmetrical horizontally to i (takes some imagination!)
• ^ is symmetrical horizontally to v
• b is rotationally symmetrical 180 degrees to q (that is, if you rotate the first character 180 degrees, you get the second character)
• (space) is symmetrical vertically, horizontally, and rotationally to

In this challenge, there are only three types of symmetry that need to be considered: vertical, horizontal, and rotational by 180 degrees. You can find a full list of which characters are considered symmetrical at the bottom of this post.

If we arrange some characters into an n by m rectangle (where n and m are both even integers), then the rectangle may be symmetrical. Here is an example:

M^^^^MM^^M
OOOOOOOOOO
OOOOOOOOOO
WvvvvWWvvW


It is symmetrical horizontally.

Here's another example.

dddbbb
dddbbb
dddbbb
ddOObb


It is symmetrical vertically.

Here's one more example:

++++++
+p++q+
++++++
++++++
+b++d+
++++++


This one has three ways it is symmetrical -- horizontally, vertically, and rotationally.

Write a program which will, when given a rectangle of characters as input, output the number of ways that rectangle is symmetrical. For the three inputs I've shown above, the outputs would be 1, 1, and 3 respectively.

[Todo: list of characters]

## Sandbox Questions

1. One thing I've been considering is allowing entrants to access the list of which characters are symmetrical (in some sort of CSV format) in a file. This would mean that entrants wouldn't have to encode the symmetries themselves. On one hand, this probably saves some frustration at having to code in all the possible symmetries. On the other, this reduces the complexity of the challenge as the aspect of encoding the symmetries with minimal characters is removed. I'd like your thoughts on this.
• Yet more symmetries: all of []{}() are vertically symmetric to themselves. | belongs in "Both". lower-case c belongs in vertical. Maybe also lower-case a depending on the font your going by (apparently not the one used on SE). Likewise t might belong in horizontal symmetry. We also forgot about digits: 08 both ways, 3 vertical. – Martin Ender Sep 1 '14 at 11:58
• What do you think about adding rotational symmetry (by 180 degrees) to the mix? – Martin Ender Sep 1 '14 at 11:59
• ​​​​​​​​​​​​​Like 6 and 9? I think rotational symmetry would do well as a seperate question actually. – absinthe Sep 1 '14 at 12:08
• Yes, like 6 and 9. If a new question for that is based on the same concept, it would probably be too similar to not be a duplicate (at least the solution I have in mind would be rather easily adapted to do rotational symmetry, I think). Adding it here, might open some possibilities for interesting compression/golfing. – Martin Ender Sep 1 '14 at 12:11
• You've convinced me. I'll edit in the rotational part when I have time. – absinthe Sep 1 '14 at 12:14
• Since there will probably be combinations of all three symmetries on different characters, I'd recommend only having one list for each symmetry (with some pairs in multiple lists). Here are the rotational pairs I can think of: d/p, b/q, (/), [/], {/}, </>, %/%, ///, \/\, ,/,, S/S, s/s, z/z, Z/Z, W/M, !/i, ^/v, $/$, as well as all those which are symmetric both ways to themselves. – Martin Ender Sep 1 '14 at 12:22
• Some of the characters are not visible (at least on my screen) so would benefit from being followed by a description. I think they are just spaces but markdown appears to fail to display them even in backticks. – trichoplax Sep 1 '14 at 14:09
• Displaying a single space in an inline code tag has to be done with an actual <code> tag rather than with backticks. codegolf.stackexchange.com/questions/5194/… is a good starting point for rotational symmetries. Some digits also have linear symmetries. – Peter Taylor Sep 1 '14 at 14:39
• Would you also consider J and L as symmetrical (also requires a little imagination...)? – WallyWest Sep 2 '14 at 22:41

# Clarence the Fast? Typist

(Inspired by this excellent question on the original challenge.)

Introduction

Lawrence is a business manager who works at an Internet service provider. Recently, he has noticed that Clarence, the data entry clerk, has been typing a little slow lately. Since Clarence's job is entering the IP addresses manually into the database, Lawrence is starting to get worried. Especially that there is now a backlog of angry customers who are calling to ask why they are not connected to the Internet yet.

Lawrence, as you might expect from one who manages an ISP, has hit upon what he considers to be an excellent solution to the problem. He decides to optimise the layout of Clarence's keypad to make it faster for him to type in the IP addresses.

Clarence's keypad is normally laid out as follows:

123
456
789
.0E (E stands for "Enter")

The distance between the centres of each adjacent key is 1 centimetre. Clarence types using the "eagle search" system -- he uses one finger only and moves that finger from key to key to type in an address. For example, to input the number 7851, Clarence would start his finger on 7, move 1cm right to 8, move 1cm up to 5, then move √2cm to 1 -- a total of 3.41cm.

If we rearrange his keypad like this, we can get better results:

423
156
789
.0E

With this layout Clarence only needs to move his finger 3cm. This saves time!

Your task is to write a program that determines the most optimal keypad layout, given a list of IP addresses that Clarence must type in. Clarence needs to push the E after each IP address, so you also need to optimise the position of the E key.

Input Description

Input is a newline separated list of IP addresses. Each IP address is a string that will be in the form

().().().()

where each () is an integer in the range 0 - 999. I would also like to point out that addresses such as 0.42.42.42 or 999.999.999.999 in the input are still valid, despite the fact that they are invalid IP addresses. So you don't need to include any IP address verification code in your program.

Output Description

Output the layout of the keys such that the distance Clarence needs to move his finger to type them all in is as low as possible. If there are multiple layouts that are equally as low, output any one of them.

The format for the output looks like this:

123
456
789
.0E


[todo: example inputs and outputs]

• Lose the intentional confusion of the names. The point of a specification is to be easily understood, not deliberately confusing. – Peter Taylor Aug 5 '15 at 10:51
• I don't think it affects the challenge in any way, but 999.999.999.999 makes my eyes bleed. – Dennis Aug 8 '15 at 5:01

# Is a picture worth a thousand words?

There is an old saying that goes "A picture is worth a thousand words". For us programmers, pictures and words are actually quantifiable in bytes. (A word is worth 8 bytes on a standard 64-bit system, a thousand words is worth 8000 bytes, and an image is worth the number of bytes needed to store it in the particular format it is in.)

Write a program or function that, given the path of an image as input, determines if it is or is not worth a thousand words. Print worth it if it is, and not worth it if it is not.

This is a challenge, so the shortest answer wins!

## Problems:

Too simple, maybe have the programs perform a check on the environment to determine actual word length?

No test cases (Yet)

Question is sort of short

• I love the title, but I'd agree the challenge is too simple. This is just os.path.getsize in Python, for instance. I'd suggest playing off the 'thousand words' part of the challenge more. – absinthe Aug 11 '15 at 22:30
• @Pyrrha how would you suggest playing off of the 'thousand words' part? A thousand literal english words? Maybe have the program convert an image into words and words into images (Obviously not accurately, e.g. 'Blue' will not give a blue image, 'Blue' is just a symbol. 1000 symbols represent the image by dictionary lookup, or something. – rodolphito Aug 12 '15 at 2:29
• If you have a good idea feel free to take over the challenge :) – rodolphito Aug 12 '15 at 2:30
• Alternative: Find 1000 English words (i.e. letter sequences) in the image file’s source code. – Crissov Aug 12 '15 at 11:19

### Introduction

You've gotten tired of reading text ads dispersed throughout your content. You've tried solving this problem using a simple find-and-replace solution, but the advertisers have wisened up! Every text ad now comes in slightly different variations to slip past your filter.

### Challenge

Write an adblocker that, given a sample ad, removes all variations of it from the content. Your program must remove every sentence in the input for which 75% of its words are identical, and in the same location.

This is codegolf, shortest answer in bytes wins!

### Example

Buy my computer now with cheap free shipping.

Buy my laptop today with cheap free shipping.

is an ad because 6 out of 8 words (>= 75%) are identical and in the same locations.

The computer was expensive but shipping was free.

is not an ad because 0 out of 8 words (< 75%) are identical and in the same location. Note how computer, shipping, and free don't count as identical because they are in different positions in the sentence.

If a sentence is not the same length as the ad, it isn't an ad.

### Bonus

After matching an ad, remember which words were used as replacements, and use them to match future ads.

For example, when Buy my laptop today with cheap free shipping. was matched to the given sample Buy my computer now with cheap free shipping., your program should remember that laptop and today are synonyms for computer and now, respectively.

If laptop or today are ever encountered in a future sentence, they should be matched with their synonyms in the ad.

Your program only needs to match synonyms in content that appears after the synonym was found.

So, if the sentence Purchase my laptop today with cheap free shipping. was encountered after your program found out about the aforementioned synonyms, it would match because 7 out of 8 words matched in the same location (>= 75%). Note that a program that doesn't claim the bonus would only match 5 out of 8 words (< 75%), and would not consider the sentence an ad.

Your program should then proceed to make note that Purchase is a synonym for Buy, and continue processing the content.

Programs claiming this bonus can claim a 35% reduction of their score, i.e. score_with_bonus = number_of_bytes * 0.65.

### Input

Accept one sentence as a sample advertisement followed by a number of sentences of content. Only letters of the alphabet, spaces, and periods will appear in the input.

Input may be taken in any convenient format for your language. For example, accepting a string for the ad sentence and an array of strings for the content is acceptable.

### Output

Output the content without the ad variations. The content must be in the same order.

The output may come in any reasonable format for your language. For example, printing to a file or stdout is acceptable. If your language makes it easier to output an array like ["Content 1", "Content 2", ...], or in a similar such format, this is acceptable.

### Test Cases

Input

Two for one deal on lumber for a limited time only.

Make sure to pace yourself well when you run long distances.
You don't want to tire too quickly.
Three for one deal on tires for a limited time only.
Training is a must.
Two for one deal on lumber for a limited time only.
Three for one deal on tires for a short period only.


Output (with bonus)

Make sure to pace yourself well when you run long distances.
You don't want to tire too quickly.
Training is a must.


Output (no bonus)

Make sure to pace yourself well when you run long distances.
You don't want to tire too quickly.
Training is a must.
Three for one deal on tires for a short period only.


### Notes

You may write a program or function.

More test cases to come!

This is my first challenge, so please give suggestions on how to improve!

In particular, comments on whether or not the bonus is appropriate would be appreciated. Also, it would be nice to know thoughts concerning the challenge as a whole (good, bad, too easy, too hard...?), so that I can better frame future ideas! Thanks!

• So the input won't have any newlines? That is, the content will be a series of one or more sentences just separated by a period and a space? Could I write a function that accepts the ad as one parameter and the content as another? – Alex A. Aug 14 '15 at 4:07
• You many accept the input in any reasonable format. (So yes, @AlexA., that would be fine) – jrich Aug 14 '15 at 4:07
• But what about So buy my computer now, cheap with shipping? That's just 1 out of 8, when in reality it should be 7 out of 8... – Beta Decay Aug 14 '15 at 7:33
• You mention that commas may be included in the input, but you don't say how they affect the matching. – Peter Taylor Aug 14 '15 at 7:43
• @BetaDecay For the purposes of the challenge, we assume that the advertisers do not get more sophisticated than a simple replacement of words, not an addition, subtraction, or rearrangement of words. Obviously this wouldn't be a very effective adblocker, but I thought it would make for a reasonable challenge. – jrich Aug 14 '15 at 13:32
• @PeterTaylor Commas may be ignored in the input. Periods only matter for separating sentences. For matching purposes, only letters of the alphabet matter. – jrich Aug 14 '15 at 13:33
• If commas can be ignored, you might as well remove them entirely from the spec. ',- (in CJam) isn't really where the interest lies. – Peter Taylor Aug 14 '15 at 15:09
• @PeterTaylor You're right, commas aren't where the interest lies. I'll remove them from the challenge. – jrich Aug 14 '15 at 15:35

# Kolmorogov image complexity

The 512 by 512 pixel image below [ to be added when posting to main ] was produced using a combination of simple methods that, if known, would allow reproducing the image with a short program. It is therefore known to have low Kolmorogov complexity. However, the original methods used will not be revealed. Instead your challenge is to produce code that outputs this image by your own best method, pixel perfect, so that the hash of your image matches the hash of this image.

[ Hash ]

You may use any built ins and libraries that existed publicly before the challenge was posted, including graphical libraries.

## Input and output

### Input

• Your code is not required to take input.
• Your code must be able to produce the correct output without taking input.

### Output

You may use any freely available image format (free and free) or display the image to screen. Your code is not responsible for converting the image to a format that can be hashed for validation.

## Winning

A valid answer is one for which the output passes the validation test. The winner is the valid answer with the shortest code in bytes.

## Validator

The following code takes a PNG image as input and outputs a hash of its pixel values, announcing whether this is valid.

[ Validator to be added later ]

# Sandbox questions

• I'm considering posting a few example images here in the sandbox so people can feedback on which one would make the best candidate for posting to main. Is this acceptable if I keep the time between posting example images and posting to main reasonably short (a day or two)?

• Would it be better to approach this from the opposite direction and say the winner is the closest to the target image in 300 bytes? I think it can work as a question with insisting on an exact match though - I'm aiming to have several aspects to be golfed down, so even if not all are golfed well the total length should still be manageable. I prefer an exact match and open ended code length, as a byte limit has very different effects on different languages.

• Is there any general advice on what to remember/avoid when preparing the target image? Obviously this cannot be very specific advice as the exact method will not be discussed before posting to main. However, I welcome any hints at things that would make for a good challenge and things that would be trivial or too difficult. I'm definitely going to follow Peter Taylor's advice and avoid any crypto or Mandelbrot zooms. The image should be fairly easy to identify, so the emphasis can be on golfing down the components rather than solving a mystery.

• Would it be better to say "the original method will never be revealed" or "the original method will be revealed once an answer is posted that is shorter than it" or "the original method will be revealed after a set time period"? The last one is my least favourite. I like the idea of a challenge being open ended, so I would prefer to reveal at most only what is already beaten by existing answers.

• I like the idea of using patterns that will be recognisable so people can say "I know that pattern from somewhere" and then look it up and tweak the parameters, rather than just presenting a random looking image that happens to have a simple description. Does this sound like an interesting challenge?

• This basically looks like a single-robber cops-and-robbers. In particular, the by now well-known issues around use of crypto in robbers should be taken into account. Guess-the-Mandlebrot-parameters is also likely to be a waste of time. – Peter Taylor Aug 10 '15 at 18:43
• Related: codegolf.stackexchange.com/questions/24909/kolmogorov-mania . This got very mixed votes at first. Note the edit made with the clue. I say pick an image and try it. Don't say the oiginal method will never be revealed, just give more hints until someone gets it. – Level River St Aug 17 '15 at 14:12
• @steveverrill I definitely don't want something as obscured as that - I want the pattern to be perfectly visible so it's more about golfing than guessing. I like the idea of gradual hints, but if I get mine how I'm aiming to, it won't need hints, just golfing. – trichoplax Aug 17 '15 at 17:15

SETI (search for extraterrestrial life)

In this code golf challenge you will search for signs of life.

Specification:

Your program takes a sequence of exactly 225 characters, each either 0 or 1. You return as output a single bit, either 0 or 1.

The goal is to distinguish between two kinds of inputs:

0 (no extraterrestrial life): Each character is zero or one independently at random, and is one with probability exactly 15%.

1 (extraterrestrial life): First, each character is zero or one independently at random, and is one with probability exactly 28%. Then, 10 rounds of the original Conway's Game of Life are played from this configuration. The 225 characters are viewed as a 15 by 15 grid, and when we apply the rules, we treat the grid as wrapping around so that it has no borders. That is, column 1 wraps around and is adjacent to column 15, and row 1 also wraps around and is adjacent to row 15. The symbol '0' is associated with 'dead' and the symbol '1' is associated with alive. After the 10 rounds the string corresponding to the state of the game is the input.

Your program does not need to give any particular output for any particular input, however it should succeed on average in the following sense. If we flip a fair coin (either 0 or 1), and choose an input from the corresponding distribution, your program should output the correct answer with probability at least 90%.

Otherwise this is code golf as usual. Enjoy!

I/O:

Your answer shall output a single bit either zero or one. You shall do this either by printing the character 0 or 1 to standard out, or by returning an integer value 0 or 1 from a designated "main" function.

• This question is going to need a fair number of test cases, soo that people can tell if their program works. Maybe a test case generator? – isaacg Aug 19 '15 at 14:01
• I guess I assumed people would just write their own test case generator in their language of choice. I wrote one here in C++, that's what I used to pick the parameters hastebin.com/uguhapepat.avrasm – Chris Beck Aug 19 '15 at 14:04
• added a license statement hastebin.com/sevimunolu.avrasm – Chris Beck Aug 19 '15 at 14:14
• 8 rounds or 10 rounds? – Peter Taylor Aug 19 '15 at 16:19
• Humm you know i'm open to suggestions, but I originally had 8 and then I made the board smaller and increased it to 10, I guess I left an 8 in there though. i'm going to edit to make it 10 everywhere – Chris Beck Aug 19 '15 at 16:20
• So my goals for setting the parameters were like: (1) I thought there should still be some significant amount of noise in the life game, it shouldn't have enough time to entirely settle down into squares and flippers (2) I want you to have to do something more complex than "just count the number of 1's". If the same percentage is used for the random ones in both the "yes" and "no" instances, it leads to a large gap in density of ones because life tends to kill off many of the 1s after you start from random. so i made the board small and tuned the %s so that counting ones gives little info. – Chris Beck Aug 19 '15 at 16:27

# Infinite monkeys and a broken keyboard

The infinite monkey theorem describes the probability of getting the desired result by just doing random stuff.

The task of this challenge is to calculate the minimum number of monkeys you need to get a given text on a broken keyboard. The situation is easy:

• You have a keyboard (QWERTY-layout) that has lost some of its keys
• Possible keys are: 1234567890abcdefghijklmnopqrstuvwxyz -=\[];',./
• Only one button is pressed at a time and the other keys (enter, tab, numeric keypad, ...) will not be pressed/ are already lost
• You have many many many monkeys which want to type on the keyboard!

## Input

The input is a string which can only contain the possible chars. You may assume that only the characters that are in the given string aren't lost.

You have to calculate how many monkeys are at least necessary to get the given input with a probability of over 50%. Afterwards just output that number.

## Examples

input: aaaa
1 key available -> P=100% to hit the right key
output: 1

input: abcd
4 keys available -> P=25% to hit the right key
Probability to get the desired string:
P = 25%^4 = 0.00390625
Number n of monkeys needed:
(1-0.00390625)^n < 50%
n = 178 (P=50.176%)
output: 178


Please tell me if you have ideas how to improve or clarify the question or how to optimize it.

• Similar, but I think this is a better question than mine – Beta Decay Aug 20 '15 at 17:58

# The robber and the bank (Bank managers)

## (Based off 'Two makes all the difference')

A group of robbers has decided to break into a bank, but one of the members leaked the information to the bank. To stop the robbers from getting any money, they have decided to change the combination on each vault to something more complicated.

As you are a bank manager, you must figure out a new combination of rotations for the wheel lock system of the vaults. The vaults take 7 turns each, represented in degrees. You must write a program that takes 10 integers (separated in any way you like) and outputs the processed integers which have been made from the originals. This is important, as you cannot use a randomizing function to make the new combination.

### Sample input:

(Note: The numbers will all be multiples of 5. The output should also be this way.)

10, 50, -230, 110, 20, -5, 50, 80, 30, -50

### Sample output:

30, 110, -110, 230, 50, 115, 110, 170, 70, 70

This result is obtained by the simple (Python 3) algorithm (deliberately non-golfed)

inputlist = input('list')
for i in len(inputlist):
if inputlist(i) > 0:
inputlist(i) *= 2
inputlist(i) += 10
else:
inputlist(i) += 120


(Note the abscence of a condition for 0 degrees, as a wheel lock would not take such a value. Also note the fact that the algorithm is a full program, not just a function that would do the same.)

## Winning conditions

The shortest uncracked algorithm wins. In case there are two algorithms that have the same length and are uncracked, the one with more votes will win.

# The robber and the bank (Robbers)

Your group of robbers are breaking into a bank! However, one of your members seems to have leaked the information to the bank managers. Your team manages to hack the bank's system to retrieve the original password and part of the algorithm, but your connection was cut.

You will receive 10 integers and a snippet of code (need help deciding how much) from the algorithm used to change the lock's combination. You will need to deduce what the algorithm is and finally the new combination.

### Sample information:

10, 50, -230, 110, 20, -5, 50, 80, 30, -50
Part of code

30, 110, -110, 230, 50, 115, 110, 170, 70, 70
Code (optional)

## Winning conditions

The robber with the most vaults (algorithms/combinations) cracked wins. In the case that there are two robbers with the same number of cracked vaults, the robber with more votes will win.

(Any way to separate who wants to be a robber and who wants to be a manager? Perhaps a separate system for answering?)

• 1. It's quite confusing the way you keep talking about algorithms when you mean programs. 2. It's not at all clear what exactly the bank managers post. 3. It's not at all clear that the robbers can do anything except guess. – Peter Taylor Aug 24 '15 at 17:04

## Buffalo buffalo buffallo buffalo buffallo buffallo buffallo parse buffalo buffalo buffallo buffalo buffallo buffallo buffallo

Write a program that can take a integer input N > 0 and then describes the syntax of a phrase in the style of "Buffalo buffalo Buffalo buffalo buffalo buffalo Buffalo buffalo" with N repetitions.

The wikipedia page has the parse tree and accepted syntax for phrases up to N = 8.

The sentence is unpunctuated and uses three different readings of the word "buffalo". In order of their first use, these are:

• a. the city of Buffalo, New York, United States, which is used as a noun adjunct in the sentence and is followed by the animal;
• n. the noun buffalo, an animal, in the plural (equivalent to "buffaloes" or "buffalos"), in order to avoid articles;
• v. the verb "buffalo" meaning to outwit, confuse, deceive, or intimidate.

So for the first eight the output should be:

1. Bully (meaning the imperative "[you] Buffalo!" - command someone to bully).
2. NY bison (meaning a bison that hails from the town of Buffalo).
3. NY bison bully (a bison from NY bullies).
4. NY bison bully bison (NY Bison bully a bison)
5. NY bison bully NY bison (NY bison bully NY bison)
6. Buffalo buffalo buffallo buffalo buffallo buffallo (NY bison bully (TBC)
7. Buffalo buffalo buffallo buffalo buffallo buffallo
8. Buffalo buffalo buffallo buffalo buffallo buffallo buffallo

In the comments section, wikipedian Robin Johnson has it for 9 through 12 (NY stands for Buffalo, NY):

1. (NY bison [which] bison bully) bully (bison [which] NY bison bully)
2. (Bison) bully (NY bison [which] NY bison (NY bison bully) bully)
3. (NY Bison) bully (NY bison [which] NY bison ([which] NY bison bully) bully)
4. (bison [which] bison ([which] NY bison bully) bully) bully (NY bison [which] NY bison bully)

He added parenthesis for more phrase visibility, but that is not needed.

Your program should take the input and explain the gramatically correct phrase doing the following substitutions:

• NY for the Buffalo, NY city.
• Bison for the animal Buffalo.
• Bully for the verb.

[code-golf] [kolmogorov-complexity]

• Are we allowed to use NLTK? – Beta Decay Aug 27 '15 at 10:55
• The name is a little obnoxious to be honest. I would recommend removing at least a few "buffalos" from either side of "parse." – Alex A. Sep 4 '15 at 17:42
• @AlexA. that is a good suggestion, and I think the title as is is gramatically wrong too. – Mindwin Sep 4 '15 at 23:48

# Get home by ONLY turning right

You're finally trying to get a drivers license. About halfway during the lesson, the instructor decides that you've sufficiently mastered telling the gas- and brake pedal apart. It's time to practice the next thing: turning right.

## The challenge

Your program is provided an ASCII roadmap, with your starting position, direction and home marked. You should drive home in the minimum distance required.

Your program must output route instructions for reaching your destination. The following instructions must be printed by your program whenever appropriate.

### Input

Items on the map will look like this. There are only horizontal and vertical roads. (I'm open for suggestions on this one.)

• = – A horizontal road
• | – A vertical road
• # – A crossroad
• > / < / ^ / v – A one-way street
• H – Your home
• N / E / S / W – Your starting point and direction (North, East etc. The map is oriented north-up.)

A road segment (a signle character) is connected to another segment when:

1. It ends at an adjacent segment that has the same alignment. E.g.: == or
||
2. It ends at a segment with a different alignment (horizontal vs vertical). E.g.: =|, |=,
=|
or
|=
3. It ends at a crossroad. E.g.:
 |=#= |
4. It ends at a roundabout. E.g.:
 |=O |

It is not connected in (for example) these instances:

• | |
• ||
• | =

Moving one position up, down, left and right all count as traveling the same distance.

### Output

• Turn right
• Go straight on
• Take the {1st/2nd/3rd} exit (at a roundabout)

You take roundabouts clockwise. Because of this, taking any exit amounts to turning right.

## Rules

• Each instruction must be on its own line.
• No other output is permitted.
• Your program may take no longer than a minute to run on an average home user’s computer.

Standard loopholes are forbidden, unless specified otherwise.

This is code golf. The shortest answer wins.

This is an early draft. Input is welcome, especially on the feasibility of requiring the shortest possible route, if this should be code golf, how input should be generated (randomly but the same for all programs? A few predefined maps?) and any improvements for the challenge. Any constructive feedback is welcome, even if it's just about spelling and grammar errors.

• Very related challenge – Sp3000 Aug 27 '15 at 11:50
• @Sp3000 Not a duplicate though. – user2428118 Aug 27 '15 at 15:24
• How are the roundabout exits numbered? – ASCIIThenANSI Aug 27 '15 at 17:51
• @ASCIIThenANSI I've updated the text to say you take roundabouts clockwise. I hope it's sufficiently clear now. – user2428118 Aug 27 '15 at 18:33

# Arranging Matrices

(doesn't actually require any matrix math)

While doing homework on matrix multiplication, I realized that I could avoid rewriting all of the matrices by arranging them intelligently on the page. If the problems were:

A * B = C
A * D = E
F * D = G


I could arrange the matrices like so:

 BD
ACE
FG


This arrangement satisfies the requirement that each product (C E G) have the correct factors in the correct directions. For example, the A * D = E so E is to the right of A and below D.

The challenge is, given a list of multiplication problems (in the same format as above), output an arrangement of them that involves the fewest letters (the above solution has 7, the minimum).

• Needs a test case for an input which has conflicts. The easiest one would probably be A * B = C B * A = D. – Peter Taylor Sep 1 '15 at 10:31
• You might want to first explain how for a single matrix multiplication you usually arrange the matrices to do the computation. I don't think everyone is familiar with the technique this challenge is based on. – Martin Ender Sep 1 '15 at 11:09

Hello everyone! I've been lurking around for a couple of weeks now and I think this site is super interesting!

I've decided that I definitely want to contribute to this site as well and have composed a new challenge over the last few days, that I hope you'll find interesting too!
I've tried to do all the reading beforehand and hope that I've got everything right and that this kind of thing hasn't been done before.
Please let me know if you think something needs to be changed!

Anyways, here is my proposed challenge:

# Programs With Taste popularity-contest

[probably will add some "flavor text" here]

Write a program that takes an arbitrary group of pictures and ranks them after this program's "preference."

What that means is, you should come up with an algorithm that favors some attributes in pictures over others by comparing them in a specific way.

This is a popularity-contest, so what I want to see is interesting and creative methods of "pseudo-subjectively" ranking images.

As an example, one program could favor an overall more colorful image over a mostly gray one, or another could have a "favorite" color and ranks pictures which have it more, higher than others. You could even come up with an elaborate scoring system that combines a couple of criteria.

### Details:

As input your program should accept any amount of images, which can be of any size.
It doesn't matter if your program requires them to be in a specific file format.

The output should be a ranked list from "favorite" image to "least favorite", with items that unmistakably represent each of the pictures (e.g. a list of file names or a list of the images itself).
If you want, you can also include the actual numbers (or score) that are compared in the output.

The program should definitely be deterministic, so that the same group of pictures will always result in the same order.

If you're entering, please also provide a short description of what your algorithm prefers in a picture and how it's calculated.

As a bonus task I think it would also be really interesting to see what "the perfect picture" for your algorithm would be, meaning that this image would theoretically always be ranked the highest by your program.

### Example images:

Here are some groups of images you can use as examples:

[I'll create and/or find some images to put here]

Good luck!

• Whats stopping me from writing my program so that it prefers pictures with a filename closer to 0 in the ascii table (sorting)? – Blue Sep 3 '15 at 16:46
• @muddyfish Nothing, really. I wouldn't expect it to do well in a popularity contest, though. It's not a golf, so the length of the program isn't really a concern. – Geobits Sep 3 '15 at 16:50
• This is definitely "Too Broad". – Peter Taylor Sep 4 '15 at 13:54
• @PeterTaylor Could you please elaborate? I don't really know much what you classify as broad on this site, but personally, I don't think it is, or at least not "definitely." I gave a specific and clear goal - to sort a set of images - while leaving enough freedom in the actual implementation to allow some creative submissions for an interesting popularity-contest. What do you think needs to be narrowed down? – Xrott Sep 4 '15 at 23:21
• In essence your challenge is "Write any function you want from int[] to double". That isn't specific. I'm not sure that it can be narrowed down sufficiently without becoming a completely different question (e.g. a classifier which distinguishes representational vs abstract art with a reasonable degree of accuracy - and classification questions have their own problems). – Peter Taylor Sep 5 '15 at 8:12

# Alternating Hamiltonian Chess Boards

## Overview

Find a Hamiltonian cycle on a chess board that alternates between black and white squares. The catch is that the board does not have the colours arranged in the conventional way.

## Detail

Consider a chess board, with each square having 4 neighbours (up, down, left, right), apart from the edge and corner squares which only have 3 or 2 neighbours respectively. A Hamiltonian cycle is a closed path (loop) that visits every square exactly once, moving from neighbour to neighbour (never diagonally).

On a chess board, it is easy to find a Hamiltonian cycle that alternates between black and white squares (in fact, any cycle will alternate between black and white squares). What if the black and white squares were not arranged so conveniently? Clearly there are arrangements for which there is no possible alternating Hamiltonian cycle, for example putting all the white squares in one half of the board.

The task of your code is to find any valid cycle, or indicate if there are none.

## Input & output

### Input

An 8 by 8 board of black and white squares.

This is in the form of a string of 64 characters each of which is either "0" or "1", terminated by a newline. This indicates the colours of the squares in English reading order.

### Output

Any valid cycle if one exists, or a zero as an indication that no valid cycle exists.

A cycle is represented by a comma separated list of integers from 0 to 63 inclusive, indicating the order in which the squares are visited. Again the labelling is in English reading order.

Whether a list of a zero, the output is terminated with a newline.

## Square numbering

The squares are labelled in English reading order (left to right then top to bottom). So for example, a 3 by 3 board would be labelled as follows:

0 1 2
3 4 5
6 7 8


# Sandbox questions

• My first thought was , but I'm now preferring . There are a number of quick checks that can eliminate the possibility of there being a valid cycle, which will be competitive in fastest code. I'd rather see these than golfed brute force approaches.
• I've chosen 8 by 8 simply because it's a familiar size due to chess. Would this be better with a different size board? For fastest code I'd want the time taken to be over a minute for at least some inputs, so that there is enough time to judge the difference between answers. Ideally for fastest code I'd choose inputs that take quite a bit longer than that to allow for solutions which are far more efficient than I expect.
• How restrictive should I be with the input and output formats? For fastest code if the body of the problem takes a reasonably long time then input and output conversion should be negligible so I could insist on a single format for ease of measuring answers.
• Is there any advantage to having a fixed board size, or would it be more interesting with the board size as an initial input N, followed by the board?
• i think "fastest code" is most interesting b/c with code golf its just going to boil down to who can write the shortest exhaustive guess & check program. for fastest code I guess probably that there is some efficient algorithm for hamilton cycles on bipartite graphs? but i'm not actually sure, probably there would be alot of tricks to solve this quickly, and maybe exploit planarity somehow. – Chris Beck Aug 22 '15 at 17:55
• @ChrisBeck the more I think about it the more I'm leaning towards fastest code too. In which case I'll include unsolvable boards in the input cases too. That will really separate the brute force solutions from those that have clever ways to fail fast. – trichoplax Aug 22 '15 at 18:05
• @ChrisBeck and trichoplax - I'm intrigued but skeptical. Checking for Hamiltonian cycles is NP-Complete. If we think of the input as a graph with vertices representing the white squares and edges representing the black squares, this easily translates into many algorithms that ask about Hamiltonian paths. Presuming an even split between white and black squares, this results in a maximum of 32! different possible paths to brute force check, or, in the best Monte Carlo simulations, O(1.657^32). That's still 17+ minutes if your algorithm can check 10,000 possible paths per second. – AdmBorkBork Aug 27 '15 at 15:39
• It might not be NP-complete when restricted to graphs like this though. I'm not sure, my hunch is no, maybe you see a reduction though? Regardless I'm quite sure that it will be at most like, exponential in the number of rows here, not like exponential in the number of grid squares. (Because, it can be translated to a SAT instance of bounded tree-width and there are known algorithms for those.) Making the graph bipartite is often a pretty severe restriction that dramatically reduces the complexity as well. – Chris Beck Aug 27 '15 at 15:47
• @ChrisBeck Hence why I said I'm intrigued but skeptical. I haven't gone through anything rigorous - the "white squares as nodes and black squares as edges" was just something immediate that sprang to mind. It's certainly possible that there are enough restrictions on the input that can dramatically reduce complexity -- at the least, think of my ruminations as quantifying a maxima. – AdmBorkBork Aug 27 '15 at 15:55
• @TimmyD If 17 minutes is the worst case brute force then I'll probably increase the size of the board. There are several methods of spotting certain classes of unsolvable boards almost instantly so I'm hoping for solutions that exit very early where possible, and are also optimised with a good heuristic for spotting the solutions that do exist. – trichoplax Aug 27 '15 at 18:46
• I definitely want to give this plenty of thought before settling on a board size (or maximum test size if I settle on having board size as an input). – trichoplax Aug 27 '15 at 18:54
• @TimmyD I'm interested in your O(1.657^32). Does that assume anything about the number of neighbours per square? – trichoplax Aug 27 '15 at 18:55
• @TimmyD I'm fairly sure this case is simpler than the 32! you describe, as each black square has a maximum of 4 white squares to choose from, and some have less otherwise finding a cycle becomes trivial. – trichoplax Aug 27 '15 at 19:01
• Brute-force checking an n-node graph for a Hamiltonian cycle is O(n!) - that's just straight math, regardless of any bounds on edge connectivity. Way too big to try. "Simple" algorithms exist to check in O(2^n) time, and have been known for years. I've not read the paper showing O(1.657^n) time, so I can't comment specifically, but I would imagine that the author tackles the general case, since they explicitly call out bipartite graphs as being solvable in O(1.414^n) ... I think that's the current best-case. My "17-minute" remark was for the O(1.657^n) time. – AdmBorkBork Aug 27 '15 at 19:28
• That all said, I do believe that there are ways to shrink that O(1.657^32) time, given the constraints present (i.e., each vertex will have a maximum of 4 edges). I'd have to spend some more time thinking about this than I have to determine for sure. Additionally, all this is assuming that my mapping of "white squares as vertices, black squares as edges" is optimal, which I'm much too humble to think is the case, so there could be different ways of optimizing that, too. – AdmBorkBork Aug 27 '15 at 19:40
• Related, in a general sense. Might be worthwhile to watch what happens with that one, just to see reaction and responses. – AdmBorkBork Aug 28 '15 at 20:49
• @TimmyD Thanks - it will be interesting to see if the answers there turn out to be convertible to answers here. – trichoplax Aug 29 '15 at 16:03
• I know that this is ancient history now, but I'm fairly positive you can't construct a Hamiltonian path if the squares aren't checkered. Simple proof: Assuming a standard checkerboard, and that you start on black, there's no way to get to another black without taking 2N steps, and white without taking 2N-1 steps. If you swap a black with a white, then you will never be able to step on the black square on a 2N step. – Nathan Merrill Mar 21 '16 at 2:29
• @NathanMerrill thanks for the proof. It does seem that this challenge will only be possible if I allow diagonal steps in the path too. I should have started by making some test cases. I have some more thinking to do... – trichoplax Mar 23 '16 at 14:42

# Oh dear, bad CSS! or How to Properly Format CSS™

Please give me any improvements/suggestions you may think of.

The goal is to write a short function to Properly Format CSS™; you must Properly Convert Spaces To Tabs™ and format the CSS nicely.

div> *
{
margin: 1em;
border: 2px solid yellow;margin: 1rem;


## Proper CSS™

div > * {
--->border: 2px solid yellow;
--->margin: 1em;
--->margin: 1rem;
}


A tab is represented by --->, as you can't embed tabs properly on StackExchange.

All the properties are sorted alphabetically, and nicely formatted (please also note that the order of the properties can be important, such as in the case of margin: 1em; ... margin: 1rem;. The selector is also nicely formatted.

## Format

• Format the selector with spaces around every token
• A space; a left curly brace ({); a newline
• One tab; optional spaces (see below); the property name; a colon; a space; the tokens, separated by single spaces how do I define token? (replace 0{unit} with 0); a semi-colon; a new line
• A newline; a right curly brace (})

## Property sorting

Sort the properties alphabetically, ignoring prefixes. Then list each prefix for the property specified in the original CSS, starting with the longest, down to the shortest (i.e., none), adding spaces before the property name to pad the shorter prefixes to the longest prefix.

The same property may appear more than once; keep each variant in the original order, as in the example.

## Rules

1. You may not use any built-in CSS parsers and/or formatters.
2. Standard loopholes are disallowed.

## Bonuses

1. -100 bonus if the function can also format psuedo-classes and elements properly (e.g. p >a::before to p > a::before and p>a:visited to p > a:visited).
2. -50 bonus if you change :after and :before to the new, two-colon syntax (::after and ::before).

The task is to provide a function to format (correct) some CSS (provided as a parameter) as specified above, not a fully-featured CSS parser – but you get a -1000 bonus if the code is a fully-featured, forwards-compatible CSS3 parser! :)

Input: function parameter or STDIN.
Output: function return value or STDOUT.
No output to STDERR.

## With Rhyme and Reason

A budding poet (you) knows not his rhymes

Lines of code he can write deftly and quick

And those of prose he can write mostly fine

But the poems he creates make him sick

Through study of verse throughout all forms known

Our dear programmer shall learn the right way

But alas, all of his lyrical tomes

Would have him reading until he was gray

At once a brilliant epiphany struck

Thought he, "A program is just what I need!

It will look for me and rake through the muck

Songs and poems of all kinds it shall read

And give to me solely their rhyming scheme

With which I can write that of which I dream"

Given an input, you are to output its rhyme scheme.

## Rules

1. You are to only compare the last words in each line when looking for rhymes. These will be referred to as "rhyme words."
2. For each stanza (lines separated by single line breaks -- think something like a paragraph), you are to assign the first rhyme word the letter "A." If the next one rhymes with any other preceding rhyme word, it shall be assigned the letter of said word (in this case, "A"), and if not, the next letter in the alphabet (in this case, "B"). Once you reach two or more line breaks in a row, you treat whatever follows as separate stanza.
3. You can code it in so that when you get past the letter "Z," your program wraps around and assigns rhyme words again to "A," but you should not expect that there will be that many rhymes in the stanzas provided. If your program errors instead, that is admissible.
4. Sight rhymes do not count (you must find some sort of way to compare the words phonetically)
5. Standard loopholes apply

## Input

The input will be in the form of a file, unless your language cannot read files, in which case it will be through STDIN. It will consist of at least one stanza of written text.

## Output

Your output will be either written to a file or the console (whichever is easier to read). Your output will consist of letters corresponding to the rhyme scheme as discussed in rule 2; you choose how they are formatted, but please format them in a readable fashion (especially for large inputs).

## Scoring

Your score will be the amount of rhymes correctly identified over the total as a percentage. For example, if your program returns ABCA DDEE when the actual was ABBA CCDD, your score would be 3/4, or 75%, because it got AA, CC, and DD, but not BB.

I do not expect scores near 100%, due to the difficulty of this challenge, so if your score is low, don't worry about it.

Here is a link to my implementation of a scorer in Python.

## Test Cases

Input: (Sonnets from the Portuguese #43)

How do I love thee? Let me count the ways.
I love thee to the depth and breadth and height
My soul can reach, when feeling out of sight
For the ends of Being and ideal Grace.
I love thee to the level of everyday's
Most quiet need, by sun and candle-light.
I love thee freely, as men strive for Right;
I love thee purely, as they turn from Praise.
I love thee with a passion put to use
In my old griefs, and with my childhood's faith.
I love thee with a love I seemed to lose
With my lost saints, --- I love thee with the breath,
Smiles, tears, of all my life! --- and, if God choose,
I shall but love thee better after death.


Output:

ABBA ABBA CDC DCD


Input:

A budding poet (you) knows not his rhymes
Lines of code he can write deftly and quick
And those of prose he can write mostly fine
But the poems he creates make him sick
Through study of verse throughout all forms known
Our dear programmer shall learn the right way
But alas, all of his lyrical tomes
Would have him reading until he was gray

At once a brilliant epiphany struck
Thought he, "A program is just what I need!
It will look for me and rake through the muck
Songs and poems of all kinds it shall read
And give to me solely their rhyming scheme
With which I can write that of which I dream"


Output:

ABAB CDCD
ABAB CC


Input:

cow
cow
cow
cow
cow
cow
cow
cow
cow
cow
cow
cow
cow
cow
cow
cow
cow
cow
cow
cow
cow
cow
cow
cow
cow
cow
cow


Output:

Error.


or

ABCDEFGHIJKLMNOPQRSTUVWXYZA


## What I'm looking for help with

1. How can I figure out a way of easily scoring answers (this seems to be a programming puzzle in and of itself)? Maybe check to see if the characters used match I've made a scorer in Python, but I'm not 100% sure yet that it is completely accurate.
2. Is this challenge too difficult; should I restrict it to only a certain few test cases?
3. Regarding test cases, I plan on making a large one for purposes of scoring - how many lines of rhymes would be good?
4. Would this maybe do better as a partially code golf challenge (factor in length with scoring) with the goal being to be able to give the scheme as accurately as possible for only a few test cases (although I believe that would make this come close to being a duplicate)?
5. Anything else at all that you notice
• IMO "you must find some sort of way to compare the words phonetically" is too broad. You should provide a clear specification of how words should be compared. I suggest requiring the use of CMUDICT (and allowing it to be preprocessed to remove comments and then read from a file named d), and specifying that words rhyme iff their phonetics as given in CMUDICT agree perfectly from the most stressed vowel to the end. And have test cases which cover words with more than one pronunciation in CMUDICT. – Peter Taylor Sep 21 '15 at 9:36
• @PeterTaylor I think you're right, I'll look into CMUDICT, but judging from your comment it ought to be fine. If I allow it, I think I will then factor in length in the score. Thanks for the reply! – cole Sep 21 '15 at 15:05