X-Git-Url: https://git.xandkar.net/?p=cellular-automata.git;a=blobdiff_plain;f=README.md;h=22697f1fdf3b72a84307e0780f05af36380955aa;hp=54edaa9a8c7e65d78d45d3a2ff5858acab82a6fd;hb=d9eb542632c1492d792ff893446706be2326a732;hpb=3a20c476f299ddbe993ac28b5dec75a407edf338

diff --git a/README.md b/README.md
index 54edaa9..22697f1 100644
--- a/README.md
+++ b/README.md
@@ -8,7 +8,7 @@ I want to try several different approaches to implementing Conway's Game of
 Life. It shall be recorded in this repo.
 
 Each of the implementations (living in sequentially numbered directories) shall
-have its own README file, documenting the approach taken.
+(eventually) have its own README file, documenting the approach taken.
 
 
 Summary
@@ -24,7 +24,7 @@ Summary
   __Approach:__ Traditional matrix as nested [array()]
 * __ID:__ 004,
   __Language:__ AWK,
-  __Approach:__ Board as string
+  __Approach:__ Board as string. Ghosts beyond boundaries
 
 
 [array()]: http://www.erlang.org/doc/man/array.html "Which is not actually an array, but an integer-keyed tree."