Scribd
Upload
4 views2 pages

Assignment Questions Module1

The document outlines an assignment for a course on Artificial Intelligence and Machine Learning, consisting of three problems. Problem 1 requires an explanation of the Minimax algorithm using a game tree to determine optimal moves for MAX and MIN players. Problem 2 involves applying the A* search algorithm to find the shortest path in a graph, while Problem 3 compares various search algorithms based on their principles and complexities.

Uploaded by

karthikeyanani07
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
4 views2 pages

Assignment Questions Module1

The document outlines an assignment for a course on Artificial Intelligence and Machine Learning, consisting of three problems. Problem 1 requires an explanation of the Minimax algorithm using a game tree to determine optimal moves for MAX and MIN players. Problem 2 involves applying the A* search algorithm to find the shortest path in a graph, while Problem 3 compares various search algorithms based on their principles and complexities.

Uploaded by

karthikeyanani07
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 - Module 1

Course: Artificial Intelligence & Machine Learning

Problem 1: Minimax Algorithm


Explain the Minimax algorithm using the following game tree. Show how the MAX and MIN players
choose their moves and determine the optimal value at the root node.

Problem 2: A* Search Algorithm


Apply the A* search algorithm to the following graph to find the shortest path from node S to node
G. Compute g(n), h(n), and f(n)=g(n)+h(n) at each step, and demonstrate how heuristic values
guide the search toward the goal.

Tasks:
1. Calculate g(n), h(n), and f(n) for each expanded node.
2. Identify the node selected at each iteration.
3. Determine the optimal path from S to G.
4. Explain how the heuristic values influence the search process.
Problem 3: Comparison of Search Algorithms
Compare BFS, DFS, UCS, DLS and IDS in terms of working principle, completeness, optimality,
time complexity and space complexity.

You might also like