programming

Searching (Part 1)

Here are three things that I learned at uni that blew my mind: All searches are tree traversals All search strategies can be implemented by choosing the right queue Every (AI) problem can be expressed as a search Let's look at all three of these statements in turn. All searches are tree traversals Let's look at a couple of examples for searches: Check whether an XML document contains a node-tag.