1. n Course written by Richard E. Korf, UCLA. n The slides were made by students of this course from Bar-ilan University, Tel-Aviv, Israel.

3. Problems There are 3 general categories of problems in AI: n Single-agent pathfinding problems. n Two-player games. n Constraint satisfaction problems.

4. Single Agent Pathfinding Problems n In these problems, in each case, we have a single problem-solver making the decisions, and the task is to find a sequence of primitive steps that take us from the initial location to the goal location.

5. Famous Example Domains 15 puzzle n 10^13 states n First solved by [Korf 85] with IDA* and Manhattan distance 24 puzzle n 10^24 states n First solved by [Korf 96] 123 4567 891011 12131415 2021222324 1234 56789 1011121314 1516171819

6. Rubik’s cube n 10^19 states n First solved by [Korf 97] Traveling Salesman Problem Famous Example Domains

7. Two-Player Games n In a two-player game, one must consider the moves of an opponent, and the ultimate goal is a strategy that will guarantee a win whenever possible. n Two-player perfect information have received the most attention of the researchers untill now. n But, nowadays, researchers are starting to consider more complex games, many of them involve an element of chance. n The best Chess, Checkers, and Othello players in the world are computer programs!

8. Constraint-Satisfaction Problems n In these problems, we also have a single-agent making all the decisions, but here we are not concerned with the sequence of steps required to reach the solution, but simply the solution itself. n The task is to identify a state of the problem, such that all the constraints of the problem are satisfied. n Famous Examples: u Eight Queens Problem. u Number Partitioning.

9. Problem Spaces states operators n A problem space consists of a set of states of a problem and a set of operators that change the state. u State u State : a symbolic structure that represents a single configuration of the problem in a sufficient detail to allow problem solving to proceed. u Operator u Operator : a function that takes a state and maps it to another state.

10. preconditions n Not all operators are applicable to all states. The conditions that must be true in order for an operator to be legally applied to a state are known as the preconditions of the operator. n Examples: u 8-Puzzle : F states F states: the different permutations of the tiles. F operators F operators:moving the blank tile up, down, right or left.  Chess: F states: F states:the different locations of the pieces on the board. F operators F operators: legal moves according to chess rules. Problem Spaces

11. n A problem instance n A problem instance: consists of a problem space, an initial state, and a set of goal states. n There may be a single goal state, or a set of goal states, anyone of which would satisfy the goal criteria. In addition, the goal could be stated explicitly or implicitly, by giving a rule of determining when the goal has been reached. n All 4 combinations are possible: Problem Spaces [single\set of goal state(s)]  [explicit\implicit].

12. n For Constraint Satisfaction Problems, the goal will always be represented implicitly, since an explicit description is the solution itself. n Example: u 4-Queens has 2 different goal states. Here the goal is stated explicitly. Problem Spaces Q Q Q Q Q QQ QQQ

13. Problem Representation n For some problems, the choice of a problem space is not so obvious. n The choice of representation for a problem can have an enormous impact on the efficiency of solving the problem. n There are no algorithms for problem representation. One general rule is that a smaller representation, in the sense of fewer states to search, is often better than a larger one.

14. n For example, in the 8-Queens problem, when every state is an assignment of the 8 queens on the board: over4 billion u The number of possibilities with all 8 queens on the board is 64 choose 8, which is over 4 billion. 16 million u The solution of the problem prohibits more than one queen per row, so we may assign each queen to a separate row, now we’ll have 8 8 > 16 million possibilities. 40,320 u Same goes for not allowing 2 queens in the same column either, this reduces the space to 8!, which is only 40,320 possibilities. Problem Representation

15. Problem-Space Graphs n A Problem-Space Graph is a mathematical abstraction often used to represent a problem space: The statesnodes The states are represented by nodes of the graph. The operatorsedges The operators are represented by edges between nodes. n Edges may be undirected or directed.

16. n Example: a small part of the 8-puzzle problem-space graph: Problem-Space Graphs

17. n In most problems spaces there is more than one path between a pair of nodes. n Detecting when the same state has been regenerated via a different path requires saving all the previously generated states, and comparing newly generated states against the saved states. n Many search algorithms don’t detect when a state has previously been generated. The cost of this is that any state that can be reached by 2 different paths will be represented by duplicate nodes. The benefits are memory savings and simplicity. Problem-Space Graphs

18. branching factor of a node n The branching factor of a node : u is the number of children it has, not counting its parent if the operator is reversible. u is a function of the problem space. branching factor of a problem space n The branching factor of a problem space : u is the average number of children of the nodes in the space. solution depth n The solution depth in a single-agent problem: u is the length of the shortest path from the initial node to a goal node. u is a function of the particular problem instance. Branching Factor and Solution Depth

19. n In many cases we can reduce the size of the search tree, by eliminating some simple duplicate paths. n In general, u we never apply an operator and it’s inverse in succession, since no optimal path can contain such a sequence. u Therefore we never list the parent of a node as one of his children. u This reduces the branching factor of the problem by approximately 1. Eliminating Duplicate Nodes

20. Types of Problem Spaces n There are several types of problem spaces: u State space (OR graphs) u Problem Reduction Space (AND graphs) u Games (AND/OR Graphs)

21. State Space states n The states represent situations of the problem. operators n The operators represent actions in the world. u forward search u forward search: the root of the problem space represents the start state, and the search proceeds forward to a goal state. u backward search u backward search : the root of the problem space represents the goal state, and the search proceeds backward to the initial state. n For example: in Rubik’s Cube and the Sliding-Tile Puzzle, either a forward or backward search are possible. n This can be considered as an OR graph because the solution picks one branch at each node.

22. n In a problem reduction space, the nodes represent problems to be solved or goals to be achieved, and the edges represent the decomposition of the problem into subproblems. n This is best illustrated by the example of the Towers of Hanoi problem. n This is an AND graph Problem Reduction Space CAB ACB

23. 2AB 3AC 1AC2BC 1AC 1AB1CB 1BA 1BC1AC Problem Reduction Space n The root node, labeled “3AC” represents the original problem of transferring all 3 disks from peg A to peg C. n The goal can be decomposed into three subgoals: 2AB, 1AC, 2BC. In order to achieve the goal, all 3 subgoals must be achieved.

24. Problem Reduction Space 3AC CAB

25. Problem Reduction Space 3AC 2AB 1AC CAB

26. Problem Reduction Space 3AC 2AB 1AC 1AB CAB

27. Problem Reduction Space CAB 3AC 2AB 1AC 1AB 1CB

28. Problem Reduction Space CAB 3AC 2AB 1AC 1AB 1CB 1AC

29. Problem Reduction Space 3AC 2AB 1AC 1AB 1CB 1AC2BC 1BA CAB

30. Problem Reduction Space 3AC 2AB 1AC 1AB 1CB 1AC2BC 1BA 1BC CAB

31. Problem Reduction Space CAB 3AC 2AB 1AC 1AB 1CB 1AC2BC 1BA 1BC 1AC

32. all n An AND graph consists entirely of AND nodes, and in order to solve a problem represented by it, you need to solve the problems represented by all of his children (Hanoi towers example). one n An OR graph consists entirely of OR nodes, and in order to solve the problem represented by it, you only need to solve the problem represented by one of his children (Eight Puzzle Tree example). AND/OR Graphs

33. n An AND/OR graph consists of both AND nodes and OR nodes. n One source of AND/OR graphs is a problem where the effect of an action cannot be predicted in advanced, as in an interaction with the physical world. n Example: u the counterfeit-coin problem. AND/OR Graphs

34. Two-Player Game Trees n The most common source of AND/OR graphs is 2-player perfect-information games. n Example: Game Tree for 5-Stone Nim: 5 43 3 221 2110100 10000 0 OR nodes AND nodes x x

35. Solution subgraph for AND/OR trees n In general, a solution to an AND/OR graph is a sub graph with the following properties: u It contains the root node. For every OR node included in the solution sub graph, one child is included. u For every AND node included in the solution subgraph, all the children are included. u Every terminal node in the solution subgraph is a solved node.

36. Solutions n The notion of a solution is different for the different problem types: u For a path-finding problem, an optimal solution is a solution of lowest cost. u For a CSP, if there is a cost function associated with a state of the problem, an optimal solution would again be one of lowest cost. u For a 2-player game: F If the solution is simply a move to be made, an optimal solution would be the best possible move that can be made in a given situation. F If the solution is considered a complete strategy subgraph, then an optimal solution might be one that forces a win in the fewest number of moves in the worst case.

37. Combinatorial Explosion n The number of different states of the problems above is enormous, and grows extremely fast as the problem size increases. n Examples for the number of different possibilities:

38. n The combinatorial explosion of the number of possible states as a function of problem size is a key characteristic that separates artificial intelligence search algorithms in other areas of computer science. n Techniques that rely on storing all possibilities in memory, or even generating all possibilities, are out of the question except for the smallest of these problems. As a result, the problem-space graphs of AI problems are usually represented implicitly by specifying an initial state and a set of operators to generate new states. Combinatorial Explosion

39. Search Algorithms n This course will focus on systematic search algorithms that are applicable to the different problem types, so that a central concern is their efficiency. n There are 4 primary measures of efficiency of a search algorithm: u The completeness of the algorithm (whether it returns a solution in the end??) u The quality of the solution returned. Optimal, near-optimal (e-optimal) or sub optimal u The running time of the algorithm. u The amount of memory required by the algorithm

40. Chapter 2 : brute force searches. Chapter 3 : heuristic search algorithms. Chapter 4 : search algorithms that run in linear space. Chapter 5 : search algorithms for the case where individual moves of a solution must be executed in the real world before a complete optimal solution can be computed. Chapter 6 : methods for deriving the heuristic function Chapter 7 : 2-player perfect-information games. Chapter 8 : analysis of alpha-beta minimax. Chapter 9 : games with more than 2 players. Chapter 10: the decision quality of minimax. Chapter 11: automatic learning of heuristic functions for 2-player games. Chapter 12: Constraint Satisfaction Problems. Chapter 13: parallel search algorithms. The Next Chapters

42. Brute-Force Search n The most general search algorithms are Brute-Force searches, that do not use any domain specific knowledge. n It requires: u a state description u a set of legal operators u an initial state u a description of the goal state. n We will assume that all edges have unit cost. n To generate n To generate a node means to create the data structure corresponding to that node. n To expand n To expand a node means to generate all the children of that node.

43. Breadth-First Search (BFS) n BFS expands nodes in order of their depth from the root. n Generating one level of the tree at a time. n Implemented by first-in first-out (FIFO) queue. n At each cycle the node at the head of the queue is removed and expanded, and its children are placed at the end of the queue.

44. Breadth-First Search (BFS) The numbers represent the order generated by BFS 0 1 2 c34 c c 5 6 78 1313 1414 c 9 1010 1 1212

45. Solution Quality n BFS continues until a goal node is generated. n Two ways to report the actual solution path: u Store with each node the sequence of moves made to reach that node. u Store with each node a pointer back to his parent - more memory efficient. n If a goal exists in the tree BFS will find a shortest path to a goal.

46. Time Complexity n We assume : u each node can be generated in constant time u function of the branching factor b and the solution depth d u number of nodes depends on where at level d the goal node is found. u the worst case - have to generate all the nodes at level d. n N(b,d) - total number of nodes generated.

47. Time Complexity Time Complexity of BFS is O(b d )

48. Space Complexity n To report the solution we need to store all nodes generated. n Example: Machine speed = 1GHz Generated a new state in 100 Instruction 10^7 nodes/sec node size = 4 bytes total memory = 2GB=2*10^9 byte nodes’ capacity=2*10^9/4=500*10^6 After 50 seconds = 1 minute the memory is exhausted ! Space Complexity=Time Complexity= O(b d )

49. Space Complexity n The previous example based on current technology. n The problem won’t go away since as memories increase in size, processors get faster and our appetite to solve larger problem grows. n BFS and any algorithm that must store all the nodes are severely space-bound and will exhaust the memory in minutes.

50. Depth-First Search (DFS) n DFS generates next a child of the deepest node that has not been completely expanded yet. n First Implementation n First Implementation is by last in first out (LIFO) stack. AKA depth-first expansion u At each cycle the node at the head of the stack is removed and expanded, and its children are placed on top of the stack.

51. DFS - stack implementation The numbers represent the order generated by DFS 0 1 2 c34 c c 9 1010 56 1313 1414 c 7 8 1 1212

52. Depth-First Search (DFS) n Second Implementation n Second Implementation is recursive. u The recursive function takes a node as an argument and perform DFS below that node. This function will loop through each of the node’s children and make a recursive call to perform a DFS below each of the children in turn. u AKA depth-first generation

53. DFS - recursive implementation The numbers represent the order generated by DFS 0 1 8 c25 c c 9 1212 34 1313 1414 c 6 7 10101

54. Space Complexity n The space complexity is linear in the maximum search depth. n d is the maximum depth of search and b is the Branching Factor. Depth-first generation stores O(d) nodes. Depth-first expansion stores O(b^d) nodes. n DFS is time-limited rather than space-limited.

55. Time Complexity and Solution Quality n DFS generate the same set of nodes as BFS. n However, on infinite tree DFS may not terminate. u For example: Eight puzzle contain 181,440 nodes but every path is infinitely long and thus DFS will never end. Time Complexity of DFS is O(b d )

56. Time Complexity and Solution Quality n The solution for infinite tree is to impose an artificial Cutoff depth on the search. n If the chosen cutoff depth is less than d, the algorithm won’t find a solution. n If the cutoff depth is greater than d, time complexity is larger than BFS. n The first solution DFS found may not be the optimal one.

57. Depth-First Iterative-Deepening (DFID) n Combines the best features of BFS and DFS. n DFID first performs a DFS to depth one. Then starts over executing DFS to depth two. Continue to run DFS to successively greater depth until a solution is found.

58. The numbers represent the order generated by DFID 0 1,3, 9 2,6,1 6 c 4,1 0 5,1 3 c 7,1 7 8,2 0 11122122 c 14 15 1819 Depth-First Iterative-Deepening (DFID)

59. Solution Quality n DFID never generates a node until all shallower nodes have already been generated. n The first solution found by DFID is guaranteed to be along a shortest path.

60. Space Complexity n Like DFS, at any given point DFID saving only a stack of nodes. The space complexity is only O(d)

61. Time Complexity n DFID do not waste a great deal of time in the iterations prior to the one that finds a solution. This extra work is usually insignificant. n The ratio of the number of nodes generated by DFID to those generated by BFS on a tree is: The total number of nodes generated by DFID is

62. Optimality of DFID Theorem 2.1 : DFID is asymptotically optimal in terms of time and space among all brute-force shortest-path algorithms on a tree with unit edge costs. n Steps of proof: u verify that DFID is optimal in terms of: F solution quality F time complexity F space complexity

63. Optimality of DFID- Solution Quality n Since DFID generates all nodes at given level before any nodes at next deeper level, the first solution it finds is arrived at via an optimal path.

64. n Assume the contrary that Algorithm A is: u Running on Problem P. u Finding a shortest path to a goal. u Running less than b^d. n Since its running time is less than b^d and there are b^d nodes at depth d, there must be at least one node n at depth d that A doesn’t generate when solve P. Optimality of DFID- Time Complexity

65. n New Problem P’. u P’ identical to P except that n is the goal. u A examines the same nodes in both P and P’. u A doesn’t examine the node n. u A fail to solve P’ since n is the only goal node. n There is no Algorithm runs better than O(b^d ). n Since DFID takes O(b^d ) time, its time complexity is asymptotically optimal. Optimality of DFID- Time Complexity

66. n There is a well-known result from C.S that: Any algorithm that takes f(n) time must use at least logf(n) space. n We have already seen that any brute-force search must take at least b d time, any such algorithm must use at least log(b^d) space, which is O(d) space. n Since DFID uses O(d) space, it’s asymptotically optimal in space. Optimality of DFID- Space Complexity

67. Graph with Cycles n On graph with cycles BFS can be more efficient because it can detect all duplicate nodes whereas a DFS can’t. n The complexity of BFS grows only as a numbers of nodes at a given depth.

68. n The complexity of DFS depends on the numbers of paths of a given length. n In a graph with a large number of very short cycles, BFS is preferable to DFS, if sufficient memory is available. n In a square grid with radius r, there is O(r^2) nodes and O(4^r) paths. Graph with Cycles

69. Pruning duplicate Nodes in DFS n Eliminate the parent of each node as one of its children. n Easily done with FSM. n Reduce the branching factor from 4 to 3. startright up left down

70. Pruning duplicate Nodes in DFS n More Efficient FSM allowed sequences of moves up only or down only. And sequences of moves left only or right only. n Time complexity of DFS controlled by this FSM, like BFS, is O(r 2 ). startrightleft up down

71. Node Generation Times u BFS, DFS, DFID generates asymptotically the same number of nodes on a tree. u DFS, DFID are more efficient than BFS. u The amount of time to generate a node is proportional to the size of the state representation. u If DFS is implemented as a recursive program, a move would require only a constant time, instead of time linear in the number of tiles. u This advantage of DFS, becomes increasingly significant the larger state description.

72. Backward Chaining/Search n The root node represent the goal state, and we could search backward until we reach the initial state. Requirements: Requirements: ¶The goal state represented explicitly. ·We be able to reason backwards about the operators.

73. Bidirectional Search n Main idea:  Simultaneously search forward from the initial state and backward from the goal state, until the two search frontiers meet at a common state. S G

74. Solution Quality n Bidirectional search guarantees finding a shortest path from the initial state to the goal state, if one exist. n Assume that there is a solution of length d and the both searches are breadth-first. When the forward search has proceeded to depth k, its frontier will contain all nodes at depth k from the initial state.

75. Solution Quality n When the backward search has proceeded to depth d-k, its frontier will contain all states at depth d-k from the goal state. n State s reached along an optimal solution path at depth k from the initial state and at depth d-k from the goal state. n The state s is in the frontier of both searches and the algorithm will find the match and return the optimal solution.

76. Time Complexity n If the two search frontiers meet in the middle, each search proceeds to depth d/2 before they meet. n But this isn’t the asymptotic time complexity because we have to compare every new node with the opposite search frontier. n Naively, compare each node with the all opposite search frontier cost us O(b d/2 ). The total number of nodes generated is O(2b d/2 ) = O(b d/2 ).

77. Time Complexity n The time complexity of the whole algorithm becomes O(b d ). n More efficiently is using hash tables. n In the average case: u The time to do hashing and compare will be constant. u the asymptotically time complexity is O(b d/2 ).

78. Space Complexity bidirectional n The simplest implementation of bidirectional is to use one search in BFS, and the search in other direction can be DFS such as DFID. n At least one of the frontiers must be sorted in memory. n The space complexity of bidirectional search is dominated by BFS search and is O(b d/2 ). n Bidirectional n Bidirectional search is space bound. n Bidirectional n Bidirectional search is much more time efficient than unidirectional search.

79. Perimeter Search n A special kind of bidirectional search. n A bredth first search up to depth d is performed backwards from the goal state. (this is the perimeter P) n Then any search is performed from the initial state towards the perimeter nodes. n Once the perimeter is reached the search can stop. G S