mirror of
https://git.savannah.gnu.org/git/emacs.git
synced 2024-09-02 01:35:32 +00:00
344 lines
12 KiB
EmacsLisp
344 lines
12 KiB
EmacsLisp
;;; life.el --- John Horton Conway's Game of Life -*- lexical-binding:t -*-
|
|
|
|
;; Copyright (C) 1988, 2001-2024 Free Software Foundation, Inc.
|
|
|
|
;; Author: Kyle Jones <kyleuunet.uu.net>
|
|
;; Maintainer: emacs-devel@gnu.org
|
|
;; Keywords: games
|
|
|
|
;; This file is part of GNU Emacs.
|
|
|
|
;; GNU Emacs is free software: you can redistribute it and/or modify
|
|
;; it under the terms of the GNU General Public License as published by
|
|
;; the Free Software Foundation, either version 3 of the License, or
|
|
;; (at your option) any later version.
|
|
|
|
;; GNU Emacs is distributed in the hope that it will be useful,
|
|
;; but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
;; GNU General Public License for more details.
|
|
|
|
;; You should have received a copy of the GNU General Public License
|
|
;; along with GNU Emacs. If not, see <https://www.gnu.org/licenses/>.
|
|
|
|
;;; Commentary:
|
|
|
|
;; A demonstrator for John Horton Conway's "Life" cellular automaton
|
|
;; in Emacs Lisp. Picks a random one of a set of interesting Life
|
|
;; patterns and evolves it according to the familiar rules.
|
|
|
|
;;; Code:
|
|
|
|
(defgroup life nil
|
|
"Conway's Game of Life."
|
|
:group 'games)
|
|
|
|
(defcustom life-step-time 0.5
|
|
"Time to sleep between steps (generations)."
|
|
:type 'number
|
|
:version "28.1")
|
|
|
|
(defvar life-patterns
|
|
[("@@@" " @@" "@@@")
|
|
("@@@ @@@" "@@ @@ " "@@@ @@@")
|
|
("@@@ @@@" "@@ @@" "@@@ @@@")
|
|
("@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@")
|
|
("@@@@@@@@@@")
|
|
(" @@@@@@@@@@ "
|
|
" @@@@@@@@@@ "
|
|
" @@@@@@@@@@ "
|
|
"@@@@@@@@@@ "
|
|
"@@@@@@@@@@ ")
|
|
("@" "@" "@" "@" "@" "@" "@" "@" "@" "@" "@" "@" "@" "@" "@")
|
|
("@ @" "@ @" "@ @"
|
|
"@ @" "@ @" "@ @"
|
|
"@ @" "@ @" "@ @"
|
|
"@ @" "@ @" "@ @"
|
|
"@ @" "@ @" "@ @")
|
|
("@@ " " @@ " " @@ "
|
|
" @@ " " @@ " " @@ "
|
|
" @@ " " @@ " " @@ "
|
|
" @@ " " @@ " " @@ "
|
|
" @@ " " @@ " " @@ "
|
|
" @@")
|
|
("@@@@@@@@@" "@ @ @" "@ @@@@@ @" "@ @ @ @" "@@@ @@@"
|
|
"@ @ @ @" "@ @@@@@ @" "@ @ @" "@@@@@@@@@")
|
|
;; Glider Gun (infinite, Bill Gosper, 1970)
|
|
(" @ "
|
|
" @ @ "
|
|
" @@ @@ @@"
|
|
" @ @ @@ @@"
|
|
"@@ @ @ @@ "
|
|
"@@ @ @ @@ @ @ "
|
|
" @ @ @ "
|
|
" @ @ "
|
|
" @@ ")
|
|
(" @ "
|
|
" @ @@"
|
|
" @ @ "
|
|
" @ "
|
|
" @ "
|
|
"@ @ ")
|
|
("@@@ @"
|
|
"@ "
|
|
" @@"
|
|
" @@ @"
|
|
"@ @ @")
|
|
("@@@@@@@@ @@@@@ @@@ @@@@@@@ @@@@@")
|
|
;; Pentadecathlon (period 15, John Conway, 1970)
|
|
(" @ @ "
|
|
"@@ @@@@ @@"
|
|
" @ @ ")
|
|
;; Queen Bee Shuttle (period 30, Bill Gosper, 1970)
|
|
(" @ "
|
|
" @ @ "
|
|
" @ @ "
|
|
"@@ @ @ @@"
|
|
"@@ @ @ @@"
|
|
" @ @ "
|
|
" @ ")
|
|
;; 2x Figure eight (period 8, Simon Norton, 1970)
|
|
("@@@ @@@ "
|
|
"@@@ @@@ "
|
|
"@@@ @@@ "
|
|
" @@@ @@@"
|
|
" @@@ @@@"
|
|
" @@@ @@@")]
|
|
"Vector of rectangles containing some Life startup patterns.")
|
|
|
|
;; Macros are used macros for manifest constants instead of variables
|
|
;; because the compiler will convert them to constants, which should
|
|
;; eval faster than symbols.
|
|
;;
|
|
;; Don't change any of the life-* macro constants unless you thoroughly
|
|
;; understand the `life-grim-reaper' function.
|
|
|
|
(defmacro life-life-char () ?@)
|
|
(defmacro life-death-char () (1+ (life-life-char)))
|
|
(defmacro life-birth-char () 3)
|
|
(defmacro life-void-char () ?\ )
|
|
|
|
(defmacro life-life-string () (char-to-string (life-life-char)))
|
|
(defmacro life-death-string () (char-to-string (life-death-char)))
|
|
(defmacro life-birth-string () (char-to-string (life-birth-char)))
|
|
(defmacro life-void-string () (char-to-string (life-void-char)))
|
|
(defmacro life-not-void-regexp () (concat "[^" (life-void-string) "\n]"))
|
|
|
|
(defmacro life-increment (variable) (list 'setq variable (list '1+ variable)))
|
|
|
|
|
|
;; list of numbers that tell how many characters to move to get to
|
|
;; each of a cell's eight neighbors.
|
|
(defvar life-neighbor-deltas nil)
|
|
|
|
;; window display always starts here. Easier to deal with than
|
|
;; (scroll-up) and (scroll-down) when trying to center the display.
|
|
(defvar life-window-start nil)
|
|
|
|
(defvar life--max-width nil
|
|
"If non-nil, restrict width to this positive integer.")
|
|
|
|
(defvar life--max-height nil
|
|
"If non-nil, restrict height to this positive integer.")
|
|
|
|
;; For mode line
|
|
(defvar life-current-generation nil)
|
|
;; Sadly, mode-line-format won't display numbers.
|
|
(defvar life-generation-string nil)
|
|
|
|
(defun life--tick ()
|
|
"Game tick for `life'."
|
|
(let ((inhibit-quit t)
|
|
(inhibit-read-only t))
|
|
(life-grim-reaper)
|
|
(life-expand-plane-if-needed)
|
|
(life-increment-generation)))
|
|
|
|
;;;###autoload
|
|
(defun life (&optional step-time)
|
|
"Run Conway's Life simulation.
|
|
The starting pattern is randomly selected from `life-patterns'.
|
|
|
|
Prefix arg is the number of tenths of a second to sleep between
|
|
generations (the default is `life-step-time').
|
|
|
|
When called from Lisp, optional argument STEP-TIME is the time to
|
|
sleep in seconds."
|
|
(interactive "P")
|
|
(setq step-time (or (and step-time (/ (if (consp step-time)
|
|
(car step-time)
|
|
step-time) 10.0))
|
|
life-step-time))
|
|
(life-setup)
|
|
(catch 'life-exit
|
|
(while t
|
|
(life-display-generation step-time)
|
|
(life--tick))))
|
|
|
|
(define-derived-mode life-mode special-mode "Life"
|
|
"Major mode for the buffer of `life'."
|
|
(setq-local case-fold-search nil)
|
|
(setq-local truncate-lines t)
|
|
(setq-local show-trailing-whitespace nil)
|
|
(setq-local life-current-generation 0)
|
|
(setq-local life-generation-string "0")
|
|
(setq-local mode-line-buffer-identification '("Life: generation "
|
|
life-generation-string))
|
|
(setq-local fill-column (min (or life--max-width most-positive-fixnum)
|
|
(1- (window-width))))
|
|
(setq-local life-window-start 1)
|
|
(buffer-disable-undo))
|
|
|
|
(defun life-setup ()
|
|
(switch-to-buffer (get-buffer-create "*Life*") t)
|
|
;; stuff in the random pattern
|
|
(let ((inhibit-read-only t))
|
|
(erase-buffer)
|
|
(life-mode)
|
|
(life-insert-random-pattern)
|
|
;; make sure (life-life-char) is used throughout
|
|
(goto-char (point-min))
|
|
(while (re-search-forward (life-not-void-regexp) nil t)
|
|
(replace-match (life-life-string) t t))
|
|
;; center the pattern horizontally
|
|
(goto-char (point-min))
|
|
(let ((n (/ (- fill-column (line-end-position)) 2)))
|
|
(while (not (eobp))
|
|
(indent-to n)
|
|
(forward-line)))
|
|
;; center the pattern vertically
|
|
(let ((n (/ (- (min (or life--max-height most-positive-fixnum)
|
|
(1- (window-height)))
|
|
(count-lines (point-min) (point-max)))
|
|
2)))
|
|
(goto-char (point-min))
|
|
(newline n)
|
|
(goto-char (point-max))
|
|
(newline n))
|
|
;; pad lines out to fill-column
|
|
(goto-char (point-min))
|
|
(while (not (eobp))
|
|
(end-of-line)
|
|
(indent-to fill-column)
|
|
(move-to-column fill-column)
|
|
(delete-region (point) (progn (end-of-line) (point)))
|
|
(forward-line))
|
|
;; expand tabs to spaces
|
|
(untabify (point-min) (point-max))
|
|
;; before starting be sure the automaton has room to grow
|
|
(life-expand-plane-if-needed)
|
|
;; compute initial neighbor deltas
|
|
(life-compute-neighbor-deltas)))
|
|
|
|
(defun life-compute-neighbor-deltas ()
|
|
(setq life-neighbor-deltas
|
|
(list -1 (- fill-column)
|
|
(- (1+ fill-column)) (- (+ 2 fill-column))
|
|
1 fill-column (1+ fill-column)
|
|
(+ 2 fill-column))))
|
|
|
|
(defun life-insert-random-pattern ()
|
|
(insert-rectangle
|
|
(elt life-patterns (random (length life-patterns))))
|
|
(insert ?\n))
|
|
|
|
(defun life-increment-generation ()
|
|
(life-increment life-current-generation)
|
|
(setq life-generation-string (int-to-string life-current-generation)))
|
|
|
|
(defun life-grim-reaper ()
|
|
;; Clear the match information. Later we check to see if it
|
|
;; is still clear, if so then all the cells have died.
|
|
(set-match-data nil)
|
|
(goto-char (point-min))
|
|
;; For speed declare all local variable outside the loop.
|
|
(let (point char pivot living-neighbors list)
|
|
(while (search-forward (life-life-string) nil t)
|
|
(setq list life-neighbor-deltas
|
|
living-neighbors 0
|
|
pivot (1- (point)))
|
|
(while list
|
|
(setq point (+ pivot (car list))
|
|
char (char-after point))
|
|
(cond ((eq char (life-void-char))
|
|
(subst-char-in-region point (1+ point)
|
|
(life-void-char) 1 t))
|
|
((< char 3)
|
|
(subst-char-in-region point (1+ point) char (1+ char) t))
|
|
((< char 9)
|
|
(subst-char-in-region point (1+ point) char 9 t))
|
|
((>= char (life-life-char))
|
|
(life-increment living-neighbors)))
|
|
(setq list (cdr list)))
|
|
(if (memq living-neighbors '(2 3))
|
|
()
|
|
(subst-char-in-region pivot (1+ pivot)
|
|
(life-life-char) (life-death-char) t))))
|
|
(if (null (match-beginning 0))
|
|
(life-extinct-quit))
|
|
(subst-char-in-region 1 (point-max) 9 (life-void-char) t)
|
|
(subst-char-in-region 1 (point-max) 1 (life-void-char) t)
|
|
(subst-char-in-region 1 (point-max) 2 (life-void-char) t)
|
|
(subst-char-in-region 1 (point-max) (life-birth-char) (life-life-char) t)
|
|
(subst-char-in-region 1 (point-max) (life-death-char) (life-void-char) t))
|
|
|
|
(defun life-expand-plane-if-needed ()
|
|
(catch 'done
|
|
(goto-char (point-min))
|
|
(while (not (eobp))
|
|
;; check for life at beginning or end of line. If found at
|
|
;; either end, expand at both ends,
|
|
(cond ((or (eq (following-char) (life-life-char))
|
|
(eq (progn (end-of-line) (preceding-char)) (life-life-char)))
|
|
(goto-char (point-min))
|
|
(while (not (eobp))
|
|
(insert (life-void-char))
|
|
(end-of-line)
|
|
(insert (life-void-char))
|
|
(forward-char))
|
|
(setq fill-column (+ 2 fill-column))
|
|
(scroll-left 1)
|
|
(life-compute-neighbor-deltas)
|
|
(throw 'done t)))
|
|
(forward-line)))
|
|
(goto-char (point-min))
|
|
;; check for life within the first two lines of the buffer.
|
|
;; If present insert two lifeless lines at the beginning..
|
|
(cond ((search-forward (life-life-string)
|
|
(+ (point) fill-column fill-column 2) t)
|
|
(goto-char (point-min))
|
|
(insert-char (life-void-char) fill-column)
|
|
(insert ?\n)
|
|
(insert-char (life-void-char) fill-column)
|
|
(insert ?\n)
|
|
(setq life-window-start (+ life-window-start fill-column 1))))
|
|
(goto-char (point-max))
|
|
;; check for life within the last two lines of the buffer.
|
|
;; If present insert two lifeless lines at the end.
|
|
(cond ((search-backward (life-life-string)
|
|
(- (point) fill-column fill-column 2) t)
|
|
(goto-char (point-max))
|
|
(insert-char (life-void-char) fill-column)
|
|
(insert ?\n)
|
|
(insert-char (life-void-char) fill-column)
|
|
(insert ?\n)
|
|
(setq life-window-start (+ life-window-start fill-column 1)))))
|
|
|
|
(defun life-display-generation (step-time)
|
|
(goto-char life-window-start)
|
|
(recenter 0)
|
|
|
|
;; Redisplay; if the user has hit a key, exit the loop.
|
|
(or (and (sit-for step-time) (< 0 step-time))
|
|
(not (input-pending-p))
|
|
(throw 'life-exit nil)))
|
|
|
|
(defun life-extinct-quit ()
|
|
(life-display-generation 0)
|
|
(signal 'life-extinct nil))
|
|
|
|
(define-error 'life-extinct "All life has perished" 'quit) ;FIXME: quit really?
|
|
|
|
(provide 'life)
|
|
|
|
;;; life.el ends here
|