Notes
Notes - notes.io |
import heapq
class Node:
def __init__(self, state, parent=None, cost=0, heuristic=0):
self.state = state
self.parent = parent
self.cost = cost
self.heuristic = heuristic
def __lt__(self, other):
return (self.cost + self.heuristic) < (other.cost + other.heuristic)
def greedy_best_first_search(initial_state, goal_state, get_neighbors, heuristic):
start_node = Node(state=initial_state)
goal_node = Node(state=goal_state)
frontier = [start_node]
explored = set()
while frontier:
current_node = heapq.heappop(frontier)
if current_node.state == goal_state:
return reconstruct_path(current_node)
explored.add(current_node.state)
for neighbor_state in get_neighbors(current_node.state):
if neighbor_state not in explored:
neighbor_node = Node(state=neighbor_state, parent=current_node)
heapq.heappush(frontier, neighbor_node)
return None
initial_state = (0, 0)
goal_state = (4, 4)
def get_neighbors(state):
x, y = state
# Assuming only four possible actions: moving up, down, left, or right
neighbors = [(x+1, y), (x-1, y), (x, y+1), (x, y-1)]
# Filter out invalid neighbors (outside grid boundaries)
return [(nx, ny) for nx, ny in neighbors if 0 <= nx < 5 and 0 <= ny < 5]
def heuristic(state, goal_state):
# Manhattan distance heuristic
return abs(state[0] - goal_state[0]) + abs(state[1] - goal_state[1])
gbfs_path = greedy_best_first_search(initial_state, goal_state, get_neighbors, heuristic)
print("Greedy Best-First Search Path:", gbfs_path)
a_star_path = a_star_search(initial_state, goal_state, get_neighbors, heuristic)
print("A* Search Path:", a_star_path)
def a_star_search(initial_state, goal_state, get_neighbors, heuristic):
start_node = Node(state=initial_state, heuristic=heuristic(initial_state, goal_state))
goal_node = Node(state=goal_state)
frontier = [start_node]
explored = set()
while frontier:
current_node = heapq.heappop(frontier)
if current_node.state == goal_state:
return reconstruct_path(current_node)
explored.add(current_node.state)
for neighbor_state in get_neighbors(current_node.state):
if neighbor_state not in explored:
neighbor_cost = current_node.cost + 1
neighbor_heuristic = heuristic(neighbor_state, goal_state)
neighbor_node = Node(state=neighbor_state, parent=current_node, cost=neighbor_cost, heuristic=neighbor_heuristic)
heapq.heappush(frontier, neighbor_node)
return None
def reconstruct_path(node):
path = []
while node:
path.append(node.state)
node = node.parent
return list(reversed(path))
def get_neighbors(state):
x, y = state
neighbors = [(x+1, y), (x-1, y), (x, y+1), (x, y-1)]
return [(nx, ny) for nx, ny in neighbors if 0 <= nx < 5 and 0 <= ny < 5]
def heuristic(state, goal_state):return abs(state[0] - goal_state[0]) + abs(state[1] - goal_state[1])
initial_state = (0, 0)
goal_state = (4, 4)
gbfs_path = greedy_best_first_search(initial_state, goal_state, get_neighbors, heuristic)
print("Greedy Best-First Search Path:", gbfs_path)
a_star_path = a_star_search(initial_state, goal_state, get_neighbors, heuristic)
print("A* Search Path:", a_star_path)
|
Notes.io is a web-based application for taking notes. You can take your notes and share with others people. If you like taking long notes, notes.io is designed for you. To date, over 8,000,000,000 notes created and continuing...
With notes.io;
- * You can take a note from anywhere and any device with internet connection.
- * You can share the notes in social platforms (YouTube, Facebook, Twitter, instagram etc.).
- * You can quickly share your contents without website, blog and e-mail.
- * You don't need to create any Account to share a note. As you wish you can use quick, easy and best shortened notes with sms, websites, e-mail, or messaging services (WhatsApp, iMessage, Telegram, Signal).
- * Notes.io has fabulous infrastructure design for a short link and allows you to share the note as an easy and understandable link.
Fast: Notes.io is built for speed and performance. You can take a notes quickly and browse your archive.
Easy: Notes.io doesn’t require installation. Just write and share note!
Short: Notes.io’s url just 8 character. You’ll get shorten link of your note when you want to share. (Ex: notes.io/q )
Free: Notes.io works for 12 years and has been free since the day it was started.
You immediately create your first note and start sharing with the ones you wish. If you want to contact us, you can use the following communication channels;
Email: [email protected]
Twitter: http://twitter.com/notesio
Instagram: http://instagram.com/notes.io
Facebook: http://facebook.com/notesio
Regards;
Notes.io Team