cards.ml


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158

type lambda =
  |Const of int
  |Lambda of (lambda -> lambda);;
let unfold (Lambda x) = x
let (@) a1 a2 = unfold a1 a2;;
let (!) x = Lambda x

let id  = !(fun x -> x)
type slot = {
    mutable vitality: int;
    mutable field: lambda
}
;;
let proponent = Array.init 256 (fun _ -> {vitality = 10000; field = id})
let opponent = Array.init 256 (fun _ -> {vitality = 10000; field = id})

let zero = Const 0
let succ = !(fun (Const n) -> if n < 65535 then Const (n+1) else Const n)
let dbl = !(fun (Const n) -> if n<32768 then Const(2*n) else Const n)
let get = !(fun (Const i) -> if proponent.(i).vitality > 0 then proponent.(i).field else failwith "dead")
let put = !(fun x -> id)
let s = !(fun f -> !(fun g -> !(fun x -> (f @ x) @ (g @ x))))
let k = !(fun x -> !(fun y -> x))
let inc = !(fun (Const i) -> 
  let v = proponent.(i).vitality in
  if ( v < 65535 ) & ( v > 0 ) then
    proponent.(i).vitality <- proponent.(i).vitality + 1;
  id)

let dec = !(fun (Const i) -> 
  let v = opponent.(255-i).vitality in
  if v>0 then
    opponent.(255-1).vitality <-opponent.(255-1).vitality-1;
  id)

let attack = !(fun (Const i) -> !(fun (Const j) -> !(fun (Const n) -> 
    let v = proponent.(i).vitality in
    if v - n > 0 then
      proponent.(i).vitality <- proponent.(i).vitality - n
    else
      failwith "not enough life";
    let w = opponent.(255-j).vitality in
    if w > 0 then
      proponent.(255-j).vitality <- max 0  (w - 9/10 *n);
    id)))

let help = !(fun (Const i) -> !(fun  (Const j) -> !(fun (Const n) ->
  let v = proponent.(i).vitality in
  if v - n > 0 then
    proponent.(i).vitality <- proponent.(i).vitality - n
  else
    failwith "not enough life";
  let w = proponent.(j).vitality in
  if w > 0 then
    proponent.(j).vitality <- min (w + n*11/10) 65535;
  id)))

let copy = !(fun (Const i) -> opponent.(i).field)

let revive = !(fun (Const i) ->
  let v = proponent.(i).vitality in
  if v <= 0 then
    proponent.(i).vitality <- 1;
  id)

let zombie = !(fun (Const i) -> !(fun x -> 
  let v = opponent.(255-i).vitality in
  if v <= 0 then
    begin
      opponent.(255-i).field <- x;
      opponent.(255-i).vitality <- -1
    end
  else
    failwith "slot is alive!";
  id))

type card =
    | I
    | Zero
    | Succ
    | Dbl
    | Get
    | Put
    | S
    | K
    | Inc
    | Dec
    | Attack
    | Help
    | Copy
    | Revive
    | Zombie
;;

let card_of_string s = match s with
    | "I" -> I
    | "zero" -> Zero
    | "Succ" -> Succ
    | "dbl" -> Dbl
    | "get" -> Get
    | "put" -> Put
    | "S" -> S
    | "K" -> K
    | "inc" -> Inc
    | "dec" -> Dec
    | "attack" -> Attack
    | "help" -> Help
    | "copy" -> Copy
    | "revive" -> Revive
    | "zombie" -> Zombie
;;

let cardfun_of_card c = match c with
  | I -> id
  | Zero -> zero
  | Succ -> succ
  | Dbl -> dbl
  | Get -> get
  | Put -> put
  | S -> s
  | K -> k
  | Inc -> inc
  | Dec -> dec
  | Attack -> attack
  | Help -> help
  | Copy -> copy
  | Revive -> revive
  | Zombie -> zombie

let left_apply card slot = 
  slot.field <- (cardfun_of_card card) @ slot.field

let right_apply slot card = 
  slot.field <- slot.field @ (cardfun_of_card card)

let proponent = Array.init 256 (fun _ -> {vitality = 10000; field = id})

let opponent = proponent = 
right_apply proponent.(0) Help;;
right_apply proponent.(0) Zero;;
left_apply K proponent.(0);;
left_apply S proponent.(0);;
right_apply proponent.(0) Succ;;
right_apply proponent.(0) Zero;;
right_apply proponent.(1) Zero;;
left_apply Succ proponent.(1);;
left_apply Dbl proponent.(1);;
left_apply Dbl proponent.(1);;
left_apply Dbl proponent.(1);;
left_apply Dbl proponent.(1);;
left_apply K proponent.(0);;
left_apply S proponent.(0);;
right_apply proponent.(0) Get;;
left_apply K proponent.(0);;
left_apply S proponent.(0);;
right_apply proponent.(0) Succ;;
right_apply proponent.(0) Zero;;