
Using the instructions given from #CMDI, emulate a stack structure. Send all returns (from pop and peek) to #RESO. File 300 contains all possible instructions. Push instructions are represented as numbers. Note that there are always more instructions than
272 Steam results · Checked
From Wikipedia: The *Tower of Hanoi* consists of three rods and a number of disks of different diameters, which can slide onto any rod. The puzzle starts with the disks stacked on one rod in order of decreasing size, the smallest at the top, thus approxima
Name ingame is "Shifrovaniye faylov" Use the contents of file 500 in the inbox to create a new file where all keywords are reversed, in reverse order. Then delete file 500. Manipulation contains 4 registers: #CON1 and #CON2 concatenates (combines) two keyw
Retrieve each customer's order (file 200) from their house host, then create files containing all ingredients required. Recipes are in the form of FOOD = INGREDIENT 1 + INGREDIENT 2. Don't deliver the food, deliver the ingredients. A list of recipes (in th
Create a file in the TZ-FTP host with the amount of times the keyword TZIP comes up in all archive files. Note that you don't get a file containing the keyword TZIP, you must find it on your own. The NT-Data file contains number data in this order: A, Z, N
Yo dawg I heard you like EXAPUNKS so I put EXAPUNKS in your EXAPUNKS so you can code while you code. Create an EXA interpreter that will execute a script containing a subset of the instructions (DROP, GRAB, LINK, SEEK, COPY) and registers (X, F). A solutio
Create a fast parallel sorting algorithm.
A little puzzle made to get back into the swing of things. I'm working on a competition for some friends of mine; I think I will have them optimize this for cycles under a time limit.
A Lindenmayer System, or L-System, is a formal grammar comprised of a set of rules, e.g. "A -> AB" and an axiom (starting string). In each step, we take our string and for each character, replace it according to the rules. e.g. Rules: (A -> AB), (B -> A).
Langton's Ants can be described as rulesets. Instead of switching between two colours, we cycle between them. The basic ant is denoted as "LR": for colour 1, turn left; for colour 2, turn right. Simulate Langton's Ant as before, but with the following rand
Langton's Ant is a simulation with a simple set of rules. An "ant" is placed at the center of a 9x9 grid. At each step: -If the ant is at a black square, it turns 90° clockwise, and moves forward once -If the ant is at a white square, it turns 90° counter-