Revision as of 07:29, 6 July 2004 edit Frikle (talk \| contribs) 459 edits split into headings ← Previous edit		Revision as of 07:33, 6 July 2004 edit undo Frikle (talk \| contribs) 459 edits intro to uninformed search Next edit →
Line 5: == Uninformed Search == An uninformed search algorithm is one that does not take into account the specific nature of the problem. As such, they can be implemented in general, and then the same implementation can be used in a wide range of problems thanks to abstraction. The drawback is that most search spaces are extremely large, and an uninformed search (especially of a tree) will only take a reasonable amount of time for small examples. As such, to speed up the process, sometimes only an informed search will do. === List Search ===

Search algorithm: Difference between revisions