| Re: Random number generation using a 256-state cellular automaton |
|
 |
|
 |
|
 |
|
 |
Author: Vend Date: Jan 26, 2007 01:50
>> More generally,
>> if (cell_a == first_cell) {
>> *cell_a = rule[*cell_a];
>> implies the low byte of 2056*i+2055 will be walking through your rule[]
>> table. That always has a cycle length of 169, or 27, or 4 or 3 or 2 or
>> 1, depending on your seed.
Tony, it's not a matter of seeding I think.
If you apply a permutation on a value, and then keep applying the same
permutation on the results, you'll eventually get back the original
value. As Bob pointed out, that's what your are doing in your algorithm
with the first cell.
Perhaps it would be better to make the cell list cyclic, that is, to
add the value of the last cell to the first cell.
| 
