Connection
Base URL, credentials and a reachable server.
Product
Product features · Elementary cellular ring steps
01
Review a whole generation in RuleFennec, keeping each rule lookup tied to the previous ring of cells.
Selection
A model available through the configured endpoint.
Capabilities
Context limits and tool support are determined by the model and server.
Elementary cellular ring steps
● ● ●RuleFennec●
A concrete starting point · Elementary cellular ring steps ×
def cellular_step(bits, rule):
bits = tuple(bits)
if not 1 <= len(bits) <= 256 or any(type(v) is not int or v not in (0, 1) for v in bits):
raise ValueError("cells.binary")
if type(rule) is not int or not 0 <= rule <= 255:
raise ValueError("rule.byte")
n = len(bits)
return [(rule >> (4 * bits[(i - 1) % n] + 2 * bits[i] + bits[(i + 1) % n])) & 1 for i in range(n)]✳Compute one synchronous step of an elementary cellular automaton on a ring of one through 256 binary cells.
✓ ChangesReview before applying ↗
Illustrative workspace