An assembly implementation of Conway's Game of Life, using the NASM assembler and targeting Linux x86-64.
Screenshot from a Fedora workstation terminal. Have a close look and you'll be able to spot some gliders!
To compile and run this project, you will need:
- the NASM assembler
- the GNU linker
- a Linux x64 operating system
The program can easily be modified to accommodate other operating system or assembler requirements.
The initial cell pattern is generated using ideas from Middle Square Weyl Sequence RNG, published by Bernard Widynski on 4th April 2017.
The implementation relies on a finite grid, all cells outside the grid boundaries are considered as dead.
Simply use the following commands in a terminal:
git clone https://github.com/PyvesB/ASM-GameOfLife.git
cd ASM-GameOfLife
make
./life
The following pages may be of interest:
Want to make ASM-GameOfLife better, faster, stronger? Contributions are more than welcome, open a pull request and share your code! Simply fork the repository by clicking on the icon on the top right of this page and you're ready to go!
Thought of a cool idea? Found a problem or need some help? Simply open an issue!
Find the project useful, fun or interesting? Star the repository by clicking on the icon on the top right of this page!
GNU General Public License v3.0