![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png){kind=small}
Rules:
1. A game started on a valid QR code. Big blocks are ignored and treated as empty (or full? or skip-passthrough?) neighbors.
2. Field is wrapped (e.g. left-most and right-most cells are interacting like they are neighbors).
3. For each cell, only a changes, producing a valid QR code are permitted.
4. From all possible QR valid changes, the change are selected in accordance with Life rules.
5. If cell can not select a life-rules obeying action it stays as it is but goes into 'violation pool'.
6. If there is a very little global changes in QR code, violation pool is randomized (but keep QR rules).
Complications: it may be impossible to calculate allowed moves locally. Or globally. Is it a good CS problem?
1. A game started on a valid QR code. Big blocks are ignored and treated as empty (or full? or skip-passthrough?) neighbors.
2. Field is wrapped (e.g. left-most and right-most cells are interacting like they are neighbors).
3. For each cell, only a changes, producing a valid QR code are permitted.
4. From all possible QR valid changes, the change are selected in accordance with Life rules.
5. If cell can not select a life-rules obeying action it stays as it is but goes into 'violation pool'.
6. If there is a very little global changes in QR code, violation pool is randomized (but keep QR rules).
Complications: it may be impossible to calculate allowed moves locally. Or globally. Is it a good CS problem?
