brmlab/ledbar
4
0
Fork 0
mirror of https://github.com/brmlab/ledbar.git synced 2025-06-09 21:34:00 +02:00
Code Issues Projects Releases Packages Wiki Activity

cellular.py: Implement totalistic celluar automata.

Browse source
This commit is contained in:
Sanky 2012-10-30 15:23:19 +01:00
parent b09031acaf
commit 6165044591
1 changed files with 25 additions and 8 deletions
Download patch file Download diff file Expand all files Collapse all files

33
host_python/cellular.py
View file

@ -1,6 +1,6 @@
#!/usr/bin/python
"""
An elementary 2D celluar autonoma implementation for the ledbar in brmlab.
An elementary 2D celluar 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
@ -14,8 +14,15 @@ but sure more colorful.
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 celluar 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 dictionaries 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.
Also, implement grayscare totalistic autonoma.
"""
@ -26,8 +33,11 @@ from ledbar import Ledbar
PIXELS = 20
PIXEL_MODE = ('bw', 'color')[0]
START = ('single', 'random')[0]
RULE = 30
START = ('single', 'random')[1]
TOTALISTIC = True
#RULE = 30
RULE = {(lambda t: True): (lambda t: (t+0.9) % 1)}
SLEEP = 25
WIDTH = PIXELS
if PIXEL_MODE == 'color': WIDTH *= 3
@ -36,13 +46,15 @@ def bits(num, align=8):
for i in range(align)[::-1]:
yield bool(num & (1 << i))
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)))
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)))
iteration = [0]*WIDTH
if START == 'single':
iteration[WIDTH//2] = 1
elif START == 'random':
iteration = list(random.randint(0, 1) for i in iteration)
iteration = list((random.randint(0, 1) if not TOTALISTIC else random.random()) for i in iteration)
def iterate(iteration):
new = []
@ -51,7 +63,12 @@ def iterate(iteration):
for i in xrange(len(iteration)):
if 0 < i < len(iteration)-1:
top = (iteration[i-1], iteration[i], iteration[i+1])
new.append(rules[top])
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)
return new
@ -72,5 +89,5 @@ while work:
l.set_pixel(i, c[0], c[1], c[2])
work = l.update()
t += 1
if not (t % 50):
if not (t % SLEEP):
iteration = iterate(iteration)