Cyclic Cellular Automaton variants

Подписаться 770

50% 1

//// Cyclic Cellular Automaton variants
A cyclic cellular automaton is an automaton in which the cells take one of N states and a cell in state i changes to state i+1 (modulo N) at the next generation if it has at least one neighbor that is in state i+1 (modulo N), otherwise it remains in state i. Classically cyclic cellular automata are applied on a bidimensional grid with Von Neumann neighborhoods (nearest 4 neighbors). In the video I explore other random neighborhoods.
You can find more information and also download the Processing code used to generate this video at: www.algoritmar...
The minimalistic soundscape of the video is made by a simple generative patch in VCV Rack.

Опубликовано:

25 сен 2024

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 3

@purple7788 2 года назад

intresting

@rosiefay7283 4 месяца назад

Thank you for exploring the world of cyclic cellular automata. It's great that you did this. But I find the ones you show us here rather boring. They have so many states, it takes a long while for cells to copy their neighbours' states in such numbers that you can see monochrome blocks. And then there's not a lot for them to do except form spirals with straight edges.

@Algoritmarte 4 месяца назад

This is what we get with standard Cyclic CAs... :-) Have you checked the latest videos in which I slightly modified the rules to get more "interesting" results?