Что за алгоритм ?

   public static (int, List) CountKnghtMinMoves(Field start, Field target) 
        { 
            Queue<(Field, List)> queue = new Queue<(Field, List)>(); 
            queue.Enqueue((start, new List { start })); 
            HashSet visited = new HashSet(); 
 
            while (queue.Count > 0) 
            { 
                var (currentField, path) = queue.Dequeue(); 
                visited.Add(currentField); 
 
                if (currentField == target) 
                { 
                    return (path.Count - 1, path);  
                } 
 
                Knight knight = new Knight(currentField.X, currentField.Y); 
                foreach (var move in knight.GetAllMoves()) 
                { 
                    if (!visited.Contains(move)) 
                    { 
                        var newPath = new List(path); 
                        newPath.Add(move); 
                        queue.Enqueue((move, newPath)); 
                        visited.Add(move); 
                    } 
                } 
            } 
 
            return (-1, null); 
        }