I'll create a custom pathfinding algorithm for Roblox that attempts to find paths to the nearest player. This will be a simplified A* (A-star) implementation with some optimizations. local Pathfinder = {} Pathfinder.__index = Pathfinder function Pathfinder.new(character) local self = setmetatable({}, Pathfinder) self.Character = character self.Humanoid = character:FindFirstChildOfClass("Humanoid") self.RootPart = character:FindFirstChild("HumanoidRootPart") return self end function Pathfinder:FindNearestPlayer() local players = game:GetService("Players"):GetPlayers() local nearestPlayer = nil local minDistance = math.huge for _, player in ipairs(players) do if player ~= game:GetService("Players").LocalPlayer and player.Character then local humanoidRootPart = player.Character:FindFirstChild("HumanoidRootPart") if humanoidRootPart then local distance = (self.RootPart.Position - humanoidRootPart.Position).Magnitude if distance < minDistance then minDistance = distance nearestPlayer = player end end end end return nearestPlayer end function Pathfinder:GetWalkablePoints(position, radius, heightCheck) local walkablePoints = {} local raycastParams = RaycastParams.new() raycastParams.FilterDescendantsInstances = {workspace.Terrain} raycastParams.FilterType = Enum.RaycastFilterType.Blacklist for angle = 0, 360, 45 do local x = position.X + math.cos(math.rad(angle)) * radius local z = position.Z + math.sin(math.rad(angle)) * radius local rayOrigin = Vector3.new(x, position.Y + 5, z) local rayDirection = Vector3.new(0, -10, 0) local raycastResult = workspace:Raycast(rayOrigin, rayDirection, raycastParams) if raycastResult then local hitPosition = raycastResult.Position if heightCheck then if math.abs(hitPosition.Y - position.Y) < 3 then table.insert(walkablePoints, hitPosition) end else table.insert(walkablePoints, hitPosition) end end end return walkablePoints end function Pathfinder:Heuristic(a, b) return (a - b).Magnitude end function Pathfinder:ReconstructPath(cameFrom, current) local path = {current} while cameFrom[current] do current = cameFrom[current] table.insert(path, 1, current) end return path end function Pathfinder:FindPath(startPos, endPos) local openSet = {} local cameFrom = {} local gScore = {} local fScore = {} gScore[startPos] = 0 fScore[startPos] = self:Heuristic(startPos, endPos) table.insert(openSet, startPos) while #openSet > 0 do table.sort(openSet, function(a, b) return (fScore[a] or math.huge) < (fScore[b] or math.huge) end) local current = table.remove(openSet, 1) if (current - endPos).Magnitude < 5 then return self:ReconstructPath(cameFrom, current) end local neighbors = self:GetWalkablePoints(current, 5, true) for _, neighbor in ipairs(neighbors) do local tentativeGScore = (gScore[current] or math.huge) + (current - neighbor).Magnitude if tentativeGScore < (gScore[neighbor] or math.huge) then cameFrom[neighbor] = current gScore[neighbor] = tentativeGScore fScore[neighbor] = gScore[neighbor] + self:Heuristic(neighbor, endPos) local found = false for _, v in ipairs(openSet) do if v == neighbor then found = true break end end if not found then table.insert(openSet, neighbor) end end end end return nil -- No path found end function Pathfinder:VisualizePath(path) if self.Visualization then self.Visualization:Destroy() end self.Visualization = Instance.new("Folder") self.Visualization.Name = "PathVisualization" self.Visualization.Parent = workspace for i = 1, #path - 1 do local part = Instance.new("Part") part.Size = Vector3.new(0.2, 0.2, (path[i] - path[i+1]).Magnitude) part.CFrame = CFrame.new((path[i] + path[i+1]) / 2, path[i+1]) part.Anchored = true part.CanCollide = false part.Transparency = 0.5 part.Color = Color3.fromRGB(0, 255, 0) part.Parent = self.Visualization end end function Pathfinder:StartTracking() self.Tracking = true spawn(function() while self.Tracking and self.Character and self.Humanoid and self.Humanoid.Health > 0 do local nearestPlayer = self:FindNearestPlayer() if nearestPlayer and nearestPlayer.Character then local targetRoot = nearestPlayer.Character:FindFirstChild("HumanoidRootPart") if targetRoot then local path = self:FindPath(self.RootPart.Position, targetRoot.Position) if path then self:VisualizePath(path) -- Move along the path for i = 1, #path do if not self.Tracking then break end self.Humanoid:MoveTo(path[i]) local reached = false local connection connection = self.Humanoid.MoveToFinished:Connect(function(reached) if reached then connection:Disconnect() reached = true end end) repeat wait(0.1) until reached or not self.Tracking end end end end wait(0.5) end end) end function Pathfinder:StopTracking() self.Tracking = false if self.Visualization then self.Visualization:Destroy() end end return Pathfinder local Pathfinder = require(script.Parent.Pathfinder) local character = script.Parent -- Assuming this script is in the character local pathfinder = Pathfinder.new(character) -- Start tracking the nearest player pathfinder:StartTracking() -- To stop tracking later: -- pathfinder:StopTracking() This implementation includes: 1. A* pathfinding algorithm with heuristic 2. Dynamic obstacle detection using raycasting 3. Path visualization 4. Continuous tracking of the nearest player 5. Movement along the calculated path The algorithm will: - Find the nearest player - Calculate a path using A* with walkable points detection - Visualize the path with green parts - Move the character along the path - Continuously update the path as the target moves