Anonymous user
Talk:Forest fire: Difference between revisions
m
→task description: added a comment.
(→what to call it: Don't fret about it too much) |
m (→task description: added a comment.) |
||
| (3 intermediate revisions by 3 users not shown) | |||
Line 19:
:CA is actually the most accurate (there's a lot of mathematical BS written about CAs, but they're quite interesting in their own terms). In particular, this is actually a non-deterministic CA. It's also a simulation. We can categorize both ways; this is just categorization, not a class hierarchy! (Except it is an ''ontological'' hierarchy; that's a rather more sophisticated thing though, and objects can be instances of many classes in ontological terms.) –[[User:Dkf|Donal Fellows]] 10:58, 5 April 2012 (UTC)
==task description==
Concerning the task's first rule (1):
* A burning cells turns into an empty cell.
... But how long does it burn? Everybody has assumed "one iteration" (or life).
<br>The same thing with rule (4), it appears that the tree fills the space (grows to maturity) in one iteration. -- [[User:Gerard Schildberger|Gerard Schildberger]] 20:39, 20 April 2012 (UTC)
:Don't worry about the physics of it. Just sub in lifeless letters. For rule 1 just think of it as saying "a B cell turns into an E cell" and for rule for think of it as "an E cell turns into a T cell with probability p". --[[User:Mwn3d|Mwn3d]] 15:18, 21 April 2012 (UTC)
:Usually, rules in cellular automata specify what happens at the next step, so it's safe to assume it's for just 1 iteration. --[[User:Silverweed|Silverweed]] ([[User talk:Silverweed|talk]]) 14:15, 10 October 2014 (UTC)
== forest saying ==
May the forest be with you. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 13:43, 30 November 2019 (UTC)
| |||