Questions tagged [atomic-code-golf]
Atomic code golf is scored by the number of operations in a specific fragment of a language you define.
84
questions
5
votes
3
answers
280
views
Fewest Instructions for Mihály Quine
https://mihaly.barasz.com/compressed-loop/game.html
You have a simple, line-oriented “compression” language. The language works as follows:
The document must start with the ...
- 193
8
votes
3
answers
452
views
Stably sort N elements in this restricted "cmov" language
The following problem is taken from the real world — but indubitably code-golf!
In this puzzle, the programming language is fixed, and your job is to write the most ...
- 797
15
votes
3
answers
566
views
Count the number of disjoint 11 blocks
The task is to count the number of disjoint 11 blocks in a 64-bit word, using the minimum number of straight-line instructions. That is, how many nonoverlapping ...
- 253
8
votes
1
answer
528
views
Use a Finite Combo in Magic the Gathering to Produce Graham's Number
Produce Graham's Number in Magic the Gathering using the fewest number of cards and without using any infinite combos.
Rules:
Producing Graham's number means do anything that requires Graham's number ...
- 407
23
votes
5
answers
2k
views
Implement a very simple ALU using only NAND gates
Note: This challenge was inspired by Joe Z's many excellent questions surrounding NAND golfing.
Description
Your goal in this challenge, should you choose to accept it, is to implement a very simple ...
- 1,623
12
votes
2
answers
649
views
Branchless (MIPS) assembly code for median of 3
I was trying to write a short MIPS32 code for computing the median of three registers.
The rules:
Assume that some values are pre-loaded into $t0, ...
- 221
15
votes
1
answer
435
views
Build the stove controller (physically)
Challenge
Build the Wheat Wizard's stove using 2-input NAND gates. The solution with the fewest NAND gates wins.
Externally, it works in the following way: (the first line is added from the original ...
- 77.5k
12
votes
2
answers
1k
views
SKI calculus golf: Hello, World!
Background
SKI combinator calculus, or simply SKI calculus, is a system similar to lambda calculus, except that SKI calculus uses a small set of combinators, namely ...
- 77.5k
8
votes
3
answers
840
views
Crack the Lost Numbers
The Lost Numbers are 4, 8, 15, 16, 23, 42. Your goal is to create an expression to output them all.
Your allowed characters are 0123456789, ^+-*/, (), % for modulo and n as the single variable allowed....
- 3,849
3
votes
3
answers
819
views
Programming Less-Than, Greater-Than and Equal-To functions using Restricted Source [closed]
I'm currently working with a branchless language which does not have native Less-Than, Greater-Than or Equal-To functions. I do however have min, ...
- 7,531
4
votes
1
answer
461
views
Write a fast-growing assembly function
Synopsis
Your goal is to implement the (asymptotically) fastest growing function within bounded code on a fictional CPU utilizing a quite limited, yet (probably) turing-complete instruction set.
...
- 1,659
9
votes
3
answers
542
views
Efficient table-lookup computation
The challenge: compute the day of the week from a MM-DD representation of a day in this year (2021).
However, you have to write your program in the following subset ...
- 17.3k
34
votes
7
answers
4k
views
Shortest "arithmetic" formula to output 1000 primes
Write a formula using only the digits 0-9, +, *, -, <...
- 341
17
votes
3
answers
2k
views
Final tribute to John Conway: FRACTRAN self-interpreter
It's time to conclude the series of John Conway challenges of mine.
Background
A FRACTRAN program consists of an ordered list of fractions. The program starts by taking a single integer as input. Each ...
- 77.5k
36
votes
9
answers
5k
views
Make 1s using a bunch of 1s
Your task is to form an expression equaling \$ 11111111111 \text{ (11 ones)} \$ using only the following characters: 1+(). Keep in mind that the result is in base ...
- 22.7k