Genuary 2023.05: Debug view

2023-02-05

Genuary! Spend a month making one beautiful thing per day, given a bunch of prompts. A month late, but as they say, ’the second best time is now'. Let’s do it! 5) Debug view I like Boids. Here are some Boids with debug vectors drawn showing the three forces acting on them (red to stay away from one another, green to move in the same direction as their friends, blue to move towards the center of their friends).

AoC 2022 Day 23: Elf Scattinator

2022-12-23

Source: Unstable Diffusion

Part 1

Implement a cellular automaton with the following rules:

If you have no neighbors, don’t move (important, I forgot this one for a while)
Otherwise:
- Calculate a potential move:
  - If you have no neighbors to the north, move north
  - If not, check likewise for south, then west, than east
- If no other agent is moving to the same space, move to your potential move
- Otherwise, don’t move
On each frame, rotate the order the directions are checked in (NSWE, SWEN, WENS, ENSW, NSWE, …)

AoC 2022 Day 14: Sandinator

2022-12-14

Source: Regolith Reservoir

Part 1

Given a series of walls as input, run a falling sand simulation until any new sand falls of the map. Count how many grains of sand we end up with.

AoC 2022 Day 10: Interpretator

2022-12-10

Source: Cathode-Ray Tube

Part 1

Implement a simple virtual machine with two instructions: nop which does nothing for 1 cycles and addx $n which adds $n to the X register (initial value 1) in two cycles. Calculate the sum of cycle * X for the cycles 20, 60, 100, 140, 180, 220.

AoC 2022 Day 9: Ropeinator

2022-12-09

Source: Rope Bridge

Part 1

Simulate two connected links such that whenever the first link (head) moves, the tail moves to follow according to the following rules:

If the tail is at the same location as head, don’t move
If the tail is adjacent to the head (orthogonal or diagonal), don’t move
If the tail is in the same row/column as the head, move one directly towards it orthogonally
If the tail is in neither the same row nor column, move one towards diagonally

Count how many unique spaces are visited by the tail of the link.

AoC 2021 Day 25: Cucumbinator

2021-12-25

Source: Sea Cucumber

Part 1: Load a grid of empty cells (`.`), east movers (`>`), and south movers (`v`). Each step, move all east movers than all south movers (only if they can this iteration). Wrap east/west and north/south. How many steps does it take the movers to get stuck?

AoC 2021 Day 20: Enhancinator

2021-12-20

Source: Trench Map

Part 1: Given a 9->1 cellular automota update function (take the pixel and 8 surrounding pixels as a 9-bit index into the function) and a binary image, apply the function twice and count the number of ’lit’ pixels. Assume that the canvas is infinite.

AoC 2021 Day 11: Octopus Flashinator

2021-12-11

Source: Dumbo Octopus

Part 1: Simulate a grid of numbers such that on each tick: advance all numbers by 1, any number that increases over 9 will ‘flash’ and add 1 to all neighbors (recursively, but each cell can only flash once) and then reset to 0. Count the number of flashes in the first 100 ticks.

AoC 2021 Day 6: We All Glow Down Here

2021-12-06

Source: Latternfish

Part 1: Simulate a population of lanternfish. Each fish is immortal, starts having children after 9 days, and has another child after 7 more days. Calculate the number of fish after 80 days.

Neural Network Cellular Automata

2021-09-06

Okay. A random post on the /r/cellular_automata subreddit inspired me.

Let’s generate a cellular automata where each pixel updates based on a neural network given as input:

The x/y coordinates (scaled to the range 0-1)
An optional random value (to make it more dynamic)
A variety of neighboring data, such as:
- The number of neighbors that are ‘active’ (> 50% white), ranges 0-8 scaled to 0-1. This should allow Conway's Game of Life
- The RGB values of all neighbors (allows a superset of the above)
- Gradients, subtract color value of the left from the right so that you get edges and side to side movement

Let’s do it!

Source: Unstable Diffusion

Part 1

Source: Regolith Reservoir

Part 1

Source: Cathode-Ray Tube

Part 1

Source: Rope Bridge

Part 1

Source: Sea Cucumber

Part 1: Load a grid of empty cells (.), east movers (>), and south movers (v). Each step, move all east movers than all south movers (only if they can this iteration). Wrap east/west and north/south. How many steps does it take the movers to get stuck?

Source: Trench Map

Part 1: Given a 9->1 cellular automota update function (take the pixel and 8 surrounding pixels as a 9-bit index into the function) and a binary image, apply the function twice and count the number of ’lit’ pixels. Assume that the canvas is infinite.

Source: Dumbo Octopus

Part 1: Simulate a grid of numbers such that on each tick: advance all numbers by 1, any number that increases over 9 will ‘flash’ and add 1 to all neighbors (recursively, but each cell can only flash once) and then reset to 0. Count the number of flashes in the first 100 ticks.

Source: Latternfish

Part 1: Simulate a population of lanternfish. Each fish is immortal, starts having children after 9 days, and has another child after 7 more days. Calculate the number of fish after 80 days.

Part 1: Load a grid of empty cells (`.`), east movers (`>`), and south movers (`v`). Each step, move all east movers than all south movers (only if they can this iteration). Wrap east/west and north/south. How many steps does it take the movers to get stuck?