Two one Problem artificial intelligence
- 1. 1 1 ? 2 2 2 2 ? 1 1 Start Goal Rules: • 1s’ move right • 2s’ move left • Only one move at a time • No backing up Legal Moves: • Slide • Hop
- 2. 1 1 ? 2 2 Trial One 1 1 2 ? 2 1 ? 2 1 2 1 2 ? 1 2 1 2 2 1 ? 1 2 2 ? 1 1 1 ? 2 2 Trial Two 1 ? 1 2 2 ? 1 1 2 2 Stuck!!! Stuck!!!
- 4. 1 1 ? 2 2? 1 1 2 2 1 1 2 2 ? 1 ? 1 2 2 1 1 2 ? 2 1 2 1 ? 2? 1 1 2 2 1 1 2 2 ?1 ? 2 1 2 1 2 1 2 ? 1 2 ? 1 2 ? 1 2 1 2 ? 2 1 1 2 1 2 2 1 ? 2 1 ? 1 21 2 ? 2 1 1 2 2 ? 1 ? 2 1 2 1 2 ? 1 1 2 1 2 2 ?1 2 1 1 2 ? 2 ? 1 1 2 2 ? 1 2 1 2 1 2 ? 1 2 2 1 ? 1 2 ? 2 1 1 2 2 ? 1 1 H H S S S H H S S S S S S H S S H S S S H H S S H H H H
- 5. 1 1 ? 2 2? 1 1 2 2 1 1 2 2 ? 1 ? 1 2 2 1 1 2 ? 2 1 2 1 ? 2? 1 1 2 2 1 1 2 2 ?1 ? 2 1 2 1 2 1 2 ? 1 2 ? 1 2 ? 1 2 1 2 ? 2 1 1 2 1 2 2 1 ? 2 1 ? 1 21 2 ? 2 1 1 2 2 ? 1 ? 2 1 2 1 2 ? 1 1 2 1 2 2 ? 1 2 1 1 2 ? 2 ? 1 1 2 2 ? 1 2 1 2 1 2 ? 1 2 2 1 ? 1 2 ? 2 1 1 2 2 ? 1 1 H H S S S H H S S S S S S H S S H S S S H H S S H H H H
- 6. A B C D E F G H I J •“A” is the “root node” •“A, B, C …. J” are “nodes” •“B” is a “child” of “A” •“A” is ancestor of “D” •“D” is a descendant of “A” •“D, E, F, G, I, J” are “leaf nodes” •Arrows represent “edges” or “links”
- 8. The search methods we’ll be dealing with are defined on trees and graphs S G FE CB D A 2 3 3 3 1 3 2 4 4
- 9. Graph search is really tree search S G FE CB D A 2 3 3 3 1 3 2 4 4 S A D B D A E C E D F G E B F C G B C E F G B F A C G
- 10. Graph search is really tree search S G FE CB D A 2 3 3 3 1 3 2 4 4 S A D B D A E C E D F G E B F C G B C E F G B F A C G
Editor's Notes
- #5: Initial state Goal state-target space Operator-slide, hop Solution space
- #8: However, graphs can also be much more abstract. Think of the graph defined as follows: the nodes denote descriptions of a state of the world, e.g. which blocks are on top of what in a blocks scene, and where the links represent actions that change from one state to the other. A path through such a graph (from a start node to a goal node) is a "plan of action" to achieve some desired goal state from some known starting state. It is this type of graph that is of more general interest in AI.
- #9: Comment on it from Winston Figure 4.1