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
|
;; This is a test of routing algorithms.
;;; (should include about 10-20 destinations chosen by variant)
;;; ((implies testing script can choose variants...))
;;; (should include two "passable" type, two "impassable",
;;; 1-2 bords, 1-2 conns)
(include "tank")
(area 30 30)
(area (terrain (by-name "+" plains)
"30+"
"30+"
"30+"
"30+"
"30+"
"30+"
"30+"
"30+"
"30+"
"30+"
"30+"
"30+"
"30+"
"30+"
"30+"
"30+"
"30+"
"30+"
"30+"
"30+"
"30+"
"30+"
"30+"
"30+"
"30+"
"30+"
"30+"
"30+"
"30+"
"30+"
))
;; Limit to two players only.
(set sides-min 2)
(set sides-max 2)
;; Two sides, no special properties needed (?).
(side 1)
(side 2)
;;; (no player for one side so tank doesn't move?)
;; Two tanks, one for each side, at predetermined locations.
(tank 10 7 1)
(tank 10 13 2)
;; This motivates the AI to go chasing after the destination.
(scorekeeper (do last-side-wins))
|
