Optimal search trees Finding the best possible sequence of choices. Getting closer to the goal is generally considered good, but it may lead to dead ends or non-optimal choices. Oracle Knowing the minimum path length to the goal, the search…
4. Search: Depth-First, Hill Climbing, Beam
Search trees Search trees represent all the possibilities to search for the quickest path without coming back to previous paths. They are particularly used for quickest paths on maps with nodes (intersections), but not exclusively. They are primarily about choices,…
3. Reasoning: Goal Trees and Rule-Based Expert Systems
Reporting on a Goal Tree program A Goal Tree program can answer questions about its own behavior by reporting steps up (why questions) or down (how questions) in the actions it takes. Simon’s Ant The complexity of a program’s behavior…
1. Introduction and scope
What is Artifical Intelligence? Algorithms, enabled by constraints, exposed by representations, that support the building of models targeted at thinking, perception and action, and the loops that tie them together. Artificial Intelligence is applied through problem solving procedures, methods, techniques…