State space search / blocks world problem by heuristic approach /TIC TAC TOE
A lot of AI is about SEARCH. The "state space" is the set of states of the problem we can get to by applying operators to a state of the problem to get a new state. A state contains all of the information necessary to predict the effects of an action and to determine if it is a goal state. State-space searching assumes that the agent has perfect knowledge of the state space and can observe what state it is in (i.e., there is full observability); the agent has a set of actions that have known deterministic effects;some states are goal states, the agent wants to reach one of these goal states, and the agent can recognize a goal state. a solution is a sequence of actions that will get the agent from its current state to a goal state. Define the Problem as State Space Search Consider the problem of “Playing Chess” . to build a program that could play chess, we have to specify the starting position of the chess board, the rules that define legal moves. And ...