#Custom enemys
1 messages · Page 1 of 1 (latest)
I don’t think you can do that without RRS or Rec room studio
You can try the Breadth First Search algorithm, in my opinion it is the easiest to do, this algorithm is for pathfinding.
ok ill look it up
Breadth first or Best first?
Both are easy, but the easiest of these two would be best first search, but I think Breadth is a little better
Is there pseudo code I can find for breadth?
Wait a minute, I think I know where to get one
BFS(graph, start, goal):
create an empty queue Q
create an empty set visited
enqueue start to Q
mark start as visited
while Q is not empty:
node = dequeue Q
if node is goal:
return "Found goal"
for each neighbor of node in graph:
if neighbor is not visited:
enqueue neighbor to Q
mark neighbor as visited
return "Goal not found"
Use as a base, but not for the entire algorithm, pseudocodes are not that descriptive, so it can be a little difficult to implement, try searching with explanatory videos demonstrating the algorithm