Implement a cellular automaton with the following rules:
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.
Implement a simple virtual machine with two instructions:
nopwhich does nothing for 1 cycles and
addx $nwhich adds
Xregister (initial value 1) in two cycles. Calculate the sum of
cycle * Xfor the cycles 20, 60, 100, 140, 180, 220.
Simulate two connected links such that whenever the first link (head) moves, the tail moves to follow according to the following rules:
Count how many unique spaces are visited by the
tail of the link.
.), 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?
Let’s generate a cellular automata where each pixel updates based on a neural network given as input:
Let’s do it!