-
Compiled C code to IR in https://github.com/logan-j/Cellular-Automata/tree/master
Then run instrument from currenct version of LLFI, it gives:
---
terminate called after throwing an instance of 'st…
-
All tiles are considered "reachable" by the Dijkstra Map.
This results in orphan areas not being culled, and the possibility that completing a map might be impossible due to the exit stairs spawnin…
-
It Starts with The Cell.
-
Hi,
1. Doug Dug is no longer working on Android for me since a few days ago. It starts with the game visible but then crashes a moment later. Could this be due to Google Play integration not handli…
-
C. Wetterich
> A class of fermionic quantum field theories with interactions can be described equivalently as probabilistic cellular automata, namely cellular automata with a probability distributi…
-
I am creating cellular automata landslide model. I am passing each displacement topography per time step from cellular automata. Is there detailed documentation for the usage of mx*my*mt headers for p…
-
I've got a few ideas for elements that I stole from other sites or cellular automata.
When we decide to implement a new element, create a separate issue for it so we can keep track of what we've done…
-
I'm going to continue writing the README adding basic info on Cellular Automata. Please add details about your own areas of expertise to the README and commit any changes directly to the main branch, …
-
This deals with issue #23.
After the cellular automata algorithms have run, seldom do they generate usable mazes.
What we should do is determine connected components (using disjoint sets?), and …
-
A sequel to/extension of [Emic Automata](https://github.com/NaNoGenMo/2017/issues/123), this time with sentences and paragraphs generated by the cellular automata, rather than wall-of-text patterns.
…
maetl updated
6 years ago