From: notsaying@nospicedham.invalid.org   
      
   On Mon, 13 Apr 2020 14:06:21 GMT, Terje Mathisen   
    wrote:   
      
   > Steve wrote:   
   >> Hi,   
   >>   
   >> "Kerr-Mudd,John"  writes:   
   >>> John Horton Conway left us 2 days ago;   
      
   >>> I've been looking at this tiny life implementation in asm:   
   >>   
   >>     Wow.  That will take some time to figure out.   
   >   
   > Indeed. A quick read totally failed to show me how it works. :-)   
   >   
      
   It stores the life state(s) in an array at 0x9000. this uses bit 0 for   
   current life and bit 5 for new life.   
   After setting things up with a "random" pattern, the main loop passes   
   through all points in the array, then checks for a key to end.   
   The secondary loop is per pixel and gathers the total for the 9 [current   
   & surrounding] cells into cl. The "stc; rcr al,cl; and al,0x20" cunningly   
   sets the new life value in bit 5, clearing the other bits. This bit is   
   moved from newlife to currlife in the already processed part; avoiding   
   any overlap.   
      
      
      
      
   --   
   Bah, and indeed, Humbug.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)