Lecture03-P1-ProblemSolvingBySearching

Quiz 1:

Quiz 2:
Lecture03-P2-UninformedSearch

States Expanded: Start, A, B, D, Goal

Path Returned: Start-D-Goal
States Expanded: Start, A, B, D, C, Goal
Path Returned: Start-D-Goal

States Expanded: Start, A, C, D, B, Goal

Path Returned: Start-A-C-D-Goal

The reason is that in a search tree with the same (or nearly the same) branching factor
at each level, most of the nodes are in the bottom level, so it does not matter much that
the upper levels are generated multiple times
if b = 10 and d = 5, the numbers are
N(IDS) = 50 + 400 + 3, 000 + 20, 000 + 100, 000 = 123, 450
N(BFS) = 10 + 100 + 1, 000 + 10, 000 + 100, 000 = 111, 110
Lecture03-P3-InformedSearch

States Expanded: Start, D, Goal

Path Returned: Start-D-Goal

Lecture04-LocalSearch
Lecture05-AdversarialSearch
Use this website: Demo:
http://homepage.ufp.pt/jtorres/ensino/ia/alfabeta.html
With config like this:
233213123323212321323
435214235473214053027436531
Same as Quiz 01 above.

Lecture07-LogicalAgents
Lecture08-FirstOrderLogic
Lecture09-BayesianNetworks
Lecture10-BasicML