gol.ml
· 1.6 KiB · OCaml
Ham
Playground
Random.self_init ()
type cell = Dead | Alive
let cell_to_string = function
| Alive -> "#"
| Dead -> "_"
let cell_to_int = function
| Alive -> 1
| Dead -> 0
let random_cell = fun _ -> if Random.bool () then Dead else Alive ;;
let random_row = fun _ -> Array.init 10 random_cell ;;
let random_grid () = Array.init 10 random_row ;;
let empty_grid () = Array.init 10 (fun _ -> Array.make 10 Dead) ;;
let grid = ref (random_grid ()) ;;
let show_row row =
for x = 0 to 9 do
cell_to_string row.(x) |> print_string
done;
print_newline () ;;
let show_grid () =
for y = 0 to 9 do
show_row !grid.(y)
done
let read_cell x y =
!grid.(y mod 10).(x mod 10) ;;
let neighbors x y =
(read_cell (x + 9) (y + 9) |> cell_to_int)
+ (read_cell x (y + 9) |> cell_to_int)
+ (read_cell (x + 1) (y + 9) |> cell_to_int)
+ (read_cell (x + 9) y |> cell_to_int)
+ (read_cell (x + 1) y |> cell_to_int)
+ (read_cell (x + 9) (y + 1) |> cell_to_int)
+ (read_cell x (y + 1) |> cell_to_int)
+ (read_cell (x + 1) (y + 1) |> cell_to_int)
let next_state x y =
match read_cell x y, neighbors x y with
| (Dead, 3) -> Alive
| (Alive, 2) | (Alive, 3) -> Alive
| _ -> Dead
let update_grid () =
let next_grid = empty_grid () in
for y = 0 to 9 do
for x = 0 to 9 do
next_grid.(y).(x) <- next_state x y
done
done;
grid := next_grid ;;
while true do
show_grid () ;
print_newline () ;
update_grid () ;
let _ = read_line () in () ;
done
| 1 | |
| 2 | Random.self_init () |
| 3 | |
| 4 | type cell = Dead | Alive |
| 5 | let cell_to_string = function |
| 6 | | Alive -> "#" |
| 7 | | Dead -> "_" |
| 8 | |
| 9 | let cell_to_int = function |
| 10 | | Alive -> 1 |
| 11 | | Dead -> 0 |
| 12 | |
| 13 | let random_cell = fun _ -> if Random.bool () then Dead else Alive ;; |
| 14 | let random_row = fun _ -> Array.init 10 random_cell ;; |
| 15 | |
| 16 | let random_grid () = Array.init 10 random_row ;; |
| 17 | let empty_grid () = Array.init 10 (fun _ -> Array.make 10 Dead) ;; |
| 18 | |
| 19 | let grid = ref (random_grid ()) ;; |
| 20 | |
| 21 | let show_row row = |
| 22 | for x = 0 to 9 do |
| 23 | cell_to_string row.(x) |> print_string |
| 24 | done; |
| 25 | print_newline () ;; |
| 26 | |
| 27 | let show_grid () = |
| 28 | for y = 0 to 9 do |
| 29 | show_row !grid.(y) |
| 30 | done |
| 31 | |
| 32 | let read_cell x y = |
| 33 | !grid.(y mod 10).(x mod 10) ;; |
| 34 | |
| 35 | let neighbors x y = |
| 36 | (read_cell (x + 9) (y + 9) |> cell_to_int) |
| 37 | + (read_cell x (y + 9) |> cell_to_int) |
| 38 | + (read_cell (x + 1) (y + 9) |> cell_to_int) |
| 39 | + (read_cell (x + 9) y |> cell_to_int) |
| 40 | + (read_cell (x + 1) y |> cell_to_int) |
| 41 | + (read_cell (x + 9) (y + 1) |> cell_to_int) |
| 42 | + (read_cell x (y + 1) |> cell_to_int) |
| 43 | + (read_cell (x + 1) (y + 1) |> cell_to_int) |
| 44 | |
| 45 | let next_state x y = |
| 46 | match read_cell x y, neighbors x y with |
| 47 | | (Dead, 3) -> Alive |
| 48 | | (Alive, 2) | (Alive, 3) -> Alive |
| 49 | | _ -> Dead |
| 50 | |
| 51 | let update_grid () = |
| 52 | let next_grid = empty_grid () in |
| 53 | for y = 0 to 9 do |
| 54 | for x = 0 to 9 do |
| 55 | next_grid.(y).(x) <- next_state x y |
| 56 | done |
| 57 | done; |
| 58 | grid := next_grid ;; |
| 59 | |
| 60 | while true do |
| 61 | show_grid () ; |
| 62 | print_newline () ; |
| 63 | update_grid () ; |
| 64 | let _ = read_line () in () ; |
| 65 | done |
| 66 | |
| 67 |