★ AMSTRAD CPC ★ GAMESLIST ★ LIFE (c) COMPUTING WITH THE AMSTRAD ★

Computing with the Amstrad
★ Ce texte vous est présenté dans sa version originale ★ 
 ★ This text is presented to you in its original version ★ 
 ★ Este texto se presenta en su versión original ★ 
 ★ Dieser Text wird in seiner Originalfassung präsentiert ★ 

LIFE is a fascinating program which simulates the growth of a colony of cells. It was invented around 1970 by John Conway of Cambridge University and is basically a pattern generating program.

Initially the screen is blank and using the program's editor you have to set up the first generation of the colony. The cursor keys move the cursor, and cells can be placed anywhere on the screen by pressing Copy and deleted by pressing Delete.

If you've never played Life before try placing a straight line of about 10 cells and press Enter on the CPC464 or Return on the CPC6128 to show you've finished. Now watch what happens.

The patterns generated are based on four simple rules:

  • A cell which has two or three neighbours will survive to the next generation.
  • A cell which has less than two neighbours will die of starvation.
  • A cell which has four or more neighbours will die from overcrowding.
  • A new cell is born in any space surrounded by three cells.

Any new cells born are plotted in yellow, while mature cells are blue. Cells that are dying of overcrowding or starvation turn red.

These rules mean you have to be careful when setting up the colony. You may find that some patterns die out very quickly, while others last for several hundred generations. It's up to you.

When the main program is running you can hold down the spacebar to pause or Enter/Return to start afresh with a new colony.

To make it more interesting there are options to tamper with the rules of Life. These generate different patterns.

The editor is a simple Basic program but Life itself is pure machine code for speed. There are almost 4,000 cell positions on the screen each with eight neighbours, so with each generation the program must scan 32,000 cell positions and redraw up to 4,000 cells. This takes about one second.

Blank positions can't be ignored since a new cell may be born if there are three neighbours.

To achieve a reasonable speed the machine code is quite complex with its own plot routines, ignoring the firmware altogether. You can use the disassembler in the November 1985 issue of Computing with the Amstrad to see how it works.

CWTA

LIFE
(c) COMPUTING WITH THE AMSTRAD

Author: Roland WADDILOVE
Design: John CONWAY of Cambridge University

★ YEAR: 1986
★ LANGUAGE:
★ GENRE: INGAME MODE 1 , BASIC
★ LiCENCE: LISTING
★ COLLECTION: COMPUTING WITH THE AMSTRAD 1986

 

★ AMSTRAD CPC ★ DOWNLOAD ★

Type-in/Listings:
» Life    (Computing  with  the  Amstrad)    ENGLISHDATE: 2020-07-25
DL: 163
TYPE: ZIP
SiZE: 6Ko
NOTE: 40 Cyls
.HFE: Χ

» Life    (Computing  with  the  Amstrad)    ENGLISH    LISTINGDATE: 2013-09-22
DL: 221
TYPE: PDF
SiZE: 459Ko
NOTE: 2 pages/PDFlib v1.6

Je participe au site:
» Vous avez des infos personnel ?
» Vous avez remarqué une erreur dans ce texte ?
» Aidez-nous à améliorer cette page : en nous contactant via le forum ou par email.

CPCrulez[Content Management System] v8.7-desktop/c
Page créée en 488 millisecondes et consultée 1215 fois

L'Amstrad CPC est une machine 8 bits à base d'un Z80 à 4MHz. Le premier de la gamme fut le CPC 464 en 1984, équipé d'un lecteur de cassettes intégré il se plaçait en concurrent  du Commodore C64 beaucoup plus compliqué à utiliser et plus cher. Ce fut un réel succès et sorti cette même années le CPC 664 équipé d'un lecteur de disquettes trois pouces intégré. Sa vie fut de courte durée puisqu'en 1985 il fut remplacé par le CPC 6128 qui était plus compact, plus soigné et surtout qui avait 128Ko de RAM au lieu de 64Ko.