@flawr Curious - what's your current strategy? mine is to form 2s from 1s, 6s from 2s and 3s, and play it like 2048 from there. I'm not having much luck though
Aw, just scored 773, not sure I'll do better for a while
@WheatWizard Then I suppose it wouldn't be terribly hard to use a 2D answer from the Geiger Counter question, like the ><> one and check the second line against the first (with some hardcoded checks for the necessary differences and the removal of the newline)
Lost Compass
The idea for this challenge is pretty much complete. I just want to create a few tools to help in building and debugging, before I post this.
Lost is a 2-Dimensional programming language where the instruction pointer starts at a random location, moving in a random direction. A...
This is a repost of the underspecified challenge.
Task:
Remove all duplicates from one list. A list is simply a sequence of connected values that allows the same values to be stored at different positions in this sequence. (If Quintec agrees with me, I will limit the possible values to only con...
@Quintec I try to make 6es, and then power-of-2-multiples of 6es. so 6-12-24-48 (always in the corners or at the sides if possible), but every now and then you get in a situation where you are forced to make a 4 or so, and things go downhill from there
A Diagonal Sudoku board is a special case of Latin squares. It has the following properties:
The board is a 9-by-9 matrix
Each row contains the numbers 1-9
Each column contains the numbers 1-9
Each 3-by-3 sub-region contains the numbers 1-9
Both diagonals contains the numbers 1-9
Challenge:
...
The task here is pretty simple. You should write a program that takes a string as input and outputs it (that is a cat program).
Additionally when the \$n\$th byte of your program is removed (without replacement) the augmented program should take a string as input and remove the \$n\$th characte...
it looks like they are counted. for example the +500 bounty i offered for a knotty situation is in my list but it hasn't been awarded to anyone. (later i received a separate +50 bounty for my solution)
I wonder, if you had already answered a question, and came up with an another solution with similar/identical approaches in the different language, should it be posted as another answer, a part of the existing answer, or would it be frowned upon to post altogether?
Given an integer n ≥ 3, produce a matrix with the following properties:
The matrix has dimensions n × n.
The matrix contains each integer from 1 to n² inclusive exactly once.
The matrix is singular. There are several equivalent definitions of this term:
The determinant is zero.
The matrix is ...
@KritixiLithos (belated response) Awesome! By (read) do you mean user input? I don't have any plans for that in tinylisp, no. There is basic user input in the related language Appleseed, though it's syntactically verbose and poorly documented. :P
Standard practice in tinylisp golfing, therefore, is to submit functions rather than complete programs.
Except for challenges that don't require input, as I see you've already discovered. :)
@JoKing As a bit of a proof of concept `))"!"))"E!"))@))"!W"))"!"))@` Will output the direction it started, if that direction is east or west. Transposing it will create a program that detects N/S. From here you can stitch them together like:
#X X#
Where `#` is E/W detectors and `X` is N/S detectors. Some extra work is actually needed to fix some edge cases but this *almost* works.
To clarify # is a giant block of detectors with one on each row, stacked to be high enough that every row of X has one detector on it. Likewise with X but columns instead.
Score a 1 player game of Carcassonne
Carcassonne is a tile-based game, where the objective is to construct Roads, Cities and Monasteries, in order to score points. The game works by players taking turns to draw and place tiles to construct a landscape, then claiming roads, cities and monasteries...
@WheatWizard The Lost verification could be a lot more efficient, right now it loops over every single position with every direction. Really, you only to execute once for directionals (><v^), and you only need to verify once in a consecutive run of no-ops (I think)
@WheatWizard You know, I've had a couple of thoughts about a variant of the language called Forgotten that would be a radiation-hardened version, i.e. one random character is removed at the start of execution
Are there any special hurdles that need to be solved for a language like forgotten? e.g. for lost we need safety because otherwise any program could have a chance of instantly halting.