-
Notifications
You must be signed in to change notification settings - Fork 0
/
squares
317 lines (249 loc) · 5.21 KB
/
squares
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
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
wordlist: squares
digression sq@ "bmpread"
mapmaking first
squares first
definitions
\ ---------------------
variable #terrains
0 #terrains !
20000000 constant infinite
\ a table n x n in size
: xtable ( n <name> -- )
create dup ,
dup * cells allot
;
: >= < not ;
: rangechk ( x y addr -- x y addr)
dup @ ( x y start max )
>r over r@ >= if abort" Table row out of range" then
2 pick r> >= if abort" Table column out of range" then ( x y start)
;
: tablexy ( x y addr -- addr2)
rangechk
@+ ( x y size start )
swap >r ( x y start |size)
rot cells+
swap r> * cells+
;
\ 4 5 <table> -- val
: xy@ ( x y addr -- addr)
tablexy @
;
: xy! tablexy ! ;
: xy+! tablexy +! ;
: cfill ( addr cells value -- )
-rot
times
2dup !
cell+
iterate
2drop
;
: default ( n addr -- )
@+ swap ( n start size )
dup * rot cfill
;
: clear ( addr)
0 swap default
;
: size@ @ ;
: row! ( n y addr -- )
2dup @ >= if abort" Illegal row store" then
@+ ( n y size start )
swap dup>r ( n y start size |r: size)
rot * cells+ ( n row^ |r:size)
r> rot cfill
;
: col! ( n x addr -- )
2dup @ >= if abort" Illegal col store" then
@+ swap dup times ( n x rowStart size)
over 2>r ( n x rowStart |r: size rowStart)
over cells+ ( n x col^ | size rowStart)
2 pick ( n x col^ n| size rowStart)
swap ! ( n x |size rowStart)
r> r@ cells+ r> ( n x nextRowStart size)
iterate
4 drops
;
: (rowmax) ( row^ sz -- maxx max )
over @ 0 swap 2>r ( row^ sz |r: maxx max )
begin
1- ( row^ x |r: maxx max )
2dup cells+ @
dup r@ > if ( row^ x newmax |r: maxx oldmax)
rdrop rdrop ( maxrow^ x newmax)
2dup 2>r
then
drop
?dup while
repeat
drop 2r>
;
: preprow ( y table -- rowaddr sz)
dup @ rot ( addr sz y )
2dup < if abort" non-existant row" then
over >r
* 1+ cells+ r> ( rowaddr sz)
;
: rowmax ( y table -- maxx max)
preprow
(rowmax)
;
: >row ( y table -- rowaddr)
@+ ( y sz tabledata )
-rot
* cells+ ;
: .row ( y table -- )
dup @ rot over >r * 1+ cells + r>
0 do i . @+ swap . space loop drop cr ;
: rowsum ( y table -- t)
preprow ( rowaddr sz)
0 -rot
times ( t addr)
@+ >r + r>
iterate
drop
;
256 xtable costs
256 cells 2* create terrains$ allot
: t$ ( n -- caddr len) 2* cells terrains$ + 2@ ;
: t$! ( caddr len n -- )
-rot (fix$) rot
2* cells terrains$ + 2! ;
: self! ( n x -- ) dup costs xy! ;
: self@ ( x -- ) dup costs xy@ ;
\ set cost from terrain y to any OTHER terrain to n
: any> ( n y -- )
dup dup self@ ( n y y c)
2>r ( n y |r: y c)
costs col!
r> r> self!
;
\ set cost of moving to any OTHER terrain from terrain y, to n
: >any ( n y -- )
dup dup self@ ( n y y c)
2>r ( n y |r: y c)
costs row!
r> r> self!
;
\ set cost of moving from x -> y terrain to n
: cost! ( n x y -- ) costs xy! ;
: cost@ ( x y -- cost ) costs xy@ ;
: cost? cost@ . ;
\ from x to y is average of x->x and y->y
\ from y to x is average of x->x and y->y
: avg ( x y -- )
2dup dup cost@ swap dup cost@ ( x y ycost xcost)
+ 2/ ( x y average)
>r ( x y |r: average)
2dup r@ -rot cost!
swap r> -rot cost!
;
: +terrain ( cost <name> -- )
#terrains @ dup 256 = if abort" Too many terrains!" then
save-input
constant
restore-input bl word count #terrains @ t$!
1 #terrains +!
;
: prev-terrain #terrains @ 1- ;
10 constant cheapest \ = 48miles per day=24"
48 constant fastest
3840 constant 1day
1day 24 / constant 1hr
1day 7 * constant 1week
1day 30 * constant 1month
: " ( n <name> -- )
cheapest fastest rot */ mapscale ( cost <name> )
\ 1day swap /
+terrain
prev-terrain ( cost index )
self!
;
: averages!
costs size@ ( size start)
0 do
costs size@
0 do
i j cost@
cheapest = if i j avg then
loop
loop
;
cheapest costs default
\ These values are effectively 2 x the normal D&D move rates
+terrain impassible
infinite impassible self!
32 " opensea \ slightly more risky, so avoid if possible
18 " city
48 " coastal
18 " plains
9 " woods
24 " roads
12 " ltwoods
9 " hills
6 " wdhills
1 " mts
1 " swamp
6 " desert
4 " scrub
6 " rough
30 " river
12 " ford
1 " jungle
4 " snow
\ 2 " ice
\ 6 " tundra
averages!
1month coastal any>
1month coastal >any
1week 2 * opensea any>
1week 2 * opensea >any
1month river any>
1month river >any
\ 1month swamp any>
\ 1month swamp >any
1week river ford cost!
1week ford river cost!
1day city river cost!
1hr 4 * river city cost!
river coastal avg
river opensea avg
coastal opensea avg
\ river swamp avg
\ coastal swamp avg
\ opensea swamp avg
1hr 6 * coastal city cost!
1hr 6 * opensea city cost!
1day city coastal cost!
1day city opensea cost!
1hr roads plains cost!
infinite impassible >any
infinite impassible any>
: .costs
tab tab
#terrains @ 1 do i t$ type tab loop cr
#terrains @ 1 do i . i tab t$ type tab
#terrains @ 1 do
j i costs xy@ u. tab
loop
cr
loop
cr
;
\ .costs
: orthogcost ( from to -- cost)
sq@ swap sq@ swap
cost@
;
: diagcost ( from to -- cost) orthogcost 2828427 2000000 */ ;
export{
: move£ ( from to -- cost)
2dup - abs ( from to diff)
dup 1 = if drop orthogcost
else width = if orthogcost
else diagcost
then then
;
}export
previous definitions