Skip to content

Berkeley Pacman Projects (1 and 2), Depth First Search, Breadth First Search, Uniform Cost Search ,A* Search , Heuristic Functions ,Suboptimal Search, Minimax Algorithm, Alpha-Beta Pruning, Expectimax, Constraint Santisfaction Problems, RLFA CSP problem, Propositional Logic, First-order Logic

License

Notifications You must be signed in to change notification settings

giannhskp/Artificial-Intelligence-1

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Artificial-Intelligence-1

Project 1

  • Berkeley Pacman Project 1 (https://inst.eecs.berkeley.edu/~cs188/sp19/project1.html)
    • Q1: Depth First Search
    • Q2: Breadth First Search
    • Q3: Uniform Cost Search
    • Q4: A* Search
    • Q5: Corners Problem: Representation
    • Q6: Corners Problem: Heuristic
    • Q7: Eating All The Dots: Heuristic
    • Q8: Suboptimal Search
  • Theoritical Exercises on Search Algorithms

Project 2

Project 3

Project 4

Exercises on:

  • Propositional Logic
  • First-order Logic

About

Berkeley Pacman Projects (1 and 2), Depth First Search, Breadth First Search, Uniform Cost Search ,A* Search , Heuristic Functions ,Suboptimal Search, Minimax Algorithm, Alpha-Beta Pruning, Expectimax, Constraint Santisfaction Problems, RLFA CSP problem, Propositional Logic, First-order Logic

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published