Scribd
Upload
5 views4 pages

AIML3

Uploaded by

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

AIML3

Uploaded by

Vicky Vickneshwari
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

EX.NO.

3 IMPLEMENTATION OF INFORMED SEARCH ALGORITHMS

DATE:

Aim:
To implement the informed search algorithm A*.

Algorithm:
Step 1: Initialize the open list
Step 2: Initialize the closed list, put the starting node on the open list (you can leave its f at zero)
Step 3: while the open list is not empty
a. find the node with the least f on the open list, call it "q"
b. pop q off the open list
c. generate q's 8 successors and set their parents to q
d. for each successor
i. if successor is the goal, stop search
ii. else, compute both g and h for successor successor.g = q.g + distance between
successor and q
iii. successor.h = distance from goal to successor (This can be done using many ways, we
will discuss three heuristics-Manhattan, Diagonal and Euclidean Heuristics)
successor.f = successor.g + successor.h
iv. if a node with the same position as successor is in the OPEN list which has a lower f
than successor, skip this successor
v. if a node with the same position as successor is in the CLOSED list which has
vi. a lower f than successor, skip this successor otherwise, add the node to the open list
end (for loop)
e. push q on the closed list end (while loop)
Program:

def aStarAlgo(start_node, stop_node): open_set = set(start_node) closed_set = set()


g = {}
parents = {} g[start_node] = 0
parents[start_node] = start_node while len(open_set) > 0:

n = None
for v in open_set:
if n == None or g[v] + heuristic(v) < g[n] + heuristic(n): n = v
if n == stop_node or Graph_nodes[n] == None: pass
else:
for (m, weight) in get_neighbors(n):
if m not in open_set and m not in closed_set: open_set.add(m)
parents[m] = n
g[m] = g[n] + weight else:
if g[m] > g[n] + weight: g[m] = g[n] + weight parents[m] = n
if m in closed_set: closed_set.remove(m) open_set.add(m)
if n == None:
print('Path does not exist!') return None
if n == stop_node: path = []
while parents[n] != n: path.append(n)
n = parents[n] path.append(start_node) path.reverse()
print('Path found: {}'.format(path)) return path
open_set.remove(n) closed_set.add(n)
print('Path does not exist!') return None
def get_neighbors(v): if v in Graph_nodes:
return Graph_nodes[v] else:
return None def heuristic(n):
H_dist = { 'A': 11,
'B': 6,
'C': 5,
'D': 7,
'E': 3,

'F': 6,
'G': 5,
'H': 3,
'I': 1,
'J': 0
}
return H_dist[n] Graph_nodes = {
'A': [('B', 6), ('F', 3)],
'B': [('A', 6), ('C', 3), ('D', 2)],
'C': [('B', 3), ('D', 1), ('E', 5)],
'D': [('B', 2), ('C', 1), ('E', 8)],
'E': [('C', 5), ('D', 8), ('I', 5), ('J', 5)],
'F': [('A', 3), ('G', 1), ('H', 7)],
'G': [('F', 1), ('I', 3)],
'H': [('F', 7), ('I', 2)],
'I': [('E', 5), ('G', 3), ('H', 2), ('J', 3)],
}
aStarAlgo('A', 'J')

Output:
Path found: ['A', 'F', 'G', 'I', 'J']

Result:
Thus the program to implement informed search algorithm have been executed successfully and
output got verified.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy