some examples for using specific searchalgorithm
- by Robert
I could understand the following search algorithms:
Constraint Satisfaction with Arc Consistency,
Uninformed search
A* Search
MinMax
I would understand the definition and working principles of the above algorithm,but could you please give me some real world examples that the above algorithms will be suitable?My idea would be: For CSP with Arc Consistency,assign students to groups that each group must contain both technical and management students,and no 2 technical students in a same group.
Uniformed Search: search for a file under UNIX directoy.
A* Search: search a way (staring from home) to go to mulitple stores to buy things then get back home with minimum total travelling time.
MinMax:Go or other Chess.
Please correct me if I am wrong.