open Core.Std
+let (|-) g f x = f (g x)
+
+
+module Terminal : sig
+ type color = [ `green
+ | `red
+ | `white
+ ]
+
+ val string_with_color : string -> color -> string
+
+ val clear : unit -> unit
+
+ val reset : unit -> unit
+end = struct
+ type color = [ `green
+ | `red
+ | `white
+ ]
+
+ let ansi_code_clear = "\027[2J" (* Clear screen *)
+ let ansi_code_reset = "\027[1;1H" (* Reset cursor position *)
+
+ let string_of_color = function
+ | `green -> "\027[0;32m"
+ | `red -> "\027[1;31m"
+ | `white -> "\027[1;37m"
+
+ let string_with_color s c =
+ sprintf "%s%s\027[0m" (string_of_color c) s
+
+ let clear () =
+ print_string ansi_code_clear
+
+ let reset () =
+ print_string ansi_code_reset
+end
+
+
module type MATRIX = sig
module Point : sig
type t = {r : int; k : int}
end
-module Msg = struct
- type t = string
-end
+module PhenoType : sig
+ type t
+ val create : char -> Terminal.color option -> t
-module State = struct
- type t = string
-end
+ val to_string : t -> string
+end = struct
+ type t = { color : Terminal.color option
+ ; character : char
+ }
+ let create character color =
+ {color; character}
-module PhenoType = struct
- type t = string
+ let to_string = function
+ | {color=None; character} ->
+ String.of_char character
+ | {color=Some c; character} ->
+ Terminal.string_with_color (String.of_char character) c
end
module Cell = struct
- type t = { msg : Msg.t
+ module State = struct
+ type t = Alive of char
+ | Dead
+ end
+
+ type t = { state : State.t
; pheno : PhenoType.t
- ; state : State.t
}
end
module type RULE = sig
val create : unit -> Cell.t
- val transition : state:State.t -> inputs:Msg.t list -> Cell.t
+ val transition : self:Cell.State.t
+ -> neighbors:Cell.State.t list
+ -> Cell.t
end
-module Conway : RULE = struct
- type state = D | A
+module Life : RULE = struct
+ module State : sig
+ type t = D | A
+
+ val of_int : int -> t
+
+ val to_int : t -> int
+
+ val to_cell : t -> Cell.t
- let state_of_string : (string -> state) = function
- | "D" -> D
- | "A" -> A
- | _ -> assert false
+ val of_cell_state : Cell.State.t -> t
+ end = struct
+ type t = D | A
- let state_of_int : (int -> state) = function
- | 0 -> D
- | 1 -> A
- | _ -> assert false
+ let of_int = function
+ | 0 -> D
+ | 1 -> A
+ | _ -> assert false
- let int_of_state : (state -> int) = function
- | D -> 0
- | A -> 1
+ let to_int = function
+ | D -> 0
+ | A -> 1
- let string_of_state : (state -> string) = function
- | D -> "D"
- | A -> "A"
+ let to_pheno = function
+ | D -> PhenoType.create ' ' None
+ | A -> PhenoType.create 'o' (Some `white)
- let msg_of_state : (state -> Msg.t) =
- string_of_state
+ let of_cell_state = function
+ | Cell.State.Dead -> D
+ | Cell.State.Alive 'A' -> A
+ | Cell.State.Alive _ -> D (* Foreign cell *)
- let pheno_of_state : (state -> PhenoType.t) = function
- | D -> " "
- | A -> "o"
+ let to_cell_state = function
+ | D -> Cell.State.Dead
+ | A -> Cell.State.Alive 'A'
- let int_of_msg msg =
- msg |> state_of_string |> int_of_state
+ let to_cell t =
+ { Cell.state = t |> to_cell_state
+ ; Cell.pheno = t |> to_pheno
+ }
+ end
let next state ~live_neighbors =
match state with
- | A when live_neighbors < 2 -> D
- | A when live_neighbors < 4 -> A
- | A when live_neighbors > 3 -> D
- | D when live_neighbors = 3 -> A
- | A -> A
- | D -> D
-
- let cell_of_state s =
- { Cell.msg = s |> msg_of_state
- ; Cell.pheno = s |> pheno_of_state
- ; Cell.state = s |> string_of_state
- }
+ | State.A when live_neighbors < 2 -> State.D
+ | State.A when live_neighbors < 4 -> State.A
+ | State.A when live_neighbors > 3 -> State.D
+ | State.D when live_neighbors = 3 -> State.A
+ | State.A -> State.A
+ | State.D -> State.D
let create () =
- Random.int 2 |> state_of_int |> cell_of_state
+ Random.int 2 |> State.of_int |> State.to_cell
- let live_neighbors inputs =
- inputs |> List.map ~f:int_of_msg |> List.fold_left ~init:0 ~f:(+)
+ let live_neighbors neighbors =
+ neighbors |> List.map ~f:(State.of_cell_state |- State.to_int)
+ |> List.fold_left ~init:0 ~f:(+)
- let transition ~state ~inputs =
- state
- |> state_of_string
- |> next ~live_neighbors:(live_neighbors inputs)
- |> cell_of_state
+ let transition ~self ~neighbors =
+ self |> State.of_cell_state
+ |> next ~live_neighbors:(live_neighbors neighbors)
+ |> State.to_cell
end
-module Terminal : sig
- type color = [ `green
- | `red
- ]
+module ForestFire : RULE = struct
+ module State : sig
+ type t = E | T | B
- val string_with_color : string -> color -> string
+ val is_burning : t -> bool
- val clear : unit -> unit
+ val of_int : int -> t
- val reset : unit -> unit
-end = struct
- type color = [ `green
- | `red
- ]
+ val to_int : t -> int
- let ansi_code_clear = "\027[2J" (* Clear screen *)
- let ansi_code_reset = "\027[1;1H" (* Reset cursor position *)
+ val to_cell : t -> Cell.t
- let string_of_color = function
- | `green -> "\027[0;32m"
- | `red -> "\027[1;31m"
+ val of_cell_state : Cell.State.t -> t
+ end = struct
+ type t = E | T | B
- let string_with_color s c =
- sprintf "%s%s\027[0m" (string_of_color c) s
+ let is_burning = function
+ | E -> false
+ | T -> false
+ | B -> true
- let clear () =
- print_string ansi_code_clear
+ let of_int = function
+ | 0 -> E
+ | 1 -> T
+ | 2 -> B
+ | _ -> assert false
- let reset () =
- print_string ansi_code_reset
+ let to_int = function
+ | E -> 0
+ | T -> 1
+ | B -> 2
+
+ let to_pheno = function
+ | E -> PhenoType.create ' ' None
+ | T -> PhenoType.create 'T' (Some `green)
+ | B -> PhenoType.create '#' (Some `red)
+
+ let of_cell_state = function
+ | Cell.State.Dead -> E
+ | Cell.State.Alive 'T' -> T
+ | Cell.State.Alive 'B' -> B
+ | Cell.State.Alive _ -> E (* Foreign cell *)
+
+ let to_cell_state = function
+ | E -> Cell.State.Dead
+ | T -> Cell.State.Alive 'T'
+ | B -> Cell.State.Alive 'B'
+
+ let to_cell t =
+ { Cell.state = t |> to_cell_state
+ ; Cell.pheno = t |> to_pheno
+ }
+ end
+
+ let create () =
+ Random.int 3 |> State.of_int |> State.to_cell
+
+ let f = 0.000001 (* Probability of spontaneous ignition *)
+ let p = 0.1 (* Probability of spontaneous growth *)
+
+ let is_probable p =
+ (Random.float 1.0) <= p
+
+ let next state ~burning_neighbors =
+ match state, burning_neighbors with
+ | State.E, _ when is_probable p -> State.T
+ | State.E, _ -> State.E
+ | State.T, 0 when is_probable f -> State.B
+ | State.T, _ when burning_neighbors > 0 -> State.B
+ | State.T, _ -> State.T
+ | State.B, _ -> State.E
+
+ let burning_neighbors neighbors =
+ neighbors |> List.map ~f:State.of_cell_state
+ |> List.filter ~f:State.is_burning
+ |> List.map ~f:State.to_int
+ |> List.fold_left ~init:0 ~f:(+)
+
+ let transition ~self ~neighbors =
+ self |> State.of_cell_state
+ |> next ~burning_neighbors:(burning_neighbors neighbors)
+ |> State.to_cell
end
let create ~rows:rs ~columns:ks ~interval ~rules =
let n = List.length rules in
- let i = Random.int n in
let init () =
- let rule = List.nth_exn rules i in
+ let rule = List.nth_exn rules (Random.int n) in
let module Rule = (val rule : RULE) in
{ rule
; data = Rule.create ()
}
let cell_to_string cell =
- cell.data.Cell.pheno
+ PhenoType.to_string cell.data.Cell.pheno
let print t =
Terminal.reset ();
let neighbors = Matrix.get_neighbors t.grid point in
let data =
Rule.transition
- ~state:data.Cell.state
- ~inputs:(List.map neighbors ~f:(fun cell -> cell.data.Cell.msg))
+ ~self:data.Cell.state
+ ~neighbors:(List.map neighbors ~f:(fun c -> c.data.Cell.state))
in
{rule; data}
)
end
-let main () =
+let main interval () =
Random.self_init ();
let rows, columns = Or_error.ok_exn Linux_ext.get_terminal_size () in
- let interval = 0.1 in
let rules =
- [ (module Conway : RULE)
+ [ (module Life : RULE)
+ ; (module ForestFire : RULE)
]
in
Automaton.loop (Automaton.create ~rows:(rows - 3) ~columns ~interval ~rules)
let spec =
let summary = "Polymorphic Cellular Automata" in
- let spec = Command.Spec.empty in
+ let spec = Command.Spec.(empty
+ +> flag "-i" (optional_with_default 0.1 float)
+ ~doc:" Induced interval between generations."
+ )
+ in
Command.basic ~summary spec main
home / code / cellular-automata.git / blobdiff