Searching Algorithms Flashcards
Name every type of search algorithm
-generic search algorithm
-BFS
-DFS
-Limited DFS
-Iterative deepening search
-A* Algorithm
-Greedy Search
How the generic Search algorithm work
Checks every value randomly
Describe the Breadth-First Search Algorithm
Complete ,Optimal, deterministic
Describe the Depth-First Algorithm
InComplete, inoptimal, nonDeterministic
Describe the Depth First Search Algorithm
InComplete, nonOptimal, nondeterministic
Describe the Limited Depth Search Algorithm
Incomplete, nonoptimal
Iterative Depth First Search
Complete, optimal
Uniform Cost Search Algorithm
if the cost of all the nodes is the same then this is just depth-first search
-all costs must be positive,
- complete, optimal, determinastic
what is a heuristic value
an estimate of the cost from any node to the goal node, this might not be accurate to the true value
how does the greedy search algorithm work
the greedy algorithm always takes the lowest heuristic value without taking into consideration the actual cost value of each node
describe the greedy search algorithm
compete, nonoptimal, nondeterministic
how does the A* algorithm work
the algorithm always checks the value where total cost + heuristic is lowest
describe the A* algorithm
Complete, nonoptimal, Deterministic
what is minimax algorithm
A game Algorithm where alternate turns is taken between Min and Max where Min is minimising the utility value and Max is trying to Maximise the utility value
so min always takes the lowest value possible and max always takes the highest value possible
