CS430/530 Homeworks

CS430/530 Home works

Come up with heuristics for the following problems. Explain whether they are admissible, and whether the state spaces contain local maxima with your heuristic.

a. The general case of the chain problem (i.e., with an arbitrary goal state) from Exercise 3.15.

b. Algebraic equation solving (e.g., “”solve 3x^2+y^2=y for x (in terms of y )””). [The operators here are algebraic operators such as moving a term from left to right, taking square roots on both sides etc.]

c. Path planning in the plane with rectangular obstacles, where the agent can take arbitrarily complex paths like in the road network.

d. Maze problems (rectangular grids with obstacles, where the agent can only move up, down, left, and right).

Is this the question you were looking for? If so, place your order here to get started!