Files
ioccc/1993/dgibson
Landon Curt Noll d414b6d71f add quick-readme2index.sh, improve all-run.sh and readme2index.sh
Improved `all-run.sh` and `readme2index.sh` so that
certain command line options (e.g., -p, -P, -u, -U ...)
are only passed along to other tools if they are
given on the command line.

all-run.sh VERSION changed from "1.1.1 2024-01-19"
to "1.1.2 2024-01-20",

readme2index.sh VERSION changed from "1.1 2024-01-16"
to "1.1.1 2024-01-20".

Added `quick-readme2index.sh` that only calls
`readme2index.sh` if the `index.html` is not
a non-empty file, or of either `.winner.json`
and/or `README.md` is newer than `index.html`.

Updated all `index.html` files because the
the file contains a comment that includes
the newly modified readme2index.sh VERSION.
2024-01-21 00:21:40 -08:00
..
2023-02-24 17:02:49 -08:00
2023-07-06 21:49:38 -07:00
2024-01-14 10:34:44 -08:00
2023-12-26 09:00:03 -08:00
2024-01-15 04:29:39 -08:00
2024-01-14 10:34:44 -08:00

To build:

make all

To use:

./dgibson.sh [datafile]

where:

datafile is the initial pattern (default: dgibson.data1)

Try:

./try.sh

Judges' remarks:

We have provided the shell script dgibson.sh to make it easier to run this entry. Run this shell script several times to see what happens.

There are a number of data files available:

For dgibson.data5 you will need a large screen, lots of virtual memory and lots of time! The try.sh script will run dgibson.sh on all the data files.

Good luck trying to use a debugger on this entry! Life is not always pretty.

Author's remarks:

This program plays the Game of Life.

Life is a cellular automaton invented by J. H. Conway, in which each of a rectangular grid of cells can be alive or dead, and cells with more than 3 or less than 2 (out of 8) live neighbours die, and empty cells with exactly 3 neighbours give birth.

Some notes

  • the "STAT n" information does not have to be present in the initial configuration
  • the initial configuration should not have live cells around the edges
  • the grid should be a perfect rectangle.

Further features: the current generation number is preserved, and the grid automatically resizes itself as the object gets too big or too small.

When writing this program, my goal was to make each cell in the life grid expand to the code which calculates the fate of that cell. In addition, the resulting program is a single expression, which makes it necessary to recurse main() in two "directions" simultaneously.

This file is Copyright (c) 2023 by Landon Curt Noll. All Rights Reserved. You are free to share and adapt this file under the terms of this license:

Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0)

For more information, see: https://creativecommons.org/licenses/by-sa/4.0/