Scribd
Upload
2 views1 page

Assignment 2.Docx

The document outlines an assignment consisting of five tasks related to search algorithms, game theory, optimization techniques, and logic translation. It includes designing search trees, performing Minimax evaluations with alpha-beta pruning, demonstrating Hill Climbing, translating statements into logic, and proving conclusions using resolution. Each task emphasizes the application of theoretical concepts to practical problems in artificial intelligence.

Uploaded by

ts8267985
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views1 page

Assignment 2.Docx

The document outlines an assignment consisting of five tasks related to search algorithms, game theory, optimization techniques, and logic translation. It includes designing search trees, performing Minimax evaluations with alpha-beta pruning, demonstrating Hill Climbing, translating statements into logic, and proving conclusions using resolution. Each task emphasizes the application of theoretical concepts to practical problems in artificial intelligence.

Uploaded by

ts8267985
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Assignment-2

1.​ Given a state-space for a simple route-finding problem with specified distances
between cities, design a search tree from a start city to a goal city.
Apply Breadth-First Search (uninformed) and A* search (informed) with a given
heuristic. Compare the results in terms of optimality, time, and space complexity.

2.​ Consider a two-player game represented as a game tree with alternating MAX and
MIN levels. Perform the Minimax evaluation, then apply alpha-beta pruning to the
tree. Show the order in which nodes are visited and indicate any pruned branches.
Explain briefly why pruning improves search efficiency.

3.​ In a given optimization landscape with several peaks and valleys, demonstrate Hill
Climbing starting from an initial state. Identify possible local maxima that prevent
reaching the global maximum. Propose two alternative approaches (random restart
and simulated annealing) to overcome this issue and explain their advantages.

4.​ Translate the following statements into Propositional Logic and First-Order Predicate
Logic:
●​ "If it rains, the ground gets wet."
●​ "If the ground gets wet, the football match is cancelled."
●​ "It is raining."
Use resolution to determine whether the match will be cancelled.

5.​ Convert the following English statements into First-Order Logic and then
demonstrate inference using unification and resolution:

●​ " doctors are educated."

●​ All "Some doctors are researchers."

●​ "Ramesh is a doctor."

●​ "If someone is educated, they can get a job."​


Use resolution to prove that Ramesh can get a job.

You might also like