556
\$\begingroup\$

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

Sandbox FAQ

Posting

To post to the sandbox, scroll to the bottom of this page and click "Answer This Question". Click "OK" when it asks if you really want to add another answer.

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

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

Discussion

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

  • Parts of the challenge you found unclear
  • Comments addressing specific points mentioned in the proposal
  • Problems that could make the challenge uninteresting or unfit for the site

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

If you think one of your posts requires more feedback, but it's been ignored, you can ask for feedback in The Nineteenth Byte. It's not only allowed, but highly recommended! Be patient and try not to nag people though, you might have to ask multiple times.

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

Other

Search the sandbox / Browse your pending proposals

The sandbox works best if you sort posts by active.

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

Get the Sandbox Viewer to view the sandbox more easily!

\$\endgroup\$
0

4041 Answers 4041

1
120 121
122
123 124
135
0
\$\begingroup\$
--\/--
--/\--

Morse Tangles: ASCII Art

Given a word (with only letters, case insensitive), say SOS:

  • Change the word into Morse code, in this case, ... --- ...

  • Change dots to parallel bars and dashes to tangles.

Output the result as ASCII art:

------  \/\/\/  ------
------  /\/\/\  ------

Note that the spaces are two characters wide. This is .

Morse Code Chart:

https://cdn.shopify.com/s/files/1/2223/4507/files/morse-chart_grande.png?v=1501447409

\$\endgroup\$
3
  • \$\begingroup\$ Please, add a morse code table to the post for reference and provide some more test-cases. Please consider changing overline ¯ to a dash - as it's outside of ASCII range and that may exclude some languages from participating. I also suggest changing underscores to - for more golfing opportunities and removing the spaces between characters in the final tangle. \$\endgroup\$
    – pajonk
    May 30 at 10:21
  • \$\begingroup\$ Done @pajonk .. \$\endgroup\$ May 31 at 0:27
  • \$\begingroup\$ IMHO the Morse code table is short enough to be posted verbatim in the question (e.g. as a code block for easy copying) to make the question self-contained. Also, again, please add some more test-cases. \$\endgroup\$
    – pajonk
    May 31 at 4:20
0
\$\begingroup\$

Extracting nth character of FizzBuzz

I was inspired by the challenge to output FizzBuzz as fast as possible. I have written and optimized some code to the degree that it computed the 10^1000000th character of FizzBuzz within 5 minutes (it's "7"). (Not the 10^1000000th line, this is the 10^1000000th character, and I don't mean 1000000, I really mean 10^1000000). See here. I'm not sure how the challenge would work, perhaps it could be "how fast can you extract the nth digit of FizzBuzz, where n is a random number with a million digits"? Or perhaps a simple king of the hill for "what's the furthest power of ten index you can compute"? I wonder if someone can up that to 10^10000000?

\$\endgroup\$
2
  • \$\begingroup\$ codegolf.stackexchange.com/questions/219009/… \$\endgroup\$
    – emanresu A
    Jun 3 at 5:27
  • \$\begingroup\$ Thanks! But, that is just for the shortest code, rather than the most performant, or the highest character index computed. I commented my approach anyway though! \$\endgroup\$
    – lurf jurv
    Jun 3 at 6:12
0
\$\begingroup\$

Rational numbers


Challenge

Every rational numbers (can be written in a fraction form \$a / b\$ ( \$a\$,\$b\$ are integers)) can be represent as a periodic, repeating decimal number.

For example, \$1 / 3\$ is \$0.3333333333333333...\$, so we represent it as \$0.(3)\$. Another example, \$3227 / 555\$ is \$5.8144144144...\$ so we represent it as \$5.8(144)\$.

Your task is, given a fraction \$a / b\$, print out its periodic, repeating decimal number,

Input/Output

  • Input/Output can be taken in any resonable format, containing the fraction.

Testcase:

5/2 -> 2.5(0)
1/3 -> 0.(3)
3227/555 -> 5.8(144)
557/495 -> 1.1(25)
35/17 -> 2.(0588235294117647)

This is , so so shortest answer (in bytes) wins!

\$\endgroup\$
1
0
\$\begingroup\$

Parenthetical names

Your challenge is to build a program that puts parentheses around the 'title' part of names. For example, Sonic the Hedgehog is converted to Sonic (the Hedgehog).

Rules:

  • Inputs will only contain words (alphabetical characters and spaces).
  • Your program must be case insensitive.
  • Leading and trailing thes are ignored.
  • With two thes in a row, only the first is parenthesized.
  • Nested thes mean nested parentheses.
  • Remaining thes are skipped unless surrounded by spaces. For example, the the in their would not be parenthesized.

Test cases:

'the pig'               => 'the pig'
'pig the'               => 'pig the'
'pig hog'               => 'pig hog'
'pig the hog'           => 'pig (the hog)'
'the the pig'           => 'the the pig'
'pig the hog pig        => 'pig (the hog pig)'
'the pig the hog the'   => 'the pig (the hog the)'
'pig the hog the pig'   => 'pig (the hog (the pig))'
'the hog the pig'       => 'the hog (the pig)'
'pig the the hog'       => 'pig (the the hog)'
'hog their pig the hog' => 'hog their pig (the hog)'

Inspired by this xkcd comic: https://xkcd.com/2252/

This is code-golf, so least number of bytes wins.

\$\endgroup\$
0
\$\begingroup\$

Infinite Prisoner's Infilemma

Introduction

In this challenge, you are going to write a program that will play the game of the Infinite Prisoner's Infilemma.

This game is based on the classic game of the name Infinite Prisoner's Dilemma .

The original inspiration for this game came from this game by Nicky Case.

By default we will include the sample bots from Nicky Case's game. You can also add your own bots.

How to Play

Given a list of bot models [1,2,3,4,5]:

  • First, multiply the list by 10 to get 10 bots of each model.
  • Then, battle every two bots together.

During a battle there will be 10 rounds. Each round:

  • Both players will enter x dollars into a machine, where x is non-negative (not neccessarily an integer) and less than or equal to the amount of money they have. They start with $100.
  • The other player will recieve 1.1 times the amount of money.

Default Bots

Default bots are:

  • Copycat, which starts by cooperating with 1/3 of his money, and then cooperates with the same ammount of money as the ammount of money you cooperated last turn. (Unless he doesn't have enough money, which he will use all of them).

  • AlwaysCheat, which, always cheats by giving no money. DUH!

  • AlwaysCooperate, which, always cooperates by giving 1/2 of his money.

  • Grudger, which starts by cooperating with 1/3 of his money but gives no more money if you have ever cheated and give less than $10.

  • Detective, which cooperates $20, $5, $10, but if the opponent always gave at least $50, will act like an AlwaysCheat, else will act like a Copycat.

  • Copykitten, which is similar to Copycat, but cooperates with the same ammount of money as the max of the opponent's last two turns.

  • Simpleton, which starts by cooperating 1/2 of his money, then at every turn, if the opponent gave less than $20, switch a state between 1/2 of his money and none.

  • Random, which give, randomly, 2/3 to none of his money.

Instructions

Your bot should be a class. It will inherit from this Bot class:

class Bot:
    def __init__(self):
        self.money = 100
        self.information = {}

    def log(self, bot, money):
        if bot not in self.information:
            self.information[bot] = [money]
        else:
            self.information[bot] += [money]

    def change_money(self, money):
        self.money += money

    def choice(self, bot):
        pass # override in subclass

    def name(self):
        pass # should return the name of the bot

    def get_choice(self, bot):
        choice = self.choice(bot)
        assert 0 <= choice <= self.money, \
            f"Invalid choice {choice}, bot money {self.money}" # check if choice is valid
        return choice

You may not use any other libraries other than math and random. (If you have any requests, let me know. I mainly want to ban the use of inspect, sys, and os.)

You may also not override any methods other than choice and name.

You may not set self.money. (Else, you can come up with self.money = 10000, etc.)

The following is a sample bot:

from main import Bot # <-- import the Bot class
from random import random as r # <-- import the random function

class TestBot(Bot): # <-- create a class called TestBot
                    # <-- that inherits from Bot
    def choice(self, bot): # <-- override the choice method
        return self.money*r()/10 # random number between 0 and
                                 # 10% of the bot's money
    def name(self): # <-- override the name method
        return "randombot" # <-- return the name of the bot

bot = TestBot # <-- IMPORTANT: create a variable called bot

The Information Log

Well, sometimes you want to know what the opponent did. Thus, sometimes you need the "information log", called via self.information. Remember the bot argument that is passed in the choice method? That is your opponent. To get the information log of your opponent, use the following:

self.information[bot] # <-- get the information log of the opponent

What does that information look like? Well, it's like [[Y1,O1],[Y2,O2],...]. Y1 is what you gave the opponent in round 1. The rest is fairly easy to infer.

Controller Script

# This is the controller script for the Infinite Prisoner's Infilemma King of the Hill game.

bots = ['testbot','randombot'] # Will change.

# to make it fold-able.
if True:

    from rich.console import Console
    from rich.table import Table
    console = Console()
    with open('log.txt','w') as f: pass

    def print(*args, **kwargs): console.print(*args, **kwargs)

    def log(*text):
        with open('log.txt','a') as f:
            f.write(' '.join(list(map(str,text)))+'\n')

    def play(Bot1, Bot2):
        log(Bot1.name(), 'vs', Bot2.name())
        b1_choice, b2_choice = Bot1.get_choice(Bot2), Bot2.get_choice(Bot1)
        Bot1.change_money(-b1_choice)
        Bot2.change_money(-b2_choice)
        log(b1_choice, b2_choice)
        Bot1.change_money(1.001*b2_choice)
        Bot2.change_money(1.001*b1_choice)
        log(Bot1.name(), 'has', Bot1.money, 'dollars')
        log(Bot2.name(), 'has', Bot2.money, 'dollars')
        Bot1.log(Bot2, b1_choice, b2_choice)
        Bot2.log(Bot1, b2_choice, b1_choice)
        log('\n\n')

    class Bot:
        def __init__(self):
            self.money = 100
            self.information = {}

        def log(self, bot, money):
            if bot not in self.information:
                self.information[bot] = [money]
            else:
                self.information[bot] += [money]

        def change_money(self, money):
            self.money += money

        def choice(self, bot):
            pass # override in subclass

        def name(self):
            pass # should return the name of the bot

        def get_choice(self, bot):
            choice = self.choice(bot)
            assert 0 <= choice <= self.money, \
                f"Invalid choice {choice}, bot money {self.money}" # check if choice is valid
            return choice

    def leaderboard(Bots):
        table = Table(show_header=True, header_style="bold #00ffff")
        table.add_column("Bot", style="bold #ffff00") # yellow
        table.add_column("Money", justify="right", style="#00ff00") # green
        for bot in sorted(Bots, key=lambda x:-x.money):
            table.add_row(bot.name()+'     ',
                          f"     ${str(round(bot.money,2)) if str(round(bot.money,2))[::-1][1] != '.' else str(round(bot.money,2))+'0'}")
        print(table)

    def main():
        print('\n\n\n')

        Bots = []
        for bot in bots:
            for i in range(10): Bots.append(__import__(bot).bot())

        for Bot1 in Bots:
            for Bot2 in Bots:
                if Bot1 is not Bot2:
                    for i in range(10): play(Bot1,Bot2)

        leaderboard(Bots)
        print('\n\n\n')

    if __name__ == '__main__':
        main()

\$\endgroup\$
0
\$\begingroup\$

Compute the cophenetic correlation coefficient

Meta question at the end.

Background

The cophenetic correlation coefficient is used in bioinformatic to measure how close the distances of a tree are to the distances of the original distance matrix.

It is defined as follows: \${\displaystyle c={\frac {\sum _{i < j}(D_{ij}-{\bar {D}})(T_{ij}-{\bar {T}})}{\sqrt {\sum _{i < j}(D_{ij}-{\bar {D}})^{2}\sum _{i<j}(T_{ij}-{\bar {T}})^{2}}}}}\$

More information:

Input:

  • D: CSV style-string to first matrix
  • T: CSV style-string to second matrix

The input have the following format:

Eg 1: D.dist

N31
B14A.0, 2.0
N20, 3.0, 4.1
N20S, 12.0, 23.9, 4.3
EES.0, 10.3, 19.0, 16.0, 17.0
S2.0, 201.1, 99.6, 233.0, 297.0, 281.00

Eg. 2: T.dist

N31
B14A.0, 1.7
N20, 3.9, 4.1
N20S, 32.0, 25.1, 4.3
EES.0, 12.3, 19.5, 16.1, 17.1
S2.0, 202.2, 105.6, 227.1, 281.1, 283.5

The first column is a for us uninteresting identifier, the values (floats) are separated by a ,.

Output:

The cophenetic correlation coefficient.

Example:

Using the two matrices from above: 0.9982682565

Meta

Is it okay to use a file path as input? Or should I reformulate this question to input two matrices directly?

\$\endgroup\$
0
\$\begingroup\$

Don't like the middles

There will be no winner on these question. Just for the fun of the challenge.

Your job will be to output every sequence of each 10 numbers, alternating between the evens and odds, but removing the middle number, which means all numbers terminating in 4 or 5 must not be generated.

Here it goes exemplified for the first elements:

0 2 6 8
1 3 7 9
10 12 16 18
11 13 17 19
...

It is not mandatory you need to pretty format or have a list of sub-lists as shown here. One list or a string where each element is clearly separated from the previous and the next ones is enough.

\$\endgroup\$
1
  • 4
    \$\begingroup\$ Objective scoring criteria don't make challenges less fun; they're what make a challenge a challenge. They're also mandatory :P \$\endgroup\$ Jun 13 at 20:34
0
\$\begingroup\$

Perform division for fuzzy numbers

Objective

Given two positive "fuzzy" numbers (as defined below), perform division between them.

Definition

Here, a fuzzy number consists of two integers: \$n\$ and \$r\$. It indicates that the number is from a measurement, and thus may carry an error. The measured number is \$n×2^r\$, and the maximum error is \$2^{r-1}\$.

In other words, the pair \$(n,r)\$ indicates that the exact number can be any of those from \$n×2^r - 2^{r-1}\$ and \$n×2^r + 2^{r-1}\$. As per the rounding convention, the boundaries are inclusive if \$n\$ is even, and exclusive if \$n\$ is odd.

In this challenge, only positive fuzzy numbers shall be considered. In other words, \$n\$ shall be positive.

Operation

Here, the operation in concern is division. Performing \$(n_1,r_1) ÷ (n_2,r_2)\$, the exact result of division is within the range from \$(n_1×2^{r_1} - 2^{r_1-1})/(n_2×2^{r_2} + 2^{r_2-1})\$ to \$(n_1×2^{r_1} + 2^{r_1-1})/(n_2×2^{r_2} - 2^{r_2-1})\$, where boundaries are inclusive if and only if both \$n_1\$ and \$n_2\$ are even.

The range indicated by result \$(n,r)\$ shall cover the range above as precisely as possible. That is, \$r\$ must be as small as possible. As a tiebreaker, the range must be as accurate as possible. That is, \$n\$ must be chosen so that \$n×2^r\$ would be as near as possible to: $$ ½((n_1×2^{r_1} - 2^{r_1-1})/(n_2×2^{r_2} + 2^{r_2-1}) + (n_1×2^{r_1} + 2^{r_1-1})/(n_2×2^{r_2} - 2^{r_2-1})) \\ =(4n_1n_2+1)/(4n_2^2-1)×2^{r_1-r_2} $$

For ranges with equal radii, those excluding boundaries shall be considered preciser than those including boundaries. This ensures uniqueness of the result.

Ungolfed solution

(WIP)

\$\endgroup\$
1
  • 1
    \$\begingroup\$ I think apart from unglofed solution (WIP, but I'm not a fan of posting reference implementations in a question) and some test-cases, there should be at least one or two thoroughly worked out examples. Also, please remember about specifying an objective scoring criterion and I/O requirements (if any). \$\endgroup\$
    – pajonk
    Jun 23 at 12:28
0
\$\begingroup\$

I X the source code, you Y the output!


There's a zillion challenges of the form "I [do a thing to] the source code, you [do a thing to] the output!", like I double the source, you double the output! and I reverse the source code, you negate the output!. In this challenge you'll generalize that, writing a program that, given two functions x and y, will print a program p which prints some output o, with the property that x(p) prints y(o).

Task:

Your program (or function) should take two inputs, x and y, which can either be functions/lambdas, strings containing code, or some similar representation of a function in your language. You can assume these functions are pure: they have no side effects and do not depend on anything aside from their input. Other reasonable assumptions may be made based on your language's requirements, such as the input to x being a string of a certain length.

Your program should then print or return a program p, once again either as a pure lambda function (so it can't rely on x and y in the scope above it), a string representation of a program, function, or snippet, or some similar representation, such as writing an executable to a file. When p is run, it should take no input, and produce a deterministic value o. When x(p) is run, a second program will be produced, which, when run without input, should produce y(o) deterministically.

You may assume the data type of y(o) is the same as o, and make any other reasonable assumptions for your language. You may use any consistent data type for o, as long as it can hold more than 128 or so values (ints, floats, or strings would be preferred).

Sandbox:

This would be a very difficult challenge, and I'm not entirely sure what it would involve to answer or if it would even be possible to do so. I'm going to have to make some additional rules I think. maybe the inverse of x would be another input, that sort of thing. Feel free to suggest any ideas for rules to make this more possible and/or interesting, including across languages.

\$\endgroup\$
4
  • 1
    \$\begingroup\$ what if x is, say, return ""? or something else disruptive like z=>return "exitprogram()"+z \$\endgroup\$ Jun 27 at 15:49
  • 1
    \$\begingroup\$ If x is an arbitrary function, this is impossible. Consider x being the identity function: p and x(p) are the same, so their outputs must be the same (since they must be pure and deterministic). For almost all y (in fact, all y except the identity function), this becomes impossible. You'd have to put some kind of very strong restriction on x for this to be doable, which I don't think can make it an interesting challenge. Either that, or allow solutions to be uncomputable (...cont'd) \$\endgroup\$
    – pxeger
    Jun 27 at 16:03
  • \$\begingroup\$ (...cont'd) (A "valid" but uncomputable solution could be of the form: generate every program p and compute x(p), and check that y(eval(p)) == eval(x(p))). Some more (less trivial) logic can be used to show that this is also impossible if y is an arbitrary function. \$\endgroup\$
    – pxeger
    Jun 27 at 16:03
  • 1
    \$\begingroup\$ @pxeger Yes, it's not possible with a number of xs and ys. I don't think restricting it so that it's possible makes it less interesting though. \$\endgroup\$ Jun 27 at 16:29
0
\$\begingroup\$

Interleavable programs (WIP)

Your task in this challenge is to create programs that can be interleaved. Submissions will be in the form of collections of programs. The score for each collection is 2 raised to the power of the number of programs in that collection, and your total score is the sums of the scores of all the submitted collections. Here are the rules for each collection:

  • There must be at least 2 programs in each collection
  • The programs in the collection must be ordered from 1 to \$n\$
  • The \$n\$th program must output the integers in the range \$(i-1)*n\$ to \$i*n\$. Output can be as a list or string with separators (the separator can be an empty string)
  • When your programs are interleaved, their output is also interleaved
  • Programs can be reused in other collections

Example answer, score = 12

Collection 1:

  1. abcdef
  2. 123
  3. jklom

Interleaved: a1jb2kc3ldoemf

Collection 2:

  1. abcdef
  2. 123

Interleaved: a1b2c3def

Questions for Meta

  • How do I make the description clearer? It's not great right now.
  • Is this a dupe?
  • Should the output be modified so it's easier? Maybe people can choose their own output?
  • Any way to improve the scoring? How do I prevent people gaming the score by posting answers with lots of collections of size 2? I was thinking about forcing all programs in all collections to be drawn from the biggest collection.
  • Is this even worth posting as a question?
\$\endgroup\$
0
\$\begingroup\$

Input program generating Fibonacci, output program generating Fibonacci

Challenge:

You will have to write program, which outputs program, that outputs single Fibonacci number. First program should output first element of sequence (0), second should output second element of sequence (1), etc. You can also write two input strings - first is input to your program when it is first launched. Second will be always input to the generated program. The next time your program is launched, it's input will be the program it generated previously.

Rules:

  • Your score is sum of length of program and input strings.
  • Your inputs can be something else than string (numbers, booleans). To get your score, treat them like strings. E.g. true have length 4, 123,false have length 9.
  • You can use two different languages for the programs, but solutions using single language are preferred.

Output sequence (A000045):

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, ...

Related

\$\endgroup\$
3
  • \$\begingroup\$ "write two input strings", maybe "take two input strings"? \$\endgroup\$
    – tsh
    Jul 11 at 6:02
  • \$\begingroup\$ "that outputs single Fibonacci number" do I required to output 0 for first outputted program, and 1 for the second one, ...? Or maybe I can always output 0 since it is a "Fibonacci number"? \$\endgroup\$
    – tsh
    Jul 11 at 6:04
  • \$\begingroup\$ @tsh I made edit to address your second comment. Also I think that "write" as well as "take" is correct. But I wanted to say that this challenge is not just about writing program which you submit to your answer, but you can also write the input which counts towards byte count and is also part of your answer. \$\endgroup\$
    – Jiří
    Jul 11 at 15:17
0
\$\begingroup\$

Make an ASCII art arrow

Given a size and direction (up, down, left, or right), you will create an ASCII art arrow.

Drawing it

For an arrow pointing up

For size \$s\$, there are \$2s\$ | characters in the center, with 1 _ character at the top. On the left of each of the top \$s\$ pipe characters, there is a / diagonally aligned with the arrow, and on the right side, the same but with backslashes.

Size 1:
 _
/|\
 |


Size 2:
  _
 /|\
/ | \
  |
  |

An arrow pointing down

Similar to an arrow facing up, it will have \$2s\$ (where \$s\$ is still the size) vertical | characters, with a hyphen below them. Starting from the bottom |, diagonally distribute slashes and backslashes on each side (only going up \$s\$ | characters).

Size 1:

 |
\|/
 -


Size 2:

  |
  |
\ | /
 \|/
  -

An arrow pointing left

Where \$s\$ is the size, there should be \$2s\$ hyphens going horizontally, with 1 | on the left of them. Starting from the leftmost hyphen, going up to the \$s\$th hyphen, diagonally distribute / and \ spreading out.

Size 1:

 /
|--
 \

Size 2:

  /
 /
|----
 \
  \

An arrow pointing right

This is pretty much an arrow pointing left, but inverted.

Where \$s\$ is the size, there should be \$2s\$ hyphens going horizontally, with 1 | on the right of them. Starting from the rightmost hyphen, going to the \$s\$th last hyphen, diagonally distribute / and \ spreading out.

Size 1:

 \
--|
 /

Size 2:

  \
   \
----|
   /
  /

Rules

  • As for the size, you may take any of \$n-1\$, \$n\$, \$n+1\$, or \$2n\$.
  • For the direction, you may use any four consistent values.
  • This is , so shortest code for each language wins.
  • Standard loopholes are forbidden.
  • Standard I/O rules apply.

Meta

  • Is this clear?
  • Is this too boring, or too similar to another challenge?
\$\endgroup\$
3
  • \$\begingroup\$ Related. \$\endgroup\$
    – Steffan
    Jul 12 at 18:04
  • \$\begingroup\$ Suggestion: make the arrows "pointy" (with ^v<>) - this may however make the challenge harder as would prevent simple reflection of up/down and right/left pairs. \$\endgroup\$
    – pajonk
    Jul 12 at 19:09
  • \$\begingroup\$ @pajonk I didn't do that because it looked fine on the up/down ones, but with left/right, it just looked really weird. \$\endgroup\$
    – Steffan
    Jul 12 at 20:08
0
\$\begingroup\$

Repeat after me

(draft)
Write a program which constantly records audio and plays it after a delay.
The delay has to be one second.

Rules

  • The volume has to be 100% of the device volume

Meta: Do I have to specify anything else audio-related?
\$\endgroup\$
2
  • \$\begingroup\$ What does it mean to print the audio? That seems like it depends very heavily on the format used to encode the audio -- are you saying that any reasonable encoding is allowed? \$\endgroup\$ Jul 23 at 19:55
  • \$\begingroup\$ I feel like printing the audio would be much, much easier than playing it, so it isn't an option anymore \$\endgroup\$
    – mathcat
    Jul 24 at 18:08
0
\$\begingroup\$

Get string from CIGAR and reference

In the field of genomics, CIGAR (Concise Idiosyncratic Gapped Alignment Report) strings are sometimes used to indicate how a DNA sequence aligns to a reference sequence of DNA. CIGAR strings are sequences of <operation, length> pairs. An operation can be M, meaning "match", I, meaning "insert", or D, meaning delete. The length describes the number of times the operation is repeated1. (For our purposes, we'll assume a match means that both matched characters are the same -- i.e. an alignment match.)

Suppose we align string \$S\$ to reference string \$R\$, producing CIGAR string \$C\$. You can think of the CIGAR string \$C\$ as operations applied to \$R\$ to turn it into \$S\$. If we treat \$R\$ as a sequence of consumable tokens, then to get \$R\$:

  • Iterate through the pairs <operation, length> in \$C\$:
    • length times, repeat operation:
      • If operation is I, output a character different than the current token of \$R\$
      • If operation is D, consume the current token of \$R\$
      • If operation is M, consume and output the current token of \$R\$

(Note: You can assume that for any input CIGAR string, all tokens in \$R\$ will be consumed. In other words, the length of \$R\$ equals the number of M and D operations applied.)

For example, suppose we've aligned the DNA string ACAACTA to the reference ACTCAGTA as follows:

AC-AAC--TAC 
ACT--CAGTAC
MMDIIMDDMMM

This would be encoded as M2D1I2M1D2M3.

Another example:

-G-T--G-AT--GGCG-T
AGCTGCGCATAA-GC-A-
DMDMDDMDMMDDIDDIDI

Which is encoded as D1M1D1M1D2M1D1M2D2I1D2I1D1I1.

The challenge: Given the reference string \$R\$ and a CIGAR string \$C\$, output a string \$S\$ which would produce the CIGAR string \$C\$ when aligned to \$R\$. (There are obviously many cases where there are many possible strings which satisfy this condition -- you can output any one of them.)

Test cases:

\$R\$ \$C\$ \$S\$
AAA M3 AAA
AAA I3D3 CCC
AAA D3I3 CCC
AAA D1I1D1I2D1 CCC
AAA D3 (the empty string)
AAA M1D2I1 AC
ACTCAGTA M2D1I2M1D2M3 ACAACTA
AGCTGCGCATAAGCA D1M1D1M1D2M1D1M2D2I1D2I1D1I1 GTGATGGCGT

Standard loopholes are forbidden. Because this is , the shortest program wins.

1Paraphrased from https://www.ebi.ac.uk/about/vertebrate-genomics/software/exonerate-manual

Questions

The more obvious question would be "given reference \$R\$ and aligning string \$S\$, find the cigar string corresponding to the best possible alignment", but that probably has been done already, and I've already accidentally posted a duplicate question...

I almost certainly should explain alignment better, but I'm not sure how to do it.

\$\endgroup\$
0
\$\begingroup\$

Generate number set with conditions using n numbers

\$\endgroup\$
3
  • \$\begingroup\$ Is this the same as "generate \$T=\{T_1, ..., T_x\}\$, the minimum number of \$k\$-length subsets of \$\{1,...,n\}\$ such that every \$v\$-length subset of \$\{1,...,n\}\$ is a subset of some set in \$T\$"? \$\endgroup\$ Jul 29 at 20:31
  • \$\begingroup\$ @Adam yes It is same ? Has this been asked already? Or do you want me to change description to this ? \$\endgroup\$
    – 2FaceMan
    Jul 30 at 5:30
  • 1
    \$\begingroup\$ For future reference a quote from the main sandbox post above: "It is recommended to leave your posts in the sandbox for at least several days, and until it receives upvotes and any feedback has been addressed." Some of the issues raised in the main site could have been caught and addressed here. \$\endgroup\$
    – pajonk
    Jul 30 at 18:04
0
\$\begingroup\$

Transform characters of your choice into "Hello, world!"

\$\endgroup\$
4
  • \$\begingroup\$ "takes character as input and outputs character", does it mean that the program output a single character? "fed into the program one by one", does it mean that the program take all 13 characters as input? If the program cannot store data between runs, how could it yield different output for same input? \$\endgroup\$
    – tsh
    Jul 11 at 6:00
  • 1
    \$\begingroup\$ @tsh you get to choose which 13 characters are input. so you could, for example, have it so that inputting each of "abcdefghijklm" outputs a character of "Hello, world!". Every other character input would just have to output a character, with no further restriction. \$\endgroup\$ Jul 11 at 12:47
  • 1
    \$\begingroup\$ I suspect in most languages it would be optimal to write a program which outputs its input, and use "Hello, world!" as the input, which isn't particularly interesting \$\endgroup\$ Jul 18 at 3:59
  • \$\begingroup\$ @CommandMaster This is why I chose that it have to be unique characters, so cat program can't be used anymore. (character o is there two times, character l three times) \$\endgroup\$
    – Jiří
    Jul 18 at 13:03
0
\$\begingroup\$

For Meta

This challenge is currently just a very undeveloped idea I had today! So I'm just dumping it here to start getting feedback and somewhere to leave my own thoughts and notes as I start this.

As this is in such a undeveloped form and I'm not sure when I'll have time to do it, other people are very much encouraged to develop this if they want!

I'm hoping to end up with something with a similar format to @trichoplax's Formic Functions - Ant Queen of the Hill Contest.

Notes

  • even a simple chess engine may be so complex that even expert golfing may have no effect on catching a better written engine in size
  • scoring seems very messy if you include game_length and function_length as these numbers could be all sorts of sizes
  • would checkers be a better/simpler game to do this with?
  • making it single language (javascript) would make it very easy to implement for me but would make golfing less interesting?

The Code Golf Chess Invitational

I have developed a simple chess interface (to be written) that will:

  1. provide board state to your function
  2. wait for your functions move
  3. verify your move
    • invalid moves will result in a loss
  4. make the move
  5. repeat for the opponent
  6. and repeat until there is a winner
  7. then score both functions

The score

The score of each function will be determined by the length of each function and the number of moves the game lasted. With higher scores being worse!

  • Winners score will be 1 * length_of_program
  • Losers score will be game_length * length_of_program
  • Losing by invalid move score will be (game_length)^2 * length_of_program

(Scoring very much to be revised but ideally I want to encourage short programs, encourage winning, and absolutely discourage invalid moves (random playing))

Your function

  • MUST NOT query other sites/libraries/etc
    • it could include an entire library if you wished, but that would obviously be a very long function
  • should take a 2d array as input of the board state, [[a1, a2 ... a8], [b1 ... h8]]
  • return a chess move in chess notation
  • warnings (and errors?) are fine as long as the program still returns a move
  • normal other restrictions apply

You, yourself

  • Please provide assistance in getting your function running on the GitHub site!

(this needs work because whilst I'm sure I could get many common languages (esp scripting languages) working I'm not sure how well I'd do with some of the more golf-y/compiled languages)

Tournament

The initial tournament would be a continuous round robin of all current submissions with each functions running score an average of each score each game.

Then a final day, where every function competes against every function x times. This would decide the "winner" of the competition and the accepted answer tick.

Then just for fun a seeded knockout tournament (based on the final score) to decide who had the best chess program. (Maybe a bounty award for this)

\$\endgroup\$
1
  • 2
    \$\begingroup\$ I think you should make winners score 0 and losers (including invalid moves) length_of_program+10 or something similar. Because currently the best strategy is to lose game at beginning by invalid move. Anyway, if you decide my idea of scoring isn't good enough, then it feels weird to punish losers for long games - I expect that longer games are harder and shorter games are simpler, so the scoring should be opposite. \$\endgroup\$
    – Jiří
    Aug 4 at 15:59
0
\$\begingroup\$

Implement Bloom filter insertion

A Bloom filter is a probabilistic data structure that is used to determine whether an element is in a set in a fixed number of bits. It consists of:

  1. a bit array \$B\$ of fixed size \$m\$, initialized as all \$0\$s, and
  2. \$k\$ different hash functions \$h_1,\ldots,h_k\$ which each map any element to some value \$v \in 0,\ldots,m-1\$.

To insert element \$s\$ into the set, set \$B[h_i(s)]\$ to \$1\$ for each hash function \$h_i\$.

To check if element \$s\$ is in the set, check the value of \$B[h_i(s)]\$ for each hash function \$h_i\$. If they are all \$1\$, return true; otherwise return false.

For example, suppose we start with bit array of size 5:

0 0 0 0 0

We also define hash functions \$h_1(s) = s\bmod m, h_2(s) = (s^2)\bmod m\$. To insert value \$13\$, We calculate the indices to change: $$i_1 = h_1(13) = 13\bmod 5 = 3,\\ i_2 = h_2(13) = (13^2)\bmod 5 = 4$$ So we set \$B[3]\$ and \$B[4]\$ to \$1\$:

0 0 0 1 1

To check if \$13\$ is in the set, we look if \$B[3]\$ and \$B[4]\$ are both \$1\$.

The challenge

You should implement the insertion part of a Bloom filter. Take in three inputs: two positive integers \$m\$ and \$k\$, and a series of non-negative integers \$S=\{s_1, \ldots, s_n\}\$. Output the bit array of the Bloom filter of size \$m\$ with all the elements of \$S\$ added using \$k\$ hash functions, with any two distinct values substituting for \$1\$ and \$0\$.

You can choose any \$k\$ hash functions as long as they have uniformly distributed output and are not perfectly correlated (probably the wrong term for this). In other words:

  • Over all non-negative integers \$\{s\}\$, the probability of \$h_i(s)=v\in\{0,\ldots,m-1\}\$ is \$\frac1m\$.
  • For all pairs of functions \$(h_i,h_j)\$, there is not a mapping between the output of \$h_i\$ and the output of \$h_j\$. For example, you couldn't use \$h_1(s) = s\bmod m, h_2(s) = (s+1)\bmod m,\$ because you can perfectly determine the output of \$h_2\$ from the output of \$h_1\$.

(Ideally, these functions should be independent, but that's not a practical request.)

Examples

TODO

Questions

I could ask for both insertion and value checking, but I don't want to overcomplicate this.

\$\endgroup\$
0
\$\begingroup\$

All permutations of range from \$1\$ to \$n\$

Given a positive input \$n\$, output all permutations of either \$\{0,1,\ldots,n\}\$ or \$\{1,2,\ldots,n\}\$.

Examples

Outputting permutations of \$\{1,2,\ldots,n\}\$.

Input Output
1 [(1)]
2 [(1, 2), (2, 1)]
4 [(1, 2, 3, 4), (1, 2, 4, 3), (1, 3, 2, 4), (1, 3, 4, 2), (1, 4, 2, 3), (1, 4, 3, 2), (2, 1, 3, 4), (2, 1, 4, 3), (2, 3, 1, 4), (2, 3, 4, 1), (2, 4, 1, 3), (2, 4, 3, 1), (3, 1, 2, 4), (3, 1, 4, 2), (3, 2, 1, 4), (3, 2, 4, 1), (3, 4, 1, 2), (3, 4, 2, 1), (4, 1, 2, 3), (4, 1, 3, 2), (4, 2, 1, 3), (4, 2, 3, 1), (4, 3, 1, 2), (4, 3, 2, 1)]

Standard loopholes are forbidden. The shortest code wins.

Questions

I was looking for this challenge, but I couldn't find it posted anywhere. Maybe because it's too derivative of a simple "output all permutations" challenge?

\$\endgroup\$
0
\$\begingroup\$

Hello, World! hashing

Implement a one-way hashing function that generates arbitrary strings which have a chance (obviously input dependent) of producing at least any of the printable ASCII characters when provided an input of at least 2 characters. This can be any mechanism you choose and could always output a fixed length if desired, however when your source code is used as input, the resultant output must be Hello, World!.

Rules

  • The input string will always be 2 characters or more (meaning your code must be at least two characters).
  • There are no other special requirements for any other input strings.
  • The output should not be exactly the same as the input (this might be unavoidable in some scenarios with well-crafted input, but you can't just output your input if the code Hello, World!, by some magic, in your language performs some sort of hashing).
  • It should be feasible to get at least any of the printable ASCII characters as output. You are however not limited to printable ASCII output and may output any combination of bytes (e.g. unprintables, UTF-8 sequences)
  • All characters of the input string should be taken into account when generating strings, not just the first 13 and should affect the output.

For meta

I'd really like to encourage answers that aren't a condition that just compares input with source and outputs Hello, World! in that instance, but as pointed out by @pajonk it's a non-observable requirement.

\$\endgroup\$
9
  • \$\begingroup\$ I think you can use tags code-golf, hello-world and restricted-source. Can you also explain what does "strings consisting of at least (but not limited to) the printable ASCII" mean? (That some strings have to contain printable characters or all strings have to contain printable characters?) Also does full input string have to be used to calculate hash? I expect some people might want to use just fixed part of input string to make this task easier. \$\endgroup\$
    – Jiří
    Aug 2 at 16:10
  • 2
    \$\begingroup\$ Suggested tag: self-referential. Be careful with non-observable requirements (like you must not have a special condition), as they are discouraged. Also, you may define what does most inputs should result in different output mean exactly (or drop it), as this may be considered too vague. \$\endgroup\$
    – pajonk
    Aug 3 at 7:12
  • \$\begingroup\$ @Jiří My intention with that wording is that the output you generate must at least have the possibility for any character in the printable ASCII range to be included, but may also output unprintables or higher byte value unicode chars for instance. The full input string must also be used, yes. So changing a character at the end of the string should change the value returned. I'll clarify that. Also, not entirely sure on restricted-source, but I'll check the wiki, thank you! \$\endgroup\$ Aug 3 at 12:24
  • \$\begingroup\$ @pajonk Yeah, that's a good point. I guess I didn't want an arbitrary hashing algorithm with a if input == source condition (which I think would be considerably easier). Good point about the wording on most inputs I'll clarify along with Jiří's suggestion of ensuring all characters are used and can affect the output, hopefully that covers that off. I'll look at self-referential too. Thank you! \$\endgroup\$ Aug 3 at 12:27
  • \$\begingroup\$ @pajonk I can't think of a way to make an observable requirement to avoid the simpler solution which makes me inclined to remove this as I think it trivialises the problem. Any idea on how to enforce that without having this blacklisted? \$\endgroup\$ Aug 3 at 12:34
  • \$\begingroup\$ @DomHastings remember that simple comparison input==source is not so simple, as requires a modified version of a quine. This may or may not be shorter than other possible approaches. \$\endgroup\$
    – pajonk
    Aug 3 at 12:45
  • \$\begingroup\$ Also I was thinking how I would write answer for this and came up with following idea: Sum all characters on input and then add this sum to ASCII codes of individual characters of string "Hello, World!" (%256). Would this answer be fine? \$\endgroup\$
    – Jiří
    Aug 3 at 13:08
  • \$\begingroup\$ @Jiří yeah, absolutely! \$\endgroup\$ Aug 7 at 13:26
  • \$\begingroup\$ @pajonk I guess so, I feel like modified quines aren't that interesting sometimes... But you're right, probably not trivial in every language. I guess the kinda of answer is love to see is a generic mechanism that is calculated to, based on the code as input, the exact string required, but that might be a big request! It's an interesting problem (to me at least) as it felt easier than I've found it upon trying to execute it! \$\endgroup\$ Aug 7 at 13:29
0
\$\begingroup\$

Generate a Kirkman triple system

\$\endgroup\$
0
\$\begingroup\$

Program a compiler compiler

Write a program, function, or likewise that takes in a BNF-like grammar specification(see below) and outputs a program or function in a language of your choice that takes strings as input and returns truthy if that string is parseable with the specified grammar, and false otherwise.

Meta-language:

The input to your program will consist of a number of bnf-like rules. Each definition will be on its own line, and will consist of a name (string of 1 or more characters [a-z0-9]), followed by the symbol ::= followed by a string of symbols(terminal and non terminal), terminals consist of [a-zA-Z0-9() ]. Nonterminals are denoted with a < followed by a string of characters [a-z0-9] followed by >; that string of characters refers to another definition. Each definition may have multiple alternatives, separated by |. Alternatives should be matched left to right. The first line of the input will share this same form, except that it will not have the name of the definition or the ::=. This is the "top-level" definition that the input to the outputted program will attempt to be matched against.

Input grammars will never contain left-recursion (ie. it will never be the case that there will be a rule of the form a::=<a>). You may additionally assume that your generated program will only be given as input strings that contain only those characters comprising valid terminal symbol([a-zA-Z0-9() ]). Additionally, your compiler-compiling program only needs to handle valid definitions.

Examples:

The following should be handled appropriately by your program:

binaryliteral
binaryliteral::=0<binaryliteral>|1<binaryliteral>|0|1

This means that the generated program should return truthy for any strings that match the definition of a binary literal, which is either the character 0 or 1 followed by a binary literal, or just 0 or 1. This would recognize strings

quantexpr
quantexpr::=forall <var>(<expr1>)|exists <var>(<expr1>)
expr1::=<expr0> and <expr1>|<expr0> or <expr0> |not <expr1>|<expr0>
expr0::=<var>|(<expr1>)
var::=x|y|z

and you do not need to handle the following:

x:=1
expr
expr::=x|<expr> plus <expr>

As usual, this is code-golf, so the shortest program per (implementation, output language) pair wins!

\$\endgroup\$
3
  • \$\begingroup\$ This could use a bit of cleanup but I'm totally behind this idea, so +1. Note: i think your terminal string regex is wrong, +-* expresses a range. in general i think it'd be worth considering simplifying what terminals are allowed, but thats just my onpinioin \$\endgroup\$ Aug 15 at 15:06
  • \$\begingroup\$ @thejonymyster good catch on that regex; I'll fix that. Is there anything else that needs to be changed pursuant to "cleaning up"? \$\endgroup\$
    – Benji
    Aug 15 at 16:57
  • \$\begingroup\$ sorry for the nondescriptive wording on my part; I just think the meta language description could be broken down into smaller sections, maybe with a small worked-out example or two. As is, it's fairly clear but just a bit densely packed. Additionally, I think you should link to something (maybe wikipedia) about BNF, for those entirely unfamiliar. :-) \$\endgroup\$ Aug 15 at 18:13
0
\$\begingroup\$

smallest number of steps for a knight in chess

\$\endgroup\$
1
  • 1
    \$\begingroup\$ I've edited this down to a stub now that it's been posted to save space \$\endgroup\$ Aug 20 at 1:07
0
\$\begingroup\$

Add numbers as fairly as possible

Given an array of integers \$X\$ and an array of positive integers \$A\$, figure out how to add the values in \$A\$ to the values in \$X\$ such that the variance of the updated values is as small as possible. (You can add more than one value from \$A\$ to a given value in \$X\$.)

[Explanation of variance]

If there are multiple solutions, you can output any of them. Output in any reasonable format.

Example

Suppose \$X = [4,5,6]\$ and \$A=[1,2]\$. The "most fair" way to distribute the value \$1\$ to \$4\$ and \$2\$ to \$5\$, making the updated array \$X' = [6,6,6]\$, which has a variance of \$0\$. Therefore, you should output something like [[2],[1],[]] or {4:[2],5:[1]}.

Test Cases

[TODO]

Questions

I am almost certain a question like this has been done before, which is why I'm not putting much effort into this post.

\$\endgroup\$
0
\$\begingroup\$

Contrasting Colors

When designing a website or poster or book it's important to make the graphical elements be distinct. A common mistake is to choose colors to similar to eachother. We must prevent this!

The goal of this challenge is simple: Given a initial color and a number of colors to generate, generate N colors that each have maximal contrast to each of the previous colors.

Contrast is defined as the sum of absolute differences. The contrast of a new color is the minimum of the distances to all previous colors. You do not need to consider gamma. Colors are a 3 tuple with each value a integer ranging from 0 to 255.

You must use a greedy algorithm. AKA you shouldn't consider the number or even existence of colors afterwards, just colors before. This is because in the design each subsequent color will be used significantly less.

In some cases, multiple choices are available. In this case you may pick any. Thus your results might not look the same as my test cases but still be valid.

You may chose whether to include the initial value in the output or not.

This is code golf, shortest answer wins.

Test cases

{
    [(255,255,255),5]: [(255, 255, 255), (0, 0, 0), (0, 127, 255), (63, 255, 64), (191, 0, 191), (254, 128, 0)],
    [(255,0,128),5]: [(255, 0, 128), (0, 255, 0), (0, 64, 255), (191, 255, 223), (32, 0, 32), (192, 128, 0)],
    [(128,128,128),10]: [(128, 128, 128), (0, 0, 0), (0, 255, 255), (255, 0, 255), (255, 255, 0), (32, 32, 223), (32, 223, 32), (223, 32, 32), (223, 223, 224), (0, 81, 111), (81, 96, 15)],
    [(7,91,7), 5]: [(7, 91, 7), (255, 255, 255), (89, 0, 255), (255, 0, 44), (0, 211, 217), (173, 255, 0)]
}
\$\endgroup\$
2
  • \$\begingroup\$ Do we need to include the initial color in the output? The text suggests no, but the test-cases do include it. Also, are the color values required to be integer? \$\endgroup\$
    – pajonk
    Aug 29 at 12:38
  • \$\begingroup\$ You may or may not include the initial value, your choice. Colors must be integers. I'll clarify \$\endgroup\$
    – mousetail
    Aug 29 at 12:42
0
\$\begingroup\$

The least amount a steps a chess pice can reach a position

I have previously posted a challange: smallest number of steps for a knight in chess. Now I would like to go a step further by adding the possibility to choose you piece.

If you place a pice on any square of a chessboard, what is the smallest amount of steps to reach every possible position?

Rules

  • It is an 8 by 8 board.
  • The given input is a coordinate (x,x) and the chosen piece. Explain in the answer how to input the piece of choice.
  • The piece starts at an arbitrary position, taken as input.
  • The pawn can not start at the bottom row, and can not move 2 steps (like when in the startposition).
  • point '.' will be placed if a pice cannot reach the square.

Example
With input 1, 0 for a knight, we start by putting a 0 in that position:

. 0

From her on we continue to fill the entire 8x8 board. For a knight the output will look like follow

3 0 3 2 3 2 3 4
2 3 2 1 2 3 4 3
1 2 1 4 3 2 3 4
2 3 2 3 2 3 4 3
3 2 3 2 3 4 3 4
4 3 4 3 4 3 4 5
3 4 3 4 3 4 5 4
4 5 4 5 4 5 4 5

For a pawn with input (1, 7) the output will look like follow

. 6 . . . . . . 
. 5 . . . . . . 
. 4 . . . . . . 
. 3 . . . . . . 
. 2 . . . . . . 
. 1 . . . . . . 
. 0 . . . . . . 
. . . . . . . . 

In the examples, I start counting from zero but it does not matter if you start from or one.

Challenge The pattern printed for a pice, as short as possible, in any reasonable format.

\$\endgroup\$
2
  • 2
    \$\begingroup\$ I'd recommend allowing the piece indicator to be any 6 distinct values, rather than requiring them to be 0,1,...,5 in a certain order. \$\endgroup\$ Aug 30 at 16:36
  • 2
    \$\begingroup\$ Also, a few typos: "stap" (step), "you pice" (your piece), "pice" (piece), "nummerate" (enumerate) \$\endgroup\$ Aug 30 at 16:39
0
\$\begingroup\$

Strategy: The cunning cousin witch

The wizard has a cunning cousin who is a witch. She looks down on the wizard, regarding him and his puzzles as mathematically naive. On reading his latest puzzle, she scorned him for always asking discrete problems with what she (unfairly) characterises as simple solutions, where the real, proper question should be continuous. To prove her point she poses the following version of the wizard's puzzle. (He reluctantly permits the partial plagiarism.)

Consider the following setup. An evil witch has a number line stretching from 0 to 10 which is hidden from you. Also hidden from you she chooses a random integer \$x \in \{0, \dots, 10\}\$ and places that many points onto the number line uniformly at random. To be more precise, she places each of the \$x\$ points independently and uniformly at random onto the number line. Your task is to prove that \$x = 10\$ and if you do the witch will grant you what she promises is a much better wish than what her cousin can provide.

In this game, you can at each step choose a floating point number \$y\$ and the witch will tell you the number of points on the number line with value less than or equal to \$y\$.

However the witch, being at least as evil as her cousin, will not let you choose a number larger than \$9\$. This might still be OK as you might still find 10 points and in fact the only way to be granted the wish is to have found all 10 points with values 9 or less.

The cost for choosing a floating point number \$\ell\$ is \$2^{\ell}\$ dollars. At any point, you can choose to give up on this set of points and get her to start the whole process again (with a new random \$x\$). Of course, if you choose the number 9 and you still have not found 10 points you have no choice but to give up and start again. But you might want to give up earlier too. Sadly you never get any money back so your costs just carry on building.

Your goal is to devise a strategy that will get you the wish at the minimum expected cost. You should report your mean cost.

Testing

Once you have chosen your strategy, you should run it until you get the wish 10,000 times and report the mean cost. If two answers have the same strategy, the one posted first wins. If two strategies have similar mean costs you may need to test it 100,000 or even more times to tell the difference. Of course if you can directly compute the expected cost, all the better.

Input and output

There is no input in this challenge. The output is just the mean cost to get a wish. To test your code you will need to implement both the witch and your strategy.

What's a naive score?

If you just choose 9 each time then it will take you \$\frac{1}{\frac{1}{11} \cdot \frac{9}{10}^{10}} \approx 31.5\$ tries to find 10 points. This will cost you approximately \$16152.4\$ dollars. How much better can you do?

\$\endgroup\$
2
  • \$\begingroup\$ I think it's more elegant if the values instead range from 0 to 1 -- the situation is exactly the same except that the values are scaled down. \$\endgroup\$ Aug 31 at 17:02
  • \$\begingroup\$ @Adam I thought about that. The problem is that \$2^9=512\$ is a nicer number than \$2^{0.9} \approx 1.87\$. \$\endgroup\$
    – graffe
    Aug 31 at 17:09
0
\$\begingroup\$

Persistence of a number

\$\endgroup\$
0
0
\$\begingroup\$

Calculate Pi unto a Point using the Nilakantha series

\$\endgroup\$
2
  • \$\begingroup\$ What should be the desired precision - are floating-point errors ok? Suggested tag: sequence (+adopting output rules from there). Suggestion: merge odd and even cases to one using \$(-1)^n\$ for \$n>1\$. Please make the test-cases copy-friendly (see codegolf.meta.stackexchange.com/a/8101/55372). \$\endgroup\$
    – pajonk
    Sep 13 at 11:41
  • \$\begingroup\$ There you go. I've added all of that. \$\endgroup\$ Sep 13 at 12:48
0
\$\begingroup\$

Is there a area that can see the entire perimeter of a polygon

Oh no, your despotic regime has too many political prisoners and not enough guards! Time for drastic measures: Only build prisons that require only a single guard. But there are many prison design and little time. How to check?

The challenge

Given a polygon, as a list of points, determine if there is a area (where the guard can stand) that can see the entire perimeter of the polygon.

Any convex shape trivially qualifies:

pentagon

Some concave shapes qualify too:

concave shape

But not all:

concave shape where there is no place for a guard

Algorithm hint

The area where a guard can stand is the intersection of the areas on the inside of the tangent of every edge.

Test Cases

Image Points Outcome
TBD
\$\endgroup\$
1
120 121
122
123 124
135

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .