www.vustudents.ning.com

We non-commercial site working hard since 2009 to facilitate learning Read More. We can't keep up without your support. Donate.

# CS607 Assignment 01 Spring 2021 Solution / Discussion Due Date: 23-05-2021

CS607 Assignment 01 Spring 2021 Solution / Discussion Due Date: 23-05-2021

Questions No. 01                                                                                       10 Marks

Considering heuristically informed search (Best first search). You are required to find straight line distance.

• Based on the cost we devise paths in the graph for traversing towards the goal node.
• Priority Queue
• Initial State
• If the node is a goal

Then return the path from initial to node else generate all successor of nodes and put the newly generated node into open according to their f values. Cost is given on the edge of each node path.

Here is the formula to measure the distance.

Question No. 2                                                                                       10 Marks

Give step-by-step traversing to reach target node “k” based on Progressive Deepening.

NOTE:

Practice handouts questions to good effect, to solve assignment questions better.

Wish you the very best of luck!

Views: 915

### Replies to This Discussion

Stay touched with this discussion, Solution idea will be uploaded as soon as possible in replies here before the due date.

any one have this solution file?

CS607 ASSIGNMENT 1 SOLUTION 2021

cs607 solution

Attachments:

yeah muja gamil send kr da zaraali1900@gmail.com

1

2

3

4

5

## VIP Member Badge & Others

------------------------------------

## Latest Activity

+ ≋M≋S≋ posted a discussion

### Aik baar Parhiya Gaa Zaroor......

2 hours ago
2 hours ago
2 hours ago
2 hours ago
2 hours ago
2 hours ago
+ ! ! !★ "Areena"★✓ liked ǟȶɛɛզǟ's discussion 7 Rules Of Life
2 hours ago
2 hours ago