Output a sudoku board
code-golf kolmogorov-complexity, sudoku
Today's challenge is simple: Without taking any input, output any valid sudoku board.
In case you are unfamiliar with sudoku, Wikipedia describes what a valid board should look like
The objective is to fill a 9×9 grid with dig...
Sorry for the bad title, but I couldn't describe my problem in a few words.
I'm creating a programming language aimed at code golf puzzles. The language has an internal set of tapes, where the computations are saved and then retrieved to the user.
At the end of the program, the interpreter prin...
Sorry for the bad title, but I couldn't describe my problem in a few words.
I'm creating a programming language aimed at code golf puzzles. The language has an internal set of tapes, where the computations are saved and then retrieved to the user.
At the end of the program, the interpreter prin...
CMC: Given a positive integer n as input, output n as a sum of 3 palindromes. E.g.:15649 → 15051 + 595 +3; 1748963 → 1000001 + 679976 + 68986; 6158516 → 6158516 + 0 + 0; 6158515 → 5211125 + 932239 + 15151
@J.Sallé I saw the numberphile video, and taking from that this seems like an extremely tedious golfing challenge. Considering there are 40 special cases, and some guesswork involved.
@dzaima Fair point, though I think you could brute force numbers below \$10^9\$ quite easily, since the algorithm should be \$O(\sqrt{n}^3)\$ approximately
Dang it, no latex support. O(n^(3/2)) is what it says.
As always, I don't know how to name this
in this challenge you are going to place letters from the alphabet in a Cartesian plane and output the result as a text.
Your input will consist in a list of list with 3 parameters
X coordinate
Y coordinate
Letter
How are we going to do that? using ...
You're given a triangular grid:
It has 4 ports.
You're also given four different pieces from A to D:
Each piece has a little segment of path inside it.
Your basic goal is to build paths between ports (1..4). Path is a collection of pieces put onto the grid. You may rotate the pieces in m...
BS On Steroids (Here is the ChatRoom)
I love playing the card game BS, but sometimes, it just doesn't have enough oomph for my short attention span. So, my friends and I have added some modifications to the game to make it interesting.
Rules
The game begins with a random player declaring the ...
The challenge is actually extremely simple. Pick 5 distinct letters (you can just pick the 5 that allow you the shortest code if you like) and output them to the console. However, the twist is that they must be from the following list:
AAA BBBB CCCC DDDD EEEEE FFFFF ...
@DJMcMayhem Well, in that challenge you get to choose the output, but once you do, the output is constant. In yours it's not constant even at runtime. Anyway, I think the tag can be applied, as the challenge is essentially Kolmogorov complexity
Make a program that takes the word you input, and adds that word to the back of itself minus its first letter, then repeats until all letters are gone. For example, cat would become catatt, and hello would become helloellolloloo.
Input
Any of the 26 letters of the english alphabet. There may b...
Output a sudoku board
code-golf kolmogorov-complexity, sudoku
Today's challenge is simple: Without taking any input, output any valid sudoku board.
In case you are unfamiliar with sudoku, Wikipedia describes what a valid board should look like
The objective is to fill a 9×9 grid with dig...
You're given a triangular grid:
It has 4 ports.
You're also given four different pieces from A to D:
Each piece has a little segment of path inside it.
Your basic goal is to build paths between ports (1..4). Path is a collection of pieces put onto the grid. You may rotate the pieces in m...
BS On Steroids (Here is the ChatRoom)
I love playing the card game BS, but sometimes, it just doesn't have enough oomph for my short attention span. So, my friends and I have added some modifications to the game to make it interesting.
Rules
The game begins with a random player declaring the ...
The challenge is actually extremely simple. Pick 5 distinct letters (you can just pick the 5 that allow you the shortest code if you like) and output them to the console. However, the twist is that they must be from the following list:
AAA BBBB CCCC DDDD EEEEE FFFFF ...
Make a program that takes the word you input, and adds that word to the back of itself minus its first letter, then repeats until all letters are gone. For example, cat would become catatt, and hello would become helloellolloloo.
Input
Any of the 26 letters of the english alphabet. There may b...
