Timeline for Implementing the Biham–Middleton–Levine traffic model as CellularAutomaton
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 4, 2016 at 4:33 | vote | accept | HJensen | ||
| Oct 3, 2016 at 20:25 | answer | added | C. E.♦ | timeline score: 11 | |
| Oct 3, 2016 at 18:49 | comment | added | HJensen | @C.E. Great! And there is an example of using the explicit replacement rules. I'll try to decode it :-) Bummer that the CA seems so much slower. | |
| Oct 3, 2016 at 18:42 | comment | added | C. E.♦ |
QA 39863 compares CellularAutomaton to a few other implementations of a simple CA. QA 42135 deals with optimizations of Conway's Game of Life (I don't know if it's applicable to your case.)
|
|
| Oct 3, 2016 at 12:25 | history | tweeted | twitter.com/StackMma/status/782919576388526081 | ||
| Oct 3, 2016 at 10:26 | history | edited | HJensen | CC BY-SA 3.0 |
Removed redundant `If[]`, expanded comments
|
| Oct 3, 2016 at 10:02 | history | edited | J. M.'s missing motivation♦ |
edited tags
|
|
| Oct 3, 2016 at 9:56 | history | asked | HJensen | CC BY-SA 3.0 |