CS4700 Foundations of Articial Intelligence
Fall 2014
Assignment 1 (100 pts total)
Due Friday, September 26, 10am CMS.
Solutions must be typed, although equations, graphs, tables, etc., can be drawn in
by hand. You can dicuss the hwk with other students b

CS 4700: Problem Set 1 Fall 2014
Solutions
Problem 1 (R&N 1.9)
Evolution tends to perpetuate organisms (and combinations and mutations of organisms) that are successful
enough to reproduce. That is, evolution favours organisms that can optimize their perf

CS 4700: Problem Set 4
Problem 1
Part a (10 points):
Gain(EQ) = I
95
,
14 14
4
5
I (1, 0) + I
14
14
23
,
55
+
5
I
14
32
,
55
= 0.2468
Gain(good hacker) = I
23
,
55
3
2
I (1, 0) + I (0, 1) = 0.9709
5
5
Gain(publications) = I
23
,
55
3
2
I (1, 0) + I (0, 1)

CS 4700: Midterm
Problem 1 (10 pts, 2 pts each)
(a) (Two possible answers)
False. BFS will not nd the goal if the branching factor is not nite.
True. Assuming nite branching factor, BFS is complete therefore will nd the solution.
(b)
False. Bi-directional

CS4700 Foundations of Articial Intelligence
Fall 2012
Assignment 1 (100 pts total)
Due Wednesday, September 19 at the beginning of class.
Solutions must be typed, although equations, graphs, tables, etc., can be drawn in by
hand.
1. General AI (15 pts.) E

CS 4700: Problem Set 1
Problem 1
Memory updates per second is dened by the number of neurons divided by the cycle time. Since the slug
has 20000 neurons and a cycle time of 103 seconds (because we assume that the slug has the same cycle
time as the human

CS 4700: Problem Set 3
Problem 1
If a formula is satisable, starting from a random initial assignment, WalkSAT can always reach a satisfying
assignment. Note that were not making any claims about how long this might take. To see why this is
the case, assu

CS4700 Foundations of Articial Intelligence
Fall 2014
Assignment 2 (60 pts total)
Due Wednesday, October 22, 10am CMS.
Solutions must be typed, although equations, graphs, tables, etc., can be drawn in
by hand. You can dicuss the hwk with other students b

CS4700 Foundations of Articial Intelligence
Fall 2014
Assignment 1 (100 pts total)
Due Friday, September 26, 10am CMS.
Solutions must be typed, although equations, graphs, tables, etc., can be drawn in
by hand. You can dicuss the hwk with other students b

CS4700 Foundations of Articial Intelligence
Fall 2014
Assignment 2 Solutions
1. Game Playing: (25 points total)
Consider the following game tree:
(a) (10 pts.) Fill in the empty squares for the remaining nodes,
using a minimax search.
Solution: See gure
(

CS4700 Foundations of Articial Intelligence
Fall 2012
Assignment 3 (100 pts total)
Due Monday, Nov. 19 at the beginning of class.
Solutions must be typed, although equations, graphs, tables, etc., can be drawn in by
hand.
1. Walksat (15 pts.)
In Walksat w

Exercise 1.4
Suppose we extend Evans's ANALOGY program so that it can score 200 on a standard IQ test. Would we
then have a program more intelligent than a human? Explain.
Exercise 1.8
Many of the computational models of cognitive activities that have bee

HW1
Yangwen Wan (YW762)
1. Exercise 1.4 of Russell & Norvig
Suppose we extend Evanss ANALOGY program so that it can score 200 on a
standardIQ test. Would we then have a program more intelligent than a human?
Explain.
Probably not for two reasons.
First, a

CS 4700:
Foundations of Artificial Intelligence
Bart Selman
Reinforcement Learning
R&N Chapter 21
Note: in the next two parts of RL, some of the
figure/section numbers refer to an earlier edition of R&N
with a more basic description of the techniques.
The

CS 4700: Problem Set 3
Problem 1
sh is
ar stu
ed d
vi y re
aC s
o
ou urc
rs e
eH w
er as
o.
co
m
If a formula is satisfiable, starting from a random initial assignment, WalkSAT can always reach a satisfying
assignment. Note that were not making any claims

CS4700 Foundations of Artificial Intelligence
Fall 2012
Assignment 4 (105 pts total)
Due Friday, Nov. 30. Submit on-line via CMS by 11:15am.
Solutions must be typed, although equations, graphs, tables, etc., can be drawn in by
hand.
1. Decision Tree Learn

CS 4700: Midterm
Problem 1 (10 pts, 2 pts each)
(a) (Two possible answers)
False. BFS will not find the goal if the branching factor is not finite.
True. Assuming finite branching factor, BFS is complete therefore will find the solution.
False. Bi-directi

CS 4700: Problem Set 2
NOTE: SOLUTIONS FOR 1(b) and 3 have changed.
Problem 1 (15 pts)
Ties are broken lexicographically. Alternate tie-breaking schemes were accepted, but only if the scheme was
explicitly given and consistently applied.
(a) Uniform-cost

CS4700:ProblemSet1Fall2015
SampleSolutions
Problem1R&N1.4
Importantaspectsoftheanswer:
defineintelligence
defendyouranswer
Example:
For a program to be more intelligent than a human, Lets assume that human intelligence is
the ability to perform(somewhat

CS4700 Foundations of Artificial Intelligence
Fall 2012
Assignment 2 (120 pts total)
Due Friday, Oct. 5 at the beginning of class.
Solutions must be typed, although equations, graphs, tables, etc., can be drawn in by
hand.
1. Heuristic Search (15 pts.)
3

CS4700 Foundations of Artificial Intelligence
Fall 2015
Assignment 4 (60 pts total)
Due Tuesday, Dec. 8, 10pm on gradescope.com
You can discuss the homework with other students but you need to write up the
solution in your own words. Also, you can consult

CS 4700: Midterm
Problem 1 (10 pts, 2 pts each)
(a) (Two possible answers)
False. BFS will not find the goal if the branching factor is not finite.
True. Assuming finite branching factor, BFS is complete therefore will find the solution.
(b) False. Bi-dir

CS 4700:
Foundations of Artificial Intelligence
Instructor:
Prof. Selman
selman@cs.cornell.edu
Admin
Course Administration
1) Office hours and web page next week
2) Text book: Russell & Norvig - Artificial
Intelligence: A Modern Approach
(AIMA)
Grading
Ho

Decision Tree Question
Suppose we generate a training set from a decision tree and then apply decision-tree
learning to that training set. Is it the case that the learning algorithm will eventually
return the correct tree as the training-set size goes

CS 4700: Problem Set 2
NOTE: SOLUTIONS FOR 1(b) and 3 have changed.
Problem 1 (15 pts)
sh is
ar stu
ed d
vi y re
aC s
o
ou urc
rs e
eH w
er as
o.
co
m
Ties are broken lexicographically. Alternate tie-breaking schemes were accepted, but only if the scheme

CS4700 Foundations of Artificial Intelligence
Fall 2015
Assignment 2 (120 pts total)
Due Monday, Oct. 19, 10pm on gradescope.com
You can discuss the homework with other students but you need to write up the
solution in your own words. Also, you can consul

CS4700 Foundations of Artificial Intelligence
Fall 2014
Assignment 2 Solutions
sh is
ar stu
ed d
vi y re
aC s
o
ou urc
rs e
eH w
er as
o.
co
m
1. Game Playing: (25 points total)
Consider the following game tree:
Th
(a) (10 pts.) Fill in the empty squares

So, may. 4M Abondu. 2
(00014 POBLHES Wao) 0 904!
Maud was 04%) 57 (wean T
buy! 0'": C(00) gA CowAz
0 OVr"? w (i) ? Siwuukd Ahhoa '6.) (51)
Consider the following random walker in hypercube space:
1) Start at a random node S (the current node).
(How do we

CS4700 HW1
Jonathan Mares
September 23, 2016
Problem 1
Evolutions favors the gradual development of organisms that are more primed
to prosper and reproduce effectively. I would think that the rational aspec
here would be related to priming organisms to re

So, may. 4M Abondu. 2
(00014 POBLHES Wao) 0 904!
Maud was 04%) 57 (wean T
buy! 0'": C(00) gA CowAz
0 OVr"? w (i) ? Siwuukd Ahhoa '6.) (51)
Consider the following random walker in hypercube space:
1) Start at a random node S (the current node).
(How do we