Give the initial state, goal test, operators, and path cost function for each of the following. There are several possible formulations for each problem, with varying levels of detail. The main thing is that your formulations should be precise and "hang together" so that they could be implemented.
a) You want to find the telephone number of Mr. Wajahat, who lives in Karachi, given a stack of directories alphabetically ordered by city.
b) You are lost in the Amazon jungle, and have to reach the sea. There is a stream nearby.
c) You have to color a complex planar map using only four colors, with no two adjacent regions to have the same color. (Map Coloring Problem)
d) A monkey is in a room with a crate, with bananas suspended just out of reach on the ceiling. He would like to get the bananas.
8 Queen problem