X-Git-Url: https://git.xandkar.net/?a=blobdiff_plain;f=README.md;h=652105d8c04e460ce7c685fa1a1ae1224c590420;hb=457f40707f5afbfb127f71ee3cab3643d2612b5b;hp=b30867adcea97f1765cb9b23eddd8eff496e763e;hpb=e24cd99d9afec5ba100a8389ecae8dc1b105c53a;p=cellular-automata.git

diff --git a/README.md b/README.md
index b30867a..652105d 100644
--- a/README.md
+++ b/README.md
@@ -1,4 +1,27 @@
-gols
-====
+Games of Life
+=============
 
-Games of Life
\ No newline at end of file
+
+Description
+-----------
+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.
+
+
+Summary
+-------
+* __ID:__ 001,
+  __Language:__ Erlang,
+  __Approach:__ Each cell is a gen_server process
+* __ID:__ 002,
+  __Language:__ OCaml,
+  __Approach:__ Traditional matrix
+* __ID:__ 003,
+  __Language:__ Erlang,
+  __Approach:__ Traditional matrix as nested [array()]
+
+
+[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