mirror of
https://github.com/brmlab/ledbar.git
synced 2025-06-09 13:24:01 +02:00
109 lines
3.5 KiB
Python
Executable file
109 lines
3.5 KiB
Python
Executable file
#!/usr/bin/python
|
|
"""
|
|
An elementary 2D cellular automata implementation for the ledbar in brmlab.
|
|
For some fun rules, try:
|
|
30: near-random behavior
|
|
22: gives a symmetric triangle pattern. It just looks like splitting cells and gets
|
|
empty quickly, though.
|
|
142: neat waves
|
|
73: provides a downwards pattern with some fixed columns.
|
|
51: likes to blink.
|
|
|
|
The color mode encodes individual bits into, well, colors. Not too exciting,
|
|
but sure more colorful. The individual color mode generates a separate
|
|
iteration plane for each color, which works the best with a random starting
|
|
state.
|
|
You can choose between a single pixel or a random starting row.
|
|
|
|
By setting TOTALISTIC to True and adding proper rules, you get continuous
|
|
totalistic 1D cellular automata. The basic rule mostly just fades out and
|
|
in again: it looks like triangles on a plane. But tell me if you find some
|
|
more interesting rule!
|
|
The RULE format for totalistic automta is a dictionary of functions which get
|
|
passed the sum of the above three pixels. The keys are conditions, if one
|
|
returns true, the value is executed. (Thus they shouldn't overlap.)
|
|
|
|
Possible fun stuff: Automatically pick new rules, detect patterns and restart.
|
|
"""
|
|
|
|
|
|
import sys
|
|
import random
|
|
|
|
from ledbar import Ledbar
|
|
|
|
PIXELS = 20
|
|
PIXEL_MODE = ('bw', 'color', 'individual_color')[2]
|
|
START = ('single', 'random')[1]
|
|
TOTALISTIC = True
|
|
#RULE = 30
|
|
RULE = {(lambda t: True): (lambda t: (t+0.98) % 1)}
|
|
#RULE = {(lambda t: t > 5): (lambda t: (t+-0.6) % 1), (lambda t: t <= 5): (lambda t: (t+0.9) % 1)}
|
|
SLEEP = 10
|
|
|
|
WIDTH = PIXELS
|
|
if PIXEL_MODE == 'color': WIDTH *= 3
|
|
|
|
def bits(num, align=8):
|
|
for i in range(align)[::-1]:
|
|
yield bool(num & (1 << i))
|
|
|
|
if not TOTALISTIC:
|
|
rules = dict(zip(((1,1,1), (1,1,0), (1,0,1), (1,0,0), (0,1,1), (0,1,0), (0,0,1), (0,0,0)), bits(RULE)))
|
|
|
|
|
|
iterations = []
|
|
iterations.append([0]*WIDTH)
|
|
if PIXEL_MODE == 'individual_color':
|
|
iterations.append([0]*WIDTH)
|
|
iterations.append([0]*WIDTH)
|
|
|
|
if START == 'single':
|
|
for it in iterations:
|
|
it[WIDTH//2] = 1
|
|
elif START == 'random':
|
|
for j, it in enumerate(iterations):
|
|
iterations[j] = list((random.randint(0, 1) if not TOTALISTIC else random.random()) for i in it)
|
|
|
|
|
|
def iterate(iterations):
|
|
for j, iteration in enumerate(iterations):
|
|
new = []
|
|
iteration.insert(0, 0)
|
|
iteration.append(0)
|
|
for i in xrange(len(iteration)):
|
|
if 0 < i < len(iteration)-1:
|
|
top = (iteration[i-1], iteration[i], iteration[i+1])
|
|
if not TOTALISTIC:
|
|
new.append(rules[top])
|
|
else:
|
|
for rule, func in RULE.items():
|
|
if rule(sum(top)/3):
|
|
new.append(func(sum(top)/3))
|
|
else:
|
|
new.append(0)
|
|
iterations[j] = new
|
|
return iterations
|
|
|
|
def update(i):
|
|
visibles = []
|
|
for iteration in iterations:
|
|
visibles.append(iteration[(len(iteration)//2)-(WIDTH//2):(len(iteration)//2)+(WIDTH//2)])
|
|
if PIXEL_MODE == 'bw':
|
|
return (visibles[0][i], visibles[0][i], visibles[0][i])
|
|
elif PIXEL_MODE == 'color':
|
|
return (visibles[0][3*i], visibles[0][3*i+1], visibles[0][3*i+2])
|
|
elif PIXEL_MODE == 'individual_color':
|
|
return (visibles[0][i], visibles[1][i], visibles[2][i])
|
|
|
|
l = Ledbar(PIXELS)
|
|
work = True
|
|
t = 0
|
|
while work:
|
|
for i in xrange(PIXELS):
|
|
c = update(i)
|
|
l.set_pixel(i, c[0], c[1], c[2])
|
|
work = l.update()
|
|
t += 1
|
|
if not (t % SLEEP):
|
|
iterations = iterate(iterations)
|