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 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301
|
(* ****** ****** *)
(*
For testing GraphSearch_dfs
*)
(* ****** ****** *)
//
#include
"share/atspre_define.hats"
#include
"share/atspre_staload.hats"
//
#include
"share/HATS/atspre_staload_libats_ML.hats"
#include
"share/HATS/atslib_staload_libats_libc.hats"
//
(* ****** ****** *)
//
staload
"./../DATS/GraphSearch.dats"
staload
"./../DATS/GraphSearch_dfs.dats"
//
(* ****** ****** *)
//
staload
"./../../../../STL/DATS/stack_stack.dats"
//
(* ****** ****** *)
implement node_mark<>(nx) = ()
implement node_unmark<>(nx) = ()
implement node_is_marked<>(nx) = false
(* ****** ****** *)
//
datatype expr =
| EXPRval of double
| EXPRadd of (expr, expr)
| EXPRsub of (expr, expr)
| EXPRmul of (expr, expr)
| EXPRdiv of (expr, expr)
//
typedef exprlst = list0(expr)
//
(* ****** ****** *)
//
extern
fun
print_expr : expr -> void
and
fprint_expr : fprint_type(expr)
//
overload print with print_expr
overload fprint with fprint_expr
//
implement
print_expr(x0) = fprint_expr(stdout_ref, x0)
//
implement
fprint_expr(out, x0) =
(
case+ x0 of
| EXPRval(v) => fprint(out, g0float2int_double_int(v))
| EXPRadd(e1, e2) => fprint!(out, "(", e1, "+", e2, ")")
| EXPRsub(e1, e2) => fprint!(out, "(", e1, "-", e2, ")")
| EXPRmul(e1, e2) => fprint!(out, "(", e1, "*", e2, ")")
| EXPRdiv(e1, e2) => fprint!(out, "(", e1, "/", e2, ")")
)
//
(* ****** ****** *)
implement fprint_val<expr> = fprint_expr
(* ****** ****** *)
//
#define EPSILON 1E-6
//
extern
fun
eval_expr(expr): double
overload ! with eval_expr
//
implement
eval_expr(e0) =
(
case+ e0 of
| EXPRval(v) => v
| EXPRadd(e1, e2) => !e1 + !e2
| EXPRsub(e1, e2) => !e1 - !e2
| EXPRmul(e1, e2) => !e1 * !e2
| EXPRdiv(e1, e2) => !e1 / !e2
) (* end of [eval_expr] *)
//
(* ****** ****** *)
//
extern
fun
expr_is_0 : expr -> bool
extern
fun
expr_is_24 : expr -> bool
//
overload iseqz with expr_is_0
//
(* ****** ****** *)
//
implement
expr_is_0(e) =
g0float_abs_double(!e - 0) < EPSILON
implement
expr_is_24(e) =
g0float_abs_double(!e - 24) < EPSILON
//
(* ****** ****** *)
//
extern
fun
arithops(x: expr, y: expr): exprlst
//
implement
arithops(x, y) =
list0_reverse(res) where
{
val res = nil0()
val res = cons0(EXPRadd(x, y), res)
val res = cons0(EXPRsub(x, y), res)
val res = cons0(EXPRsub(y, x), res)
val res = cons0(EXPRmul(x, y), res)
val res = (if iseqz(y) then res else cons0(EXPRdiv(x, y), res)): exprlst
val res = (if iseqz(x) then res else cons0(EXPRdiv(y, x), res)): exprlst
}
(* ****** ****** *)
assume node_type = exprlst
assume nodelst_vtype = list0(exprlst)
(* ****** ****** *)
//
implement
{}(*tmp*)
theSearchStore_insert_lst(nxs) =
(
nxs
).rforeach()(lam nx => theSearchStore_insert(nx))
//
(* ****** ****** *)
implement
{}(*tmp*)
node_get_neighbors
(nx) = aux1(nx, nil0()) where
{
//
fun
aux1
(
xs: exprlst
,
ys: exprlst
) : list0(exprlst) =
(
case+ xs of
| nil0() =>
list0_nil()
| cons0(x, xs) =>
aux2(x, xs, ys) + aux1(xs, cons0(x, ys))
)
//
and
aux2
(
x0: expr
,
xs: exprlst
,
ys: exprlst
) : list0(exprlst) =
(
case+ xs of
| nil0() =>
list0_nil()
| cons0(x, xs) =>
(arithops(x0, x)).map(TYPE{exprlst})
(lam x1 => cons0(x1, list0_reverse_append(ys, xs))) + aux2(x0, xs, cons0(x, ys))
) (* end of [aux2] *)
//
} (* end of [node_get_neighbors] *)
(* ****** ****** *)
//
extern
fun
GameOf24Play
(
n1: int, n2: int, n3: int, n4: int
) : void // end-of-function
//
implement
GameOf24Play
(
n1, n2, n3, n4
) = let
//
#define :: cons0
//
val
nsol = ref<int>(0)
//
implement
process_node<>
(nx) = true where
{
//
(*
val () =
println!("process_node: nx = ", nx)
*)
//
val () =
case+ nx of
| list0_sing(x) =>
if expr_is_24(x)
then (!nsol := !nsol+1; println!(x))
// end of [if]
| _(*non-sing*) => ()
}
//
val
store =
stack_make_nil<node>()
//
val nx =
(
n1::n2::n3::n4::nil0()
).map(TYPE{expr})(lam x => EXPRval(g0i2f(x)))
//
val () =
stack_insert(store, nx)
//
in
//
GraphSearch_dfs_stack(store);
if !nsol = 0
then println! ("There is no solution found!");
// end of [if]
//
end (* end of [GameOf24Play] *)
//
(* ****** ****** *)
implement
main0
(
argc, argv
) = () where
{
//
(*
val () =
println! ("Hello from [Game-of-24]!")
*)
//
val () =
$STDLIB.srandom
($UN.cast{uint}($TIME.time()))
//
val n1 =
(
if argc >= 2
then g0string2int(argv[1]) else randint(13)+1
) : int // end of [val]
val n2 =
(
if argc >= 3
then g0string2int(argv[2]) else randint(13)+1
) : int // end of [val]
val n3 =
(
if argc >= 4
then g0string2int(argv[3]) else randint(13)+1
) : int // end of [val]
val n4 =
(
if argc >= 5
then g0string2int(argv[4]) else randint(13)+1
) : int // end of [val]
//
val () = println! ("n1 = ", n1)
val () = println! ("n2 = ", n2)
val () = println! ("n3 = ", n3)
val () = println! ("n4 = ", n4)
//
val () = GameOf24Play(n1, n2, n3, n4)
//
} (* end of [main0] *)
(* ****** ****** *)
(* end of [GameOf24Play.dats] *)
|