Writing Assignment 1 I need assignment to be completed in 24 hours Writing Assignment 1 – Uninformed Search
Note: Please refer to the syllabus for expectations of homework professionalism and appearance.
Your homework is expected to be an individual effort. It is also expected to be neat and clearly
organized. The University provides access to many software applications. You can find the link
for your softcopy submission on Blackboard.
Possible points: 20
The cover page of your homework will contain only the following information in the format given
Course #: CS 5700
Semester: Fall 2021
1. Given a complete problem formulation for each of the following. Choose a formulation that
is precise enough to be implemented. (Describe the state, initial state, action, goal test, and path
a. Using only four colors, you have to color a planar map in such a way that no two adjacent regions have
the same color. (3 points)
b. A 3-foot-tall monkey is in a room where some bananas are suspended from the 8-foot ceiling. He would
like to get the bananas. The room contains two stackable, movable, climbable 3-foothigh crates. (3 points)
2. Implement BFS search for visiting all the nodes in the following graph. Show the action step by step and
the visiting path. (7 points)
3. Implement the uniform cost search for the following graph, which is starting from S and the goal is G.
Show the actions step by step and visiting path. (7 points)