Homework 1 (with answers)

Homework 1, Introduction 

Homework 1, Question 1, Peg Solitaire

Discuss this question on aiqus. When posting use the tag 'hw1-1' 

Homework 1, Question 2, Loaded Coin

Discuss this question on aiqus. When posting use the tag 'hw1-2'

Homework 1, Question 3, Path Through Maze

Clarifications:

Assume you are looking at the maze from up above.  Your controls are move forward to the next wall or intersection, turn left 90 degrees, and turn right 90 degrees.

Discuss this question on aiqus. When posting use the tag 'hw1-3'

Homework 1, Question 4, Search Tree

Clarifications:

You count a node when it is visited (path.end from remove_choice in Tree Search), not when it is added to the frontier.

Discuss this question on aiqus. When posting use the tag 'hw1-4'

Homework 1, Question 5, Another Search Tree

Clarifications:

You count a node when it is visited (path.end from remove_choice in Tree Search), not when it is added to the frontier.

Discuss this question on aiqus. When posting use the tag 'hw1-5'

Homework 1, Question 6, Search Network

Clarifications:

You count a node when it is visited (path.end from remove_choice in Tree Search), not when it is added to the frontier.

You can think of each edge as directional and pointing downward.  That is, if A is above B, A cannot be expanded from B.

Discuss this question on aiqus. When posting use the tag 'hw1-6'

Homework 1, Question 7, A* Search

Clarifications:

Diagonal moves are NOT allowed.

Assume a1 is already expanded.

The cost of moving from one box to another (path cost) is 1 everywhere.

Use <= for the definition of admissible.

Discuss this question on aiqus. When posting use the tag 'hw1-7'

Homework 1, Congratulations!

Answers:

Homework 1, Question 1, Peg Solitaire ANSWER

Discuss this question on aiqus. When posting use the tag 'hw1-1'

Homework 1, Question 2, Loaded Coin ANSWER

Discuss this question on aiqus. When posting use the tag 'hw1-2' 

Homework 1, Question 3, Path Through Maze ANSWER

Clarifications:

Assume you are looking at the maze from up above.  Your controls are move forward to the next wall or intersection, turn left 90 degrees, and turn right 90 degrees.

Discuss this question on aiqus. When posting use the tag 'hw1-3'

Homework 1, Question 4, Search Tree ANSWER

Clarifications:

You count a node when it is visited (path.end from remove_choice in Tree Search), not when it is added to the frontier.

Discuss this question on aiqus. When posting use the tag 'hw1-4'

Homework 1, Question 5, Another Search Tree ANSWER

Clarifications:

You count a node when it is visited (path.end from remove_choice in Tree Search), not when it is added to the frontier.

Discuss this question on aiqus. When posting use the tag 'hw1-5'

Homework 1, Question 6, Search Network ANSWER

Clarifications:

You count a node when it is visited (path.end from remove_choice in Tree Search), not when it is added to the frontier.

You can think of each edge as directional and pointing downward.  That is, if A is above B, A cannot be expanded from B.

Discuss this question on aiqus. When posting use the tag 'hw1-6'

Homework 1, Question 7, A* Search ANSWER

Clarifications:

Diagonal moves are NOT allowed.

Assume a1 is already expanded.

The cost of moving from one box to another (path cost) is 1 everywhere.

Use <= for the definition of admissible.

Discuss this question on aiqus. When posting use the tag 'hw1-7'