CSC 242 Lecture Notes - Lecture 1: European Cooperation In Science And Technology, Lookup Table, Directed Graph

• School: University of Rochester
• Department: Computer Science
• Course: CSC 242
• Professor: George Ferguson

Document Summary

Consider finding the closest road between two points in romania. State: a representation of those aspects of the world that matter to solving the problem. Action: causes a transition from one state to another. Solutions: sequences of actions that lead from an initial state to a goal state. Modeling problems and solutions: model the world as a set of states, actions change states, solutions are sequences of actions from start state to goal state, cost of solution (path cost, cost of individual actions (step cost) Problem is defined as 5-tuple: Instance of a problem is a tuple: , i: start, g: goal. We could build states as a graph, and do a lookup table over all possible instances. Changing something about the problem requires re-computing everything. Go to an adjacent state repeat until at goal. State-space search could remedy this solution as it provides a generalized approach!