X-Git-Url: https://git.xandkar.net/?a=blobdiff_plain;f=README.md;h=22697f1fdf3b72a84307e0780f05af36380955aa;hb=917c9b6f1878c44e497d0e8dafc16920ffd8dcaf;hp=652105d8c04e460ce7c685fa1a1ae1224c590420;hpb=005a54940e35f8b764d9286f72c8418f6ccfe537;p=cellular-automata.git

diff --git a/README.md b/README.md
index 652105d..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
@@ -22,6 +22,9 @@ Summary
 * __ID:__ 003,
   __Language:__ Erlang,
   __Approach:__ Traditional matrix as nested [array()]
+* __ID:__ 004,
+  __Language:__ AWK,
+  __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."
\ No newline at end of file
+[array()]: http://www.erlang.org/doc/man/array.html "Which is not actually an array, but an integer-keyed tree."