Create a fast parallel sorting algorithm.
272 Steam results · Checked
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-
Help Hydroponix in getting confidential emails about some secret projects of the Government. Enter the ultra-secured email system and route all emails received on NODE-IN to NODE-A or NODE-B depending on the address in their TO: field. Note that NODE-C and
A basic challenge meant to demonstrate how one EXA can hold multiple timers in the same register, with some limitations. Hint: try using SWIZ or MODI Author's scores: * 334 cycles, 37 size, 1 activity * 534 cycles, 13 size, 1 activity Let me know if you co
This is more of me trying out this shiny new system. Do feel free to optimize this level if you feel like it.