Harvard CS50’s Artificial Intelligence with Python – Full University Course

5

I would like to request your permission to add this video to my website as a learning resource for students. Along with the video, I plan to attach relevant exam questions to help reinforce the concepts. Upon completion of the course, students will also receive a certificate of completion.

If you allow me, I will ensure the content is properly structured and professionally presented for free.

Thank you for your consideration

He used almost 20 min to blab about the same thing

Is it worth watching it now

5:45

interesting

Can I have the cheat sheet for this?

import sys

class Node():

def __init__(self, state, parent, action):

self.state = state

self.parent = parent

self.action = action

class StackFrontier():

def __init__(self):

self.frontier = []

def add(self, node):

self.frontier.append(node)

def contains_state(self, state):

return any(node.state == state for node in self.frontier)

def empty(self):

return len(self.frontier) == 0

def remove(self):

if self.empty():

raise Exception("empty frontier")

else:

node = self.frontier[-1]

self.frontier = self.frontier[:-1]

return node

class QueueFrontier(StackFrontier):

def remove(self):

if self.empty():

raise Exception("empty frontier")

else:

node = self.frontier[0]

self.frontier = self.frontier[1:]

return node

class Maze:

def __init__(self, filename):

with open(filename) as f:

contents = f.read()

if contents.count("A") != 1:

raise Exception("Maze must have exactly one start point 'A'.")

if contents.count("B") != 1:

raise Exception("Maze must have exactly one goal 'B'.")

contents = contents.splitlines()

self.height = len(contents)

self.width = max(len(line) for line in contents)

self.walls = []

for i in range(self.height):

row = []

for j in range(self.width):

try:

if contents[i][j] == "A":

self.start = (i, j)

row.append(False)

elif contents[i][j] == "B":

self.goal = (i, j)

row.append(False)

elif contents[i][j] == " ":

row.append(False)

else:

row.append(True)

except IndexError:

row.append(False)

self.walls.append(row)

self.solution = None

def print(self):

solution=self.solution[1] if self.solution is not None else None

print()

for i, row in enumerate(self.walls):

for j,col in enumerate(row):

if col:

print(" ",end=" ")

elif (i,j)== self.start:

print("A",end=" ")

elif (i,j)== self.goal:

print("B",end=" ")

elif solution is not None and(i,j) in solution:

print("*",end="")

else:

print(" ",end=" ")

print()

print()

def neighbours(self,state):

row,col=state

candidates=[

("up",(row-1,col)),

("down",(row+1,col)),

("left",(row,col-1)),

("right",(row,col+1)),

]

result=[]

for action,(r,c) in candidates:

try:

if not self.walls[r][c]:

result.append((action,(r,c)))

except IndexError:

continue

return result

def solve(self):

self.num_explored=0

start=Node(state=self.start,parent=None, action=None)

frontier=StackFrontier()

frontier.add(start)

self.explored=set()

while True:

if frontier.empty():

raise Exception("no solution")

node=frontier.remove()

self.num_explored+=1;

if node.state==self.goal:

actions=[]

cells=[]

while node.parent is not None:

actions.append(node.action)

cells.append(node.state)

node=node.parent

actions.reverse()

cells.reverse()

self.solution=(actions,cells)

return

self.explored.add(node.state)

for action,state in self.neighbours(node.state):

if not frontier.contains_state(state) and state not in self.explored:

child=Node(state=state,parent=node,action=action)

frontier.add(child)

Brian Yu is the best 👍🙌💪☝️

Yea, i went to Harvard …

What a wonderful time to be alive…❤

49:51

Tremendous

01:19:53 , june 5