COMP 4106 Lecture 3: Blind Search

• School: Carleton University
• Department: Computer Science
• Course: COMP 4106
• Professor: John Oommen

Document Summary

Comp (cid:1008)(cid:1005)(cid:1004)6 chapter (cid:1007): blind search: bli(cid:374)d sear(cid:272)h (cid:271)e(cid:272)ause (cid:455)ou are (cid:862)(cid:271)li(cid:374)dl(cid:455) follo(cid:449)i(cid:374)g (cid:455)our produ(cid:272)tio(cid:374) s(cid:455)ste(cid:373)(cid:863). In comp 3804, view this as a graph where you can do a search and find the shortest path from point a to b. Difference is the graph is not given to you and do not know distance of edges. Just k(cid:374)o(cid:449) (cid:449)e are at poi(cid:374)t a a(cid:374)d (cid:449)a(cid:374)t to get to poi(cid:374)t b. Are paths that connects the states to others. Just know you can go from one to a certain set of other (just know neighbours). In ai given as little detail as the problem can provide you. Come up with as sequence of states to get to goal state: single-state problem formulation, a problem is defined by four items, 1. Actions or successor function s(x) = set of action state pairs: e. g. , s(arad) = {, , 3. This can be: explicit, e. g. , x = (cid:862)at bu(cid:272)harest(cid:863)