agon-life

KO | EN

gitlite — search

#javascript #python #react #ai #nodejs #windows #cli #kubernetes #awesome-list #vue #pytorch #security #ios #open-source

(★ 10)

Conway's Game of Life for the Agon Light

agon-life 최신버젼 다운로드

최종 버전 다운로드 (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Game of Life

Conway's Game of Life for the Agon Light

https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life

---

Based on the Amstrad CPC version written by Brian Chiha -- Mar 2021 
https://github.com/bchiha/Ready-Z80/blob/main/03-Game_of_life/game_of_life.z80

Also, got inspiration from: 
Conway's game of life by Joe Helmick (c)2019 
https://gitlab.com/joe_helmick/life-rom

Uses a CMWC (Complimentary-Multiply-With-Carry) random number generator based on:
https://worldofspectrum.org/forums/discussion/39632/cmwc-random-number-generator-for-z80

Game of Life is a cellular automation simulation.  Each cell evolves based on the number
 of cells that surround it, it's neighborhood.  
 
 The well known Conway's Game of Life cell rules are:

* Any live cell with two or three live neighbours survives.
    * Any dead cell with three live neighbours becomes a live cell.
    * All other live cells die in the next generation. Similarly, all other dead cells stay dead.

These rules can be written in a form, S/B. Where S is the count of surrounding neighbors necessary for a cell to survive, and B is the count of alive neighbors necessary for a cell to be born. Using this notation Conway's Life rule is 23/3. Each digit on each side of slash are evaluated seperately. So, 23 means 2 or 3, not twenty three. Values are a combination of digits 0-8, with a max of 9 digits.

There are a number of other rulesets that define other members of the "Life" family of cellular automata. See http://www.mirekw.com/ca/rullex_life.html for examples.

Calcuation for next cells are done from memory starting at _MATRIX_START.  Current Base (CURRBASE) is what is displayed on the screen, Next Base (NEXTBASE) is used to set the next life cycle. Once all cells are checked Next Base will be copied to Current Base and displayed.

To work out top/bottom cells, a zero row is placed above and below the 1000 cell table. To handle left/right cells, one zero column is placed on the left.  And for the bottom right cell this is one extra byte.

The matrix starts out with a random set of living cells. Each new generation is evaluated until you press the Escape key to exit.

A ruleset is selected by typing the LOWER case letter of the ruleset on the start up menu. Selecting 0 (zero) will exit the program without selecting a ruleset.

##### Life Family Cellular Automata 
A. Conway's Life - Chaotic - 23/3 
B. 2x2 - Chaotic - 125/36 	
C. 34 Life - Exploding - 34/34 	
D. Amoeba - Chaotic - 1358/357 	
E. Assimilation - Stable - 4567/345 	
F. Coagulations - Exploding - 235678/378 
G. Coral - Exploding - 45678/3 	
H. Day & Night - Stable - 34678/3678 
I. Diamoeba - Chaotic - 5678/35678 
J. Flakes - Expanding - 012345678/3 
K. Gnarl - Exploding - 1/1 
L. HighLife - Chaotic - 23/36 
M. Long Life - Stable - 5/345 
N. Maze - Exploding - 12345/3 
O. Mazectric - Exploding - 1234/3 
P. Move - Stable - 245/368 
Q. Pseudo Life - Chaotic - 238/357 
R. Replicator - Exploding - 1357/1357 
S. Stains - Stable - 235678/3678 
T. WalledCities - Stable - 2345/45678

```
 Memory Map With Upper/Lower/Left/Right buffer.
 X = potential cell position, 0 = always zero

0 0 0 0 0 0 0 0 0 0 
 0 1 2 3 4 5 6 7 8 9 
 
00 0 0 0 0 0 0 0 0 0 0 
01 0 X X X X X X X X X 
02 0 X X X X X X X X X 
03 0 X X X X X X X X X 
04 0 X X X X X X X X X 
05 0 X X X X X X X X X 
06 0 X X X X X X X X X 
07 0 X X X X X X X X X 
08 0 X X X X X X X X X 
09 0 X X X X X X X X X 
0A 0 <= needed for last bottom right check
```

Requires: 
MOS 1.03 
VDP 1.03

(Tested successfully with MOS 1.04, and VDP 1.04, as well as Console8 2.1.0  MOS and VDP)

# <<< Road Map >>>

* ~~Custom icon/image for 'live' cells~~
* ~~Make matrix 'infinite', full wrap-around in all directions~~ (Not doing)
* ~~Plot matrix properly, rather than clear screen, print row by row~~
* ~~Generation counter~~
* ~~Full run, with keyboard scan. Run until stopped, rather than one generation per keystroke~~
* ~~Need a more 'random' random number generator~~
* Allow user to select Cellular Automata Ruleset to run other variations of Life
* Graphical plotting ~~or use buffered modes
* User selected screen mode
* User defined ruleset

agon-life

agon-life 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

agon-life

agon-life 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Download README