The Hong Kong University of Science and Technology
Fundamentals of Artificial Intelligence
COMP 3211

Spring 2015
COMP3211 Lecture Note on Game Theory and
Auctions
Fangzhen Lin
Department of Computer Science and Engineering
Hong Kong University of Science and Technology
Fangzhen Lin (HKUST)
Games
1 / 34
MultiAgent Systems (MASs)
An MAS is one where more than one age
The Hong Kong University of Science and Technology
Fundamentals of Artificial Intelligence
COMP 3211

Spring 2015
Info
(2)
Q2
(10)
Q2
(10)
Q3
(50)
Q4
(20)
Q5
(8)
Sum
(100)
Information (2 points)
First Name:
Last Name:
Email:
For all the problems, assume that ties are broken alphabetically (so a partial plan S>X>A would be expanded before S>X>B and S>A>Z would be
The Hong Kong University of Science and Technology
Fundamentals of Artificial Intelligence
COMP 3211

Spring 2015
Final Project
Goal:
1. Get familiar with how to deal with interesting and/or important real problems.
2. Apply knowledge introduced in the class.
Group project study:
1. 23 people in each team.
2. Innovation is encouraged.
Deadline: May 15, the day befor
The Hong Kong University of Science and Technology
Fundamentals of Artificial Intelligence
COMP 3211

Spring 2015
Project 1: Search Algorithms
Aims: Get familiar with search algorithms in practice.
Code examples: http:/aima.cs.berkeley.edu/code.html
Todo list: Implement the following algorithms:
A1. Breadth first tree search
A2. Depth first tree search
A3. Uniformco
The Hong Kong University of Science and Technology
Fundamentals of Artificial Intelligence
COMP 3211

Spring 2015
Info
(2)
Q2
(10)
Q2
(10)
Q3
(50)
Q4
(20)
Q5
(8)
Sum
(100)
Information (2 points)
First Name:
Last Name:
Email:
For all the problems, assume that ties are broken alphabetically (so a partial plan S>X>A would be expanded before S>X>B and S>A>Z would be
The Hong Kong University of Science and Technology
Fundamentals of Artificial Intelligence
COMP 3211

Spring 2015
Final Project
Goal:
1. Get familiar with how to deal with interesting and/or important real problems.
2. Apply knowledge introduced in the class.
Group project study:
1. 23 people in each team.
2. Innovation is encouraged.
Deadline: May 15, the day befor
The Hong Kong University of Science and Technology
Fundamentals of Artificial Intelligence
COMP 3211

Spring 2015
Project 1: Search Algorithms
Aims: Get familiar with search algorithms in practice.
Code examples: http:/aima.cs.berkeley.edu/code.html
Todo list: Implement the following algorithms:
A1. Breadth first tree search
A2. Depth first tree search
A3. Uniformco
The Hong Kong University of Science and Technology
Fundamentals of Artificial Intelligence
COMP 3211

Spring 2015
Info (2) Q2 (10) Q2 (10) Q3 (50) Q4 (20) Q5 (8) Sum (100)
Information (2 points)
First Name:
Last Name:
Email:
For all the problems, assume that ties are broken alphabetically (so a partial plan S>X>A would be expanded before S>X>B and S>A>Z would be
The Hong Kong University of Science and Technology
Fundamentals of Artificial Intelligence
COMP 3211

Spring 2015
Info (2) Q1 (15) Q2 (8) Q3 (10) Q4 (10) Q5 (15) Q6 (20) Q7 (20) Sum (100)
Information (Please use your print name instead of signature)
First Name:
Last Name:
ID:
Email:
Q1.  Pruning.
Consider the game tree shown below. We wish to use alphabeta pruning
The Hong Kong University of Science and Technology
Fundamentals of Artificial Intelligence
COMP 3211

Spring 2015
Info
(2)
Q1
(15)
Q2
(8)
Q3
(10)
Q4
(10)
Q5
(15)
Q6
(20)
Q7
(20)
Sum (100)
Information (Please use your print name instead of signature)
First Name:
Last Name:
ID:
Email:
Q1.  Pruning.
Consider the game tree shown below. We wish to use alphabeta pruning
The Hong Kong University of Science and Technology
Fundamentals of Artificial Intelligence
COMP 3211

Spring 2015
Info (2) Q2 (10) Q2 (10) Q3 (50) Q4 (20) Q5 (8) Sum (100)
Information (2 points)
First Name:
Last Name:
Email:
For all the problems, assume that ties are broken alphabetically (so a partial plan S>X>A would be expanded before S>X>B and S>A>Z would be
The Hong Kong University of Science and Technology
Fundamentals of Artificial Intelligence
COMP 3211

Spring 2015
COMP3211 Lecture 3: Agents that Search
Fangzhen Lin
Department of Computer Science and Engineering
Hong Kong University of Science and Technology
Fangzhen Lin (HKUST)
Lecture 3: Search
1 / 65
Overview
Search problems.
Uninformed search.
Hueristic search.
The Hong Kong University of Science and Technology
Fundamentals of Artificial Intelligence
COMP 3211

Spring 2015
COM3211 Lecture 1: Introduction
Fangzhen Lin
Department of Computer Science and Engineering
Hong Kong University of Science and Technology
Fangzhen Lin ( Department of Computer Science and Engineering Hong Kong University of Science and Technology )
Lectu
The Hong Kong University of Science and Technology
Fundamentals of Artificial Intelligence
COMP 3211

Spring 2015
Artificial Intelligence
Adversarial Search
1
Course Topics
2
Graph Search
3
State Space Graphs
State space graph: A
mathematical
representation of a
search problem
Nodes are (abstracted) world
configurations
Arcs represent successors
(action results)
The Hong Kong University of Science and Technology
Fundamentals of Artificial Intelligence
COMP 3211

Spring 2015
Artificial Intelligence
Informed Search
1
Course Topics
2
Today
Informed Search
Heuristics
Greedy Search
A* Search
Graph Search
3
State Space Graphs
State space graph: A
mathematical
representation of a
search problem
Nodes are (abstracted) world
c
The Hong Kong University of Science and Technology
Fundamentals of Artificial Intelligence
COMP 3211

Spring 2015
Artificial Intelligence
Adversarial Search
Probability
1
Homework and Project
Homework 1 released
Deadline: Feb. 28
Project will be released early March
Deadline: Mar. 21
2
Course Topics
3
TicTacToe Game Tree
4
Resource Limits
5
Resource Limits
Pro
The Hong Kong University of Science and Technology
Fundamentals of Artificial Intelligence
COMP 3211

Spring 2015
Artificial Intelligence
Probability
1
Course Topics
2
Today
Probability
Random Variables
Joint and Marginal
Distributions
Conditional Distribution
Product Rule, Chain Rule,
Bayes Rule
Inference
Independence
3
Random Variables
A random variable is
The Hong Kong University of Science and Technology
Fundamentals of Artificial Intelligence
COMP 3211

Spring 2015
Artificial Intelligence
Informed Search
1
Course Topics
2
Today
Informed Search
Heuristics
Greedy Search
A* Search
Graph Search
3
State Space Graphs
State space graph: A
mathematical
representation of a
search problem
Nodes are (abstracted) world
c
The Hong Kong University of Science and Technology
Fundamentals of Artificial Intelligence
COMP 3211

Spring 2015
Artificial Intelligence
Informed Search
1
Course Topics
2
Today
Informed Search
Heuristics
Greedy Search
A* Search
Graph Search
3
State Space Graphs
State space graph: A
mathematical
representation of a
search problem
Nodes are (abstracted) world
c
The Hong Kong University of Science and Technology
Fundamentals of Artificial Intelligence
COMP 3211

Spring 2015
Project 1: Search Algorithms
Aims: Get familiar with search algorithms in practice.
Code examples: http:/aima.cs.berkeley.edu/code.html
Todo list: Implement the following algorithms:
A1. Breadth first tree search
A2. Depth first tree search
A3. Uniformco