Objective:

This practical assignment focuses on implementing and understanding intelligent agents and search algorithms. Students will gain hands$-$on experience in developing agents and applying search algorithms to solve real$-$world problems.

Part $1$: Intelligent Agents $(50$ points$)$:

$1.$ Agent Design $(20$ points$)$:

$$ Choose a problem domain suitable for an intelligent agent $($e$.$g$.,$ vacuum cleaner world, route planning, game playing, Smart Homes$),$

$$ Define the agent's architecture, including sensors$,$ actuators, and the agent's decision$-$making process.

$2.$ Agent Implementation $(30$ points$)$:

$$ Implement the intelligent agent using a C$++$ programming language.

$$ Demonstrate how the agent perceives the environment, processes information, and takes actions based on its goals.

Part $2$: Search Algorithms $(50$ points$)$:

$1.$ Problem Definition $(15$ points$)$:

$$ Select a well$-$defined problem for which a search algorithm can be applied $($e$.$g$.,$ pathfinding, puzzle solving$).$

$$ Clearly define the problem, including the initial state, goal state, and possible actions.

$2.$ Algorithm Implementation $(25$ points$)$:

$$ Implement a search algorithm $($e$.$g$.,$ depth$-$first search, breadth$-$first search, A$*$ algorithm$)$ to solve the chosen problem. Use C$++$ programming language to write code.

$$ Provide a step$-$by$-$step explanation of how the algorithm works and why you chose it for the given problem.

$3.$ Performance Analysis $(10$ points$)$:

$$ Analyze the performance of the implemented search algorithm by discussing its time complexity, space complexity, and any optimizations applied.