Scribd
Upload
10 views1 page

AI Search Algorithms and Techniques Guide

The document outlines an assignment consisting of various topics in artificial intelligence, including alpha-beta pruning, A* and AO* search techniques, the water jug problem, and the differentiation between uninformed and informed search. It also covers game tree concepts in tic-tac-toe, heuristic functions, DFS and BFS algorithms, the minimax procedure, and the hill climbing algorithm along with its drawbacks. The assignment is due on October 14, 2024.

Uploaded by

Mir
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
10 views1 page

AI Search Algorithms and Techniques Guide

The document outlines an assignment consisting of various topics in artificial intelligence, including alpha-beta pruning, A* and AO* search techniques, the water jug problem, and the differentiation between uninformed and informed search. It also covers game tree concepts in tic-tac-toe, heuristic functions, DFS and BFS algorithms, the minimax procedure, and the hill climbing algorithm along with its drawbacks. The assignment is due on October 14, 2024.

Uploaded by

Mir
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

[Link] the concept of alpha-beta pruning. write alpha-beta search algorithm.

[Link] A* and AO* search techniques with example. Prove that A* is complete and optimal.
Justify with example.

3. Define the water jug problem in [Link] suggest a solution of it.

4. Differentiate between uninformed search and informed search.

5. For tic toe game, draw a game tree from root node (initial stage) to leaf node (win or lose) in AI.

6. Define heuristic function with suitable example.

[Link] DFS and BFS with example. Also Differentiate between DFS and BFS.

8. What is the purpose of minimax procedure in a game tree. Give an example of game tree.

[Link] hill climbing algorithm with its drawback and how its can be overcome?

10. What is Problem Space? How it can be defined as state space search.

NOTE : SUBMISSION DATE :14 OCTOBER 2024

You might also like