X-Git-Url: https://git.xandkar.net/?p=cellular-automata.git;a=blobdiff_plain;f=README.md;h=2eeb385b57a51a1bafe54de52e538b2cfd8e8382;hp=bc3036059f55f9101f3a3e52421c4611b51788a5;hb=HEAD;hpb=c3a63cc70eb518a7ccd617ce83151fc32faa52de

diff --git a/README.md b/README.md
index bc30360..2eeb385 100644
--- a/README.md
+++ b/README.md
@@ -1,34 +1,19 @@
-Games of Life
-=============
+Cellular Automata
+=================
 
-
-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
-(eventually) have its own README file, documenting the approach taken.
+I started-out wanting to try Conway's Game of Life, then got hooked and decided
+to play with other automata rules as well.
 
 
 Summary
 -------
-* __ID:__ 001,
-  __Language:__ Erlang,
-  __Approach:__ Board as 1D list. Cells as [gen_server] processes
-* __ID:__ 002,
-  __Language:__ OCaml,
-  __Approach:__ Board as matrix via functional arrays (sort-of...)
-* __ID:__ 003,
-  __Language:__ Erlang,
-  __Approach:__ Board as matrix via [array()]
-* __ID:__ 004,
-  __Language:__ AWK,
-  __Approach:__ Board as 1D string. Ghosts beyond boundaries
-* __ID:__ 005,
-  __Language:__ AWK,
-  __Approach:__ Board as simulated 3D array
+| Automaton      | Description |
+|----------------|-------------|
+| [Life]         | http://en.wikipedia.org/wiki/Conway's_Game_of_Life |
+| [Forest Fire]  | http://en.wikipedia.org/wiki/Forest-fire_model |
+| [Polymorphism] | Coexistence of different transition rules on the same grid |
 
 
-[array()]: http://www.erlang.org/doc/man/array.html "Which is not actually an array, but an integer-keyed tree."
-[gen_server]: http://www.erlang.org/doc/man/gen_server.html
+[Life]: life
+[Forest Fire]: forest-fire
+[Polymorphism]: polymorphism