-
Notifications
You must be signed in to change notification settings - Fork 0
/
pathfind.pas
256 lines (223 loc) · 6.28 KB
/
pathfind.pas
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
(* RetroNick's version of popular fiveline puzzle/logic game *)
(* This Program is free and open source. Do what ever you like with *)
(* the code. Tested on freepascal for Dos GO32 target but should work *)
(* on anything that uses the graph unit. *)
(* *)
(* If you can't sleep at night please visit my github and youtube *)
(* channel. A sub and follow would be nice :) *)
(* *)
(* https://github.com/RetroNick2020 *)
(* https://www.youtube.com/channel/UCLak9dN2fgKU9keY2XEBRFQ *)
(* https://twitter.com/Nickshardware *)
(* [email protected] *)
(* *)
Unit PathFind;
Interface
Uses squeue;
const
VSIZE = 9;
HSIZE = 9;
type
PGA = Array[0..HSIZE-1,0..VSIZE-1] of Integer;
procedure ClearGrid(var TGrid : PGA);
procedure PlaceWall(var TGrid : PGA;x,y : integer);
procedure PlaceSource(var TGrid : PGA;x,y : integer);
procedure PlaceTarget(var TGrid : PGA;x,y : integer);
Function FindPointPath(var TGrid : PGA;StartX,StartY,StartDir : integer;
var PathQueue : SimpleQueueRec) : integer;
procedure PlaceDirectionArrows(var TQueue : SimpleQueueRec;
var TGrid : PGA;
x,y : integer);
Function FindTargetPath(var PGrid : PGA;
sx,sy,tx,ty : integer;
var FoundPath : SimpleQueueRec) : Boolean;
Const
G_Empty = 0;
G_Left = 1;
G_Right = 2;
G_Up = 3;
G_Down = 4;
G_LeftDown = 5;
G_LeftUp = 6;
G_RightDown = 7;
G_RightUp = 8;
G_Source = 9;
G_Target = 10;
G_Wall = 11;
Implementation
procedure ClearGrid(var TGrid : PGA);
var
i,j : integer;
begin
for j:=0 to VSIZE-1 do
begin
for i:=0 to HSIZE-1 do
begin
TGrid[i,j]:=G_Empty;
end;
end;
end;
procedure PlaceSource(var TGrid : PGA;x,y : integer);
begin
TGRID[x,y]:=G_Source;
end;
procedure PlaceTarget(var TGrid : PGA;x,y : integer);
begin
TGRID[x,y]:=G_Target;
end;
procedure PlaceWall(var TGrid : PGA;x,y : integer);
begin
TGRID[x,y]:=G_Wall;
end;
procedure PlaceWallArea(var TGrid : PGA;x,y,x2,y2 : integer);
var
i,j : integer;
begin
for j:=y to y2 do
begin
for i:=x to x2 do
begin
PlaceWall(TGrid,i,j);
end;
end;
end;
Function GetReverseDir(inDir : integer) : integer;
begin
Case InDir of G_Up:GetReverseDir:=G_Down;
G_Down:GetReverseDir:=G_Up;
G_Left:GetReverseDir:=G_Right;
G_Right:GetReverseDir:=G_Left;
G_Target:GetReverseDir:=G_Target;
end;
end;
Function FindPointNext(var TGrid : PGA;x,y,dir : integer; var np : LocationRec) : Boolean;
begin
FindPointNext:=false;
if (x<0) or (y<0) or (x > (HSize-1)) or (y >(VSize-1)) then exit;
IF TGrid[x,y] = G_Target then exit;
if (Dir=G_Up) and (y>0) then
begin
np.x:=x;
np.y:=y-1;
np.direction:=GetReverseDir(TGrid[x,y-1]);
FindPointNext:=true;
end
else if (Dir=G_Left) and (x > 0) then
begin
np.x:=x-1;
np.y:=y;
np.direction:=GetReverseDir(TGrid[x-1,y]);
FindPointNext:=true;
end
else if (Dir=G_Down) and (y < (VSize-1)) then
begin
np.x:=x;
np.y:=y+1;
np.direction:=GetReverseDir(TGrid[x,y+1]);
FindPointNext:=true;
end
else if (Dir=G_Right) and (x < (HSize-1)) then
begin
np.x:=x+1;
np.y:=y;
np.direction:=GetReverseDir(TGrid[x+1,y]);
FindPointNext:=true;
end;
end;
function isGoodStart(var TGrid : PGA;StartX,StartY, StartDir : integer) : boolean;
var
nx,ny : integer;
goodxy : Boolean;
begin
nx:=StartX;
ny:=StartY;
if StartDir = G_UP then Dec(ny);
if StartDir = G_DOWN then inc(ny);
if StartDir = G_LEFT then Dec(nx);
if StartDir = G_RIGHT then inc(nx);
goodxy:=(nx >=0) AND (nx < HSIZE) AND (ny>=0) AND (ny<VSIZE);
isGoodStart:=goodxy and (TGrid[nx,ny]<>G_WALL);
end;
Function FindPointPath(var TGrid : PGA;StartX,StartY,StartDir : integer; Var PathQueue : SimpleQueueRec) : integer;
var
CP,NP : LocationRec;
begin
FindPointPath:=0;
if isGoodStart(TGrid,StartX,StartY,StartDir)=FALSE then exit;
CP.x:=StartX;
CP.y:=StartY;
CP.Direction:=StartDir;
While FindPointNext(TGrid,CP.x,CP.y,CP.Direction,NP) do
begin
if (NP.Direction=G_Target) then
begin
if SQueueCount(PathQueue) > 0 then FindPointPath:=SQueueCount(PathQueue);
exit;
end;
SQueuePush(PathQueue,NP);
CP:=NP;
end;
end;
procedure PlaceDirShape(var TQueue : SimpleQueueRec;
var TGrid : PGA;
x,y,G_Dir : integer);
var
QR : LocationRec;
begin
if (x < 0) or (x>(HSIZE-1)) or (y<0) or (y>(VSIZE-1)) then exit;
if TGRID[x,y] <> G_Empty then exit;
TGRID[x,y] := G_Dir;
QR.x:=x;
QR.y:=y;
QR.Direction:=G_Dir;
SQueuePush(TQueue,QR);
end;
procedure PlaceDirectionArrows(var TQueue : SimpleQueueRec;
var TGrid : PGA;
x,y : integer);
begin
PlaceDirShape(TQueue,TGrid,x+1,y,G_Right);
PlaceDirShape(TQueue,TGrid,x,y+1,G_Down);
PlaceDirShape(TQueue,TGrid,x-1,y,G_Left);
PlaceDirShape(TQueue,TGrid,x,y-1,G_Up);
end;
Function FindTargetPath(var PGrid : PGA;
sx,sy,tx,ty : integer;
var FoundPath : SimpleQueueRec) : Boolean;
var
Queue : SimpleQueueRec;
qr : LocationRec;
found : integer;
begin
FindTargetPath:=False;
InitSQueue(Queue);
PlaceSource(PGrid,sx,sy);
PlaceTarget(PGrid,tx,ty);
PlaceDirectionArrows(Queue,PGrid,tx,ty);
While SQueueCount(Queue)<>0 do
begin
SQueuePopFirst(Queue,QR);
PlaceDirectionArrows(Queue,PGrid,QR.x,QR.y);
end;
(*check in all directions*)
InitSQueue(FoundPath);
found:=FindPointPath(PGrid,sx,sy,G_DOWN,FoundPath);
if found = 0 then
begin
InitSQueue(FoundPath);
found:=FindPointPath(PGrid,sx,sy,G_LEFT,FoundPath);
end;
if found = 0 then
begin
InitSQueue(FoundPath);
found:=FindPointPath(PGrid,sx,sy,G_UP,FoundPath);
end;
if found = 0 then
begin
InitSQueue(FoundPath);
found:=FindPointPath(PGrid,sx,sy,G_RIGHT,FoundPath);
end;
if found > 0 then FindTargetPath:=True;
end;
begin
end.