Please enable JavaScript.
Coggle requires JavaScript to display documents.
Pathfinding algorithms - Coggle Diagram
Pathfinding algorithms
Graph search
Uninformed search (blind)
Uninformed search is a blind search algorithm that investigates the search space of a problem without the aid of heuristics or additional information. Without taking into account the objective or the layout of the search space, it explores paths haphazardly.
-
-
-
-
-
-
Informed search (Heuristic)
Informed search refers to search algorithms that utilize additional knowledge or heuristics to guide the exploration of a problem's search space
Best First Search
Using the evaluation function, the node was extended.
-
-
-
-
Binary Search Tree
It adheres to a particular property where a node's left child has smaller values and its right child has greater values. With logarithmic time complexity, this trait makes searching, insertion, and deletion operations efficient.
Genetic algorithms
Terminilogy
Genetic operators
Crossover and mutation, two genetic operators, alter people to produce novel solutions in the following generation. Crossover unites a parent's genetic material,
Selection
Selection chooses individuals with higher fitness as parents for the next generation based on their fitness scores.
Population
Operates on a population of potential solutions, where each person stands in for a potential fix for the issue.
Fitness Function
A fitness function assesses and rates people according to how well they can provide a solution.
-
Slime mould
A primitive creature made up of a mass of amoeboid cells or an acellular mass of crawling, jelly-like protoplasm containing nuclei. It produces a significant number of spore cases once it reaches a particular size.