Sources

AI sources:
  • CS188 Artificial Intelligence (UC Berkeley course)

Computer Architecture sources:
  • CS61C Machine Structures and Computer Architecture (UC Berkeley course)

Popular posts from this blog

Standard/Planning Search Problems

Image
Standard search problems Solution to a standard search problem: a plan Use a search algorithm  to find the plan and solve the search problem Search algorithms are performed on the search tree (of the problem) to find the solution to the search problem All search algorithms follow the same algorithm, but just use a different data structures for the fringe   Types of standard searches ➤  UNINFORMED SEARCH uninformed search  - a search that does not know information about the goal's location Types of uninformed searches Depth first search (DFS) - a search strategy that expands the deepest node first Implementation : uses a last-in-first-out (LIFO)  stack as the fringe Time complexity : $O(b^m)$, for a finite tree where $m$ is the maximum depth and $b$ is the branching factor Space complexity : $O(bm)$ DFS expands only the nodes on a single path from the deepest level to the root Breadth first search (BFS) - a search strategy in ...
Read more

Constraint Satisfaction Problems

Image
identification problem  - a problem in which the agent must identify whether it is a goal state or not, with no regards of how it arrives at that goal In identification problems, the goal itself it important, not the path of reaching the goal All paths have the same depth, which is the number of variables in the problem constraint satisfaction problem (CSP)  - an identification search problem in which each state must satisfy a number of constraints (limitations) in order to be a valid goal state In CSPs, states are partial assignments  of variables (i.e. some variables have been assigned values while others have not) constraint graph  - a graph whose nodes represent a CSP's variables and edges represent the constraints between the variables/nodes Components of a CSP variables - a set of $N$ variables ($X_1,...,X_N$) that can each take on a single value from the domain domain  - a set ${x_1,...,x_d}$ representing all possible values that a ...
Read more

Adversarial Search Problems

Image
adversarial search problems - games In adversarial search, the agent maximizes utility rather than minimizing cost (which is done for standard search problems) Solution to adversarial search problem: strategy strategy  - the recommended best possible move given some configuration of the agent(s) and their opponent(s) game tree  - a tree where the nodes are game states and edges are moves Types of adversarial search problems zero-sum games  - deterministic, turn-taking, two-player games (pure competition between the two players) In zero-sum games, the sum of the utilities of the game agents is zero (i.e. equal and opposite utilities) stochastic games  - games with probabilistic outcomes cooperative games  - games in which players have common interests and utility function general games  - games in which agents have independent utilities (cooperation, indifference, competition, etc. are all possible) Components of an adversarial sear...
Read more