> I don't get it. That's a nice compression for the average and best cases,
> but the kernel and algorithm have to be able to handle the worst case.
> What if a large-scale stable situation develops - all stable patterns (2x2
> blocks, 6-cell ovals, etc, 3-in-a-row alternators, etc) separated by empty
> gaps 2-4 cells wide?
Then my proposed implementation could not handle it. This is a limitation I
was aware of, and am prepared to put up with. It won't be perfect - but
will be good enough for most cases. I doubt, under most circumstances, it
would ever be noticed.
A
--
_ _ _| _ _ _| _ * _ _ ,
(_|| )(_|( (/_\/\/ (_|(_|\/(_(/_ ,~' L_|\
,-' \
see my Museum of Soviet Calculators at ( \
http://www.taswegian.com/MOSCOW/soviet.html \ __ /
L,~' "\__/
@--> v
-
Archives (includes files) at http://www.biglist.com/lists/stella/archives/
Unsub & more at http://www.biglist.com/lists/stella/
