Re: [Jprogramming] A one-dimensional cellular automaton

2011-12-15 Thread Jose Mario Quintana
__ From: programming-boun...@jsoftware.com [programming-boun...@jsoftware.com] On Behalf Of Marshall Lochbaum [mwlochb...@gmail.com] Sent: Thursday, December 15, 2011 7:32 AM To: Programming forum Subject: Re: [Jprogramming] A one-dimensional cellular automaton Rule 30 (i.e. rep

Re: [Jprogramming] A one-dimensional cellular automaton

2011-12-15 Thread Marshall Lochbaum
Rule 30 (i.e. replace (1 3 5 6 e.~) with ((8{.|.#:30) {~)) generally looks the best, because it's chaotic. Rule 110 (same, but with 110) is interesting because it's Turing complete. Marshall On Thu, Dec 15, 2011 at 7:00 AM, Zsbán Ambrus wrote: > The following code runs a one-dimensional cellula

[Jprogramming] A one-dimensional cellular automaton

2011-12-15 Thread Zsbán Ambrus
The following code runs a one-dimensional cellular automaton. Code runs until interrupted. You can change the definitions in the first two lines to set the scrolling speed of the simulation and the number of cells to be simulated (which should be less than the width of your terminal so that lines