optimizing conway's 'game life'


to experiment, i've (long ago) implemented conway's (and i'm wakeful associated question!).



my doing worked retaining 2 arrays booleans, representing 'last state', 'state being updated' (the 2 arrays being replaced during any iteration). while graceful fast, i've mostly wondered optimize this.



one idea, example, precompute during iteration n zones could run-down during iteration (n+1) (so cave does go such zone, won't even deliberate alteration during iteration (n+1)). i'm wakeful unequivocally vague, i never took details...



do have any ideas (or experience!) optimizing (for speed) diversion life iterations?



Comments

Popular posts from this blog

list macos calm editors formula editors

how hibernate @any-related annotations?

why does floated <input> control floated component slip over too distant right ie7, nonetheless firefox?