TheGameCreators - CodeBase - Fast search routines

Return to the CodeBase listing

Category: Libraries

Version: 1.30

Information

Uploaded: 30th Aug 2003 10:00

Modified: 10th May 2006 14:06

Author: IanM

Summary

A* and Flood pathfinding routines - Updated for DBPro 6.0

Full Description

Various search routines: A* and Flood search routines. Can be configured for standard 8-way search, 8-way with restrictions on the diagonals, and 4-way search. Can also be configured to stop when a certain distance has been reached. See the example in the ZIP for usage. All modifications can be found at the end of the code.

DarkBASIC Professional Source Code

` This code was downloaded from The Game Creators

` It is reproduced here with full permission

` http://www.thegamecreators.com

` MapAndSearch.dba

` Map and search routines

remstart

AVAILABLE FUNCTIONS*********************************************************************

CreateSearchMap(Width,Height)

Create the map of the size specified

CreateSearchPathList(NoOfPaths)

Create the paths of the quantity specified

SetSearchMap(X,Y,Value)

Set an entry within the map (> 0 is not walkable)

GetSearchMap(X,Y)

Read an entry from the map

GetSearchPathX(Path,Move)

Get a X coordinate from the path specified

GetSearchPathY(Path,Move)

Get a Y coordinate from the path specified

SearchPathSize(Path)

Get the length of the specified path

SetSearchRestrictDiagonals(Mode)

Only affects the 8 diection searches. If set to non-zero, will avoid diagonals

between blocked cells.

SetMaximumCost(Cost)

Will stop searching if the target is not reached within the required cost. Set to

zero to deactivate.

SearchMapAStar4(Path,StartX,StartY,FinishX,FinishY)

Run an 4 direction A* search, and store the results within the selected path

SearchMapAStar8(Path,StartX,StartY,FinishX,FinishY)

Run an 8 direction A* search, and store the results within the selected path

SearchMapFlood4(Path,StartX,StartY,FinishX,FinishY)

Run a 4 direction flood search, and store the results within the selected path

SearchMapFlood8(Path,StartX,StartY,FinishX,FinishY)

Run an 8 direction flood search, and store the results within the selected path

GetFloodCost(FinishX,FinishY)

Uses the previous Flood4 search to identify the cost of the specified target

****************************************************************************************

remend

` ********************

` UDTs used internally

` ********************

type SEARCH_Position_t

X as integer

Y as integer

endtype

type SEARCH_TileInformation_t

Status   as integer

G        as integer

H        as integer

F        as integer

ParentX  as integer

ParentY  as integer

endtype

type SEARCH_OpenListItem_t

F as integer

X as integer

Y as integer

endtype

` *************************************

` Global variables for library use only

` *************************************

global SEARCH_MapWidth  as integer

global SEARCH_MapHeight as integer

global SEARCH_MaxPaths as integer

global SEARCH_CurrentPosition as SEARCH_Position_t

` This is used for the new HEAP format using in A*

global SEARCH_OpenListSize as integer

` These are used for the flood4 search

global SEARCH_OpenListTop as integer

global SEARCH_OpenListBottom as integer

` Optimisation for flood4 search system

global SEARCH_PreviousStart as SEARCH_Position_t

` General search parameters

global SEARCH_RestrictedDiagonals as integer

global SEARCH_MaximumCost as integer

global SEARCH_ParametersChanged as integer

global SEARCH_LastSearch as integer

` Note: these dims never actually get run - they are just here to declare the existance of the

`       arrays.

`       They are actually dimensioned in the Create* functions.

`       *This* is how you declare arrays in included files, and arrays where you don't know the

`       dimensions to use until run-time.

global dim SEARCH_Map(SEARCH_MapWidth, SEARCH_MapHeight) as integer

global dim SEARCH_TileInfo(SEARCH_MapWidth, SEARCH_MapHeight) as SEARCH_TileInformation_t

global dim SEARCH_OpenList(SEARCH_MapWidth * SEARCH_MapHeight) as SEARCH_OpenListItem_t

global dim SEARCH_SearchPath(SEARCH_MaxPaths, SEARCH_MapWidth * SEARCH_MapHeight) as SEARCH_Position_t

global dim SEARCH_PathSize(SEARCH_MaxPaths) as integer

` Initialised flags - by default DBPro sets them to zero. If they are not zero, then

` we are initialised.

global SEARCH_PathsInitialised as integer

global SEARCH_MapInitialised as integer

` ****************

` Public functions

` ****************

function CreateSearchMap(X as integer, Y as integer)

SEARCH_MapWidth = X

SEARCH_MapHeight = Y

SEARCH_PreviousStart.X = -9999

SEARCH_PreviousStart.Y = -9999

undim SEARCH_Map()

undim SEARCH_TileInfo()

undim SEARCH_OpenList()

global dim SEARCH_Map(X, Y) as integer

global dim SEARCH_TileInfo(X, Y) as SEARCH_TileInformation_t

global dim SEARCH_OpenList(X * Y) as SEARCH_OpenListItem_t

SetSearchMaximumCost(0)

SEARCH_MapInitialised=1

endfunction

function CreateSearchPathLists(Paths as integer)

SEARCH_MaxPaths = Paths

undim SEARCH_SearchPath()

undim SEARCH_PathSize()

global dim SEARCH_SearchPath(SEARCH_MaxPaths, SEARCH_MapWidth * SEARCH_MapHeight) as SEARCH_Position_t

global dim SEARCH_PathSize(SEARCH_MaxPaths) as integer

SEARCH_PathsInitialised = 1

endfunction

function SetSearchMap(X as integer, Y as integer, Value as integer)

if SEARCH_MapInitialised = 0 then exitfunction

if X < 0 or X >= SEARCH_MapWidth then exitfunction

if Y < 0 or Y >= SEARCH_MapHeight then exitfunction

SEARCH_PreviousStart.X = -9999

SEARCH_Map(X,Y) = Value

endfunction

function GetSearchMap(X as integer, Y as integer)

if SEARCH_MapInitialised = 0 then exitfunction

if X < 0 or X >= SEARCH_MapWidth then exitfunction 0

if Y < 0 or Y >= SEARCH_MapHeight then exitfunction 0

exitfunction SEARCH_Map(X,Y) + 0

endfunction 0

function GetSearchPathX(Path as integer, Move as integer)

if SEARCH_PathsInitialised = 0 then exitfunction -1

if Path < 0 or Path > SEARCH_MaxPaths then exitfunction -1

if Move < 0 or Move > SEARCH_PathSize(Path) then exitfunction -1

exitfunction SEARCH_SearchPath(Path, SEARCH_PathSize(Path)-Move).X + 0

endfunction -1

function GetSearchPathY(Path as integer, Move as integer)

if SEARCH_PathsInitialised = 0 then exitfunction -1

if Path < 0 or Path > SEARCH_MaxPaths then exitfunction -1

if Move < 0 or Move > SEARCH_PathSize(Path) then exitfunction -1

exitfunction SEARCH_SearchPath(Path, SEARCH_PathSize(Path)-Move).Y + 0

endfunction -1

function SearchPathSize(Path as integer)

if SEARCH_PathsInitialised = 0 then exitfunction -1

if Path >= 0 or Path <= SEARCH_MaxPaths then exitfunction SEARCH_PathSize(Path) + 0

endfunction -1

function SetSearchRestrictDiagonals(Mode as integer)

if SEARCH_RestrictedDiagonals <> Mode

SEARCH_RestrictedDiagonals = Mode

SEARCH_ParametersChanged = 1

endif

endfunction

function SetSearchMaximumCost(Cost as integer)

if Cost > 0

Cost = Cost * 10

else

Cost = 0x0ccccccc

endif

if SEARCH_MaximumCost <> Cost

SEARCH_MaximumCost = Cost

SEARCH_ParametersChanged = 1

endif

endfunction

function SearchMapAStar4(Path as integer, SX as integer, SY as integer, TX as integer, TY as integer)

local X as integer

local Y as integer

local XOffset as integer

local YOffset as integer

local NewCost as integer

if SEARCH_MapInitialised = 0 then exitfunction -1

if SEARCH_PathsInitialised = 0 then exitfunction -1

if Path < 0 or Path > SEARCH_MaxPaths then exitfunction -1

if SEARCH_CellValid(SX, SY) then if SEARCH_CellValid(TX, TY)

SEARCH_LastSearch = 0

SEARCH_InitialiseTileInfo(SX,SY)

while SEARCH_GetLowestCostOpen() > 0

for YOffset = -1 to 1

Y = SEARCH_CurrentPosition.Y + YOffset

if Y >= 0 then if Y < SEARCH_MapHeight

for XOffset = -1 to 1

if (XOffset && YOffset) = 0

X = SEARCH_CurrentPosition.X + XOffset

if X >= 0 then if X < SEARCH_MapWidth

if SEARCH_TileInfo(X,Y).Status = 0

SEARCH_TileInfo(X,Y).ParentX = SEARCH_CurrentPosition.X

SEARCH_TileInfo(X,Y).ParentY = SEARCH_CurrentPosition.Y

if X = TX then if Y = TY then exitfunction SEARCH_BuildPath(Path,SX,SY,TX,TY)

SEARCH_TileInfo(X,Y).G = SEARCH_TileInfo(SEARCH_CurrentPosition.X,SEARCH_CurrentPosition.Y).G  + 10

SEARCH_TileInfo(X,Y).H = SEARCH_EstimateDistance(X,Y,TX,TY)

SEARCH_TileInfo(X,Y).F = SEARCH_TileInfo(X,Y).G + SEARCH_TileInfo(X,Y).H

if Cost < SEARCH_MaximumCost

SEARCH_AddToOpenList(X,Y)

SEARCH_TileInfo(X,Y).Status = 1

endif

else

if SEARCH_TileInfo(X,Y).Status = 1

NewCost = SEARCH_TileInfo(SEARCH_CurrentPosition.X,SEARCH_CurrentPosition.Y).G + 10

if SEARCH_TileInfo(X,Y).G > NewCost

SEARCH_TileInfo(X,Y).ParentX = SEARCH_CurrentPosition.X

SEARCH_TileInfo(X,Y).ParentY = SEARCH_CurrentPosition.Y

SEARCH_TileInfo(X,Y).G = NewCost

SEARCH_TileInfo(X,Y).F = NewCost + SEARCH_TileInfo(X,Y).H

SEARCH_AddToOpenList(X,Y)

endif

next XOffset

endif

next YOffset

endwhile

endif

exitfunction SEARCH_ClearPath(Path,SX,SY)

endfunction 0

function SearchMapAStar8(Path as integer, SX as integer, SY as integer, TX as integer, TY as integer)

local X as integer

local Y as integer

local XOffset as integer

local YOffset as integer

local NewCost as integer

if SEARCH_MapInitialised = 0 then exitfunction -1

if SEARCH_PathsInitialised = 0 then exitfunction -1

if Path < 0 or Path > SEARCH_MaxPaths then exitfunction -1

if SEARCH_CellValid(SX, SY) then if SEARCH_CellValid(TX, TY)

SEARCH_LastSearch = 1

SEARCH_InitialiseTileInfo(SX,SY)

while SEARCH_GetLowestCostOpen() > 0

for YOffset = -1 to 1

Y = SEARCH_CurrentPosition.Y + YOffset

if Y >= 0 and Y < SEARCH_MapHeight

for XOffset = -1 to 1

if (XOffset || YOffset) <> 0

X = SEARCH_CurrentPosition.X + XOffset

if (XOffset || YOffset) = 0 or X < 0

X=-1

else

` Restrict diagonals

if SEARCH_RestrictedDiagonals

if XOffset <> 0 then if YOffset <> 0

if SEARCH_TileInfo(SEARCH_CurrentPosition.X, Y).Status = 2

` This bit depends on X *not* being set to -1

if SEARCH_TileInfo(X, SEARCH_CurrentPosition.Y).Status = 2

X=-1

endif

if X >= 0 and X < SEARCH_MapWidth

if SEARCH_TileInfo(X,Y).Status = 0

SEARCH_TileInfo(X,Y).ParentX = SEARCH_CurrentPosition.X

SEARCH_TileInfo(X,Y).ParentY = SEARCH_CurrentPosition.Y

if X = TX

if Y = TY then exitfunction SEARCH_BuildPath(Path,SX,SY,TX,TY)

endif

SEARCH_TileInfo(X,Y).G = SEARCH_TileInfo(SEARCH_CurrentPosition.X,SEARCH_CurrentPosition.Y).G + SEARCH_SingleStepCost(XOffset,YOffset)

SEARCH_TileInfo(X,Y).H = SEARCH_EstimateDistance(X,Y,TX,TY)

SEARCH_TileInfo(X,Y).F = SEARCH_TileInfo(X,Y).G + SEARCH_TileInfo(X,Y).H

if SEARCH_TileInfo(X,Y).G < SEARCH_MaximumCost

SEARCH_AddToOpenList(X,Y)

SEARCH_TileInfo(X,Y).Status = 1

endif

else

if SEARCH_TileInfo(X,Y).Status = 1

NewCost = SEARCH_TileInfo(SEARCH_CurrentPosition.X,SEARCH_CurrentPosition.Y).G + SEARCH_SingleStepCost(XOffset,YOffset)

if SEARCH_TileInfo(X,Y).G > NewCost

SEARCH_TileInfo(X,Y).ParentX = SEARCH_CurrentPosition.X

SEARCH_TileInfo(X,Y).ParentY = SEARCH_CurrentPosition.Y

SEARCH_TileInfo(X,Y).G = NewCost

SEARCH_TileInfo(X,Y).F = NewCost + SEARCH_TileInfo(X,Y).H

SEARCH_AddToOpenList(X,Y)

endif

next XOffset

endif

next YOffset

endwhile

endif

exitfunction SEARCH_ClearPath(Path,SX,SY)

endfunction 0

function SearchMapFlood4(Path as integer, SX as integer, SY as integer, TX as integer, TY as integer)

local XOffset as integer

local YOffset as integer

local X as integer

local Y as integer

if SEARCH_MapInitialised = 0 then exitfunction -1

if SEARCH_PathsInitialised = 0 then exitfunction -1

if Path < 0 or Path > SEARCH_MaxPaths then exitfunction -1

if SEARCH_CellValid(SX, SY) then if SEARCH_CellValid(TX, TY)

if SEARCH_ParametersChanged = 1 or SEARCH_LastSearch <> 2

SEARCH_ParametersChanged = 0

SEARCH_PreviousStart.X = -9999

SEARCH_LastSearch = 2

endif

if SX <> SEARCH_PreviousStart.X or SY <> SEARCH_PreviousStart.Y

SEARCH_PreviousStart.X = SX

SEARCH_PreviousStart.Y = SY

SEARCH_PopulateTileInfo()

SEARCH_OpenListTop=-1

SEARCH_OpenListBottom=-1

SEARCH_TileInfo( SX, SY ).Status = 1

SEARCH_TileInfo( SX, SY ).ParentX = SX

SEARCH_TileInfo( SX, SY ).ParentY = SY

SEARCH_TileInfo( SX, SY ).F = 0

SEARCH_QueueOntoOpen(SX, SY)

while SEARCH_UnqueueFromOpen() > 0

for YOffset = -1 to 1

Y = SEARCH_CurrentPosition.Y + YOffset

if Y >= 0 then if Y < SEARCH_MapHeight

for XOffset = -1 to 1

if (XOffset && YOffset) = 0

X = SEARCH_CurrentPosition.X + XOffset

if X >= 0 then if X < SEARCH_MapWidth

if SEARCH_TileInfo( X, Y ).Status = 0

SEARCH_TileInfo( X, Y ).Status = 1

SEARCH_TileInfo( X, Y ).ParentX = SEARCH_CurrentPosition.X

SEARCH_TileInfo( X, Y ).ParentY = SEARCH_CurrentPosition.Y

SEARCH_TileInfo( X, Y ).F = SEARCH_TileInfo( SEARCH_CurrentPosition.X, SEARCH_CurrentPosition.Y ).F + 10

if SEARCH_TileInfo( X, Y ).F < SEARCH_MaximumCost then SEARCH_QueueOntoOpen(X, Y)

endif

next XOffset

endif

next YOffset

endwhile

endif

if SEARCH_TileInfo(TX,TY).Status > 0 then exitfunction SEARCH_BuildPath(Path,SX,SY,TX,TY)

endif

exitfunction SEARCH_ClearPath(Path,SX,SY)

endfunction 0

function SearchMapFlood8(Path as integer, SX as integer, SY as integer, TX as integer, TY as integer)

local XOffset as integer

local YOffset as integer

local X as integer

local Y as integer

local Cost as integer

if SEARCH_MapInitialised = 0 then exitfunction -1

if SEARCH_PathsInitialised = 0 then exitfunction -1

if Path < 0 or Path > SEARCH_MaxPaths then exitfunction -1

if SEARCH_CellValid(SX, SY) then if SEARCH_CellValid(TX, TY)

if SEARCH_ParametersChanged = 1 or SEARCH_LastSearch <> 3

SEARCH_ParametersChanged = 0

SEARCH_PreviousStart.X = -9999

SEARCH_LastSearch = 3

endif

if SX <> SEARCH_PreviousStart.X or SY <> SEARCH_PreviousStart.Y

SEARCH_PreviousStart.X = SX

SEARCH_PreviousStart.Y = SY

SEARCH_PopulateTileInfo()

SEARCH_TileInfo( SX, SY ).Status = 1

SEARCH_TileInfo( SX, SY ).ParentX = SX

SEARCH_TileInfo( SX, SY ).ParentY = SY

SEARCH_TileInfo( SX, SY ).F = 0

SEARCH_AddToOpenList(SX,SY)

SEARCH_SearchMode = 0

while SEARCH_GetLowestCostOpen() > 0

for YOffset = -1 to 1

Y = SEARCH_CurrentPosition.Y + YOffset

if Y >= 0 and Y < SEARCH_MapHeight

for XOffset = -1 to 1

X = SEARCH_CurrentPosition.X + XOffset

` Not the current cell (offsets both zero)

if (XOffset || YOffset) = 0 or X < 0

X=-1

else

` Restrict diagonals

if SEARCH_RestrictedDiagonals

if XOffset <> 0 then if YOffset <> 0

if SEARCH_TileInfo(SEARCH_CurrentPosition.X, Y).Status = 2

` This bit depends on X *not* being set to -1

if SEARCH_TileInfo(X, SEARCH_CurrentPosition.Y).Status = 2

X=-1

endif

if X >= 0 then if X < SEARCH_MapWidth

if SEARCH_TileInfo(X,Y).Status = 0

SEARCH_TileInfo( X, Y ).Status = 1

SEARCH_TileInfo( X, Y ).ParentX = SEARCH_CurrentPosition.X

SEARCH_TileInfo( X, Y ).ParentY = SEARCH_CurrentPosition.Y

Cost = SEARCH_TileInfo( SEARCH_CurrentPosition.X, SEARCH_CurrentPosition.Y ).F + SEARCH_SingleStepCost(XOffset,YOffset)

SEARCH_TileInfo( X, Y ).F = Cost

if Cost < SEARCH_MaximumCost then SEARCH_AddToOpenList(X,Y)

endif

next YOffset

endif

next XOffset

endwhile

endif

if SEARCH_TileInfo(TX,TY).Status > 0 then exitfunction SEARCH_BuildPath(Path,SX,SY,TX,TY)

endif

exitfunction SEARCH_ClearPath(Path,SX,SY)

endfunction 0

function GetFloodCost(TX as integer, TY as integer)

if SEARCH_MapInitialised = 0 then exitfunction -1

if SEARCH_PathsInitialised = 0 then exitfunction -1

if SEARCH_PreviousStart.X <> -9999 then exitfunction SEARCH_TileInfo(TX,TY).F + 0

endfunction -1

` **********************

` Internal-use functions

` **********************

function SEARCH_SingleStepCost(X as integer, Y as integer)

if X = 0 or Y = 0 then exitfunction 10

endfunction 14

function SEARCH_CellValid(X as integer, Y as integer)

if X >= 0 then if X <= SEARCH_MapWidth then if Y >= 0 then if Y <= SEARCH_MapWidth then exitfunction 1

endfunction 0

function SEARCH_EstimateDistance(X as integer, Y as integer, TX as integer, TY as integer)

local Distance as integer

Distance = (abs(X - TX) + abs(Y - TY))*10

endfunction Distance

function SEARCH_InitialiseTileInfo(SX as integer, SY as integer)

SEARCH_OpenListSize=0

SEARCH_PopulateTileInfo()

SEARCH_TileInfo(SX, SY).G = 0

SEARCH_TileInfo(SX, SY).H = SEARCH_EstimateDistance(SX, SY, TX, TY)

SEARCH_TileInfo(SX, SY).F = SEARCH_TileInfo(SX, SY).H

SEARCH_TileInfo(SX, SY).Status = 1

SEARCH_TileInfo(SX, SY).ParentX = SX

SEARCH_TileInfo(SX, SY).ParentY = SY

SEARCH_AddToOpenList(SX, SY)

endfunction

function SEARCH_PopulateTileInfo()

local X as integer

local Y as integer

for Y = 0 to SEARCH_MapHeight

for X = 0 to SEARCH_MapWidth

if SEARCH_Map(X,Y) > 0

SEARCH_TileInfo(X,Y).Status = 2

else

SEARCH_TileInfo(X,Y).F = 0

SEARCH_TileInfo(X,Y).Status = 0

endif

next X

next Y

endfunction

function SEARCH_AddToOpenList(X as integer, Y as integer)

local Parent as integer

local Child as integer

local Cost as integer

Child = SEARCH_OpenListSize

inc SEARCH_OpenListSize

Cost = SEARCH_TileInfo(X,Y).F

if Child <= 0 then exit

Parent=(Child - 1)/2

if SEARCH_OpenList(Parent).F < Cost then exit

SEARCH_OpenList(Child).F = SEARCH_OpenList(Parent).F

SEARCH_OpenList(Child).X = SEARCH_OpenList(Parent).X

SEARCH_OpenList(Child).Y = SEARCH_OpenList(Parent).Y

Child = Parent

loop

SEARCH_OpenList(Child).F = Cost

SEARCH_OpenList(Child).X = X

SEARCH_OpenList(Child).Y = Y

endfunction

function SEARCH_GetLowestCostOpen()

local Parent as integer

local Child as integer

local Cost as integer

repeat

if SEARCH_OpenListSize <= 0 then exitfunction 0

dec SEARCH_OpenListSize

SEARCH_CurrentPosition.X = SEARCH_OpenList(0).X

SEARCH_CurrentPosition.Y = SEARCH_OpenList(0).Y

Cost = SEARCH_OpenList( SEARCH_OpenListSize ).F

X = SEARCH_OpenList( SEARCH_OpenListSize ).X

Y = SEARCH_OpenList( SEARCH_OpenListSize ).Y

Parent=0

Child=(2 * Parent) + 1

if Child >= SEARCH_OpenListSize then exit

if Child+1 < SEARCH_OpenListSize

if SEARCH_OpenList(Child).F > SEARCH_OpenList(Child + 1).F then inc Child

endif

if SEARCH_OpenList(Child).F >= Cost then exit

SEARCH_OpenList(Parent).F = SEARCH_OpenList(Child).F

SEARCH_OpenList(Parent).X = SEARCH_OpenList(Child).X

SEARCH_OpenList(Parent).Y = SEARCH_OpenList(Child).Y

Parent = Child

loop

SEARCH_OpenList(Parent).F = Cost

SEARCH_OpenList(Parent).X = X

SEARCH_OpenList(Parent).Y = Y

until SEARCH_TileInfo(SEARCH_CurrentPosition.X,SEARCH_CurrentPosition.Y).Status <> 2

SEARCH_TileInfo(SEARCH_CurrentPosition.X,SEARCH_CurrentPosition.Y).Status = 2

endfunction 1

function SEARCH_QueueOntoOpen(X as integer, Y as integer)

inc SEARCH_OpenListTop

SEARCH_OpenList( SEARCH_OpenListTop ).X = X

SEARCH_OpenList( SEARCH_OpenListTop ).Y = Y

endfunction

function SEARCH_UnqueueFromOpen()

if SEARCH_OpenListBottom => SEARCH_OpenListTop then exitfunction 0

inc SEARCH_OpenListBottom

SEARCH_CurrentPosition.X = SEARCH_OpenList( SEARCH_OpenListBottom ).X

SEARCH_CurrentPosition.Y = SEARCH_OpenList( SEARCH_OpenListBottom ).Y

endfunction 1

function SEARCH_BuildPath(Path as integer, SX as integer, SY as integer, TX as integer, TY as integer)

Moves = 0

X = TX

Y = TY

SEARCH_SearchPath(Path, Moves).X = X

SEARCH_SearchPath(Path, Moves).Y = Y

repeat

inc Moves

SEARCH_SearchPath(Path, Moves).X = SEARCH_TileInfo(X,Y).ParentX

SEARCH_SearchPath(Path, Moves).Y = SEARCH_TileInfo(X,Y).ParentY

X = SEARCH_SearchPath(Path, Moves).X

Y = SEARCH_SearchPath(Path, Moves).Y

until X = SX and Y = SY

SEARCH_PathSize(Path) = Moves

endfunction Moves

function SEARCH_ClearPath(Path as integer, SX as integer, SY as integer)

SEARCH_SearchPath(Path, 0).X=SX

SEARCH_SearchPath(Path, 1).Y=SY

SEARCH_PathSize(Path)=0

endfunction 0

Download

Please login to download

Comments

No comments yet.

Author Name:	IanM
CodeBase Entries:	26

CodeBase - Fast search routines

Information

Summary

Full Description

DarkBASIC Professional Source Code

Download

Screen Shot

Author

Comments