Courses/CS 460/Fall 2009

From CSWiki

Jump to: navigation, search

Contents

Meeting times and place

Saturdays: ET 210. 11:50AM - 3:40PM.


Grading

Grades will be based primarily on your cumulative homework (mainly software development)—along with your ability to explain it on the midterm and final.


Text: Russell, Stuart and Peter Norvig, Artificial Intelligence: A Modern Approach

Comments on the Java code supplied with the text.


The following chapters are available as pdf files.
The following chapters are available as slides. (See Lecture slides.)
 1, 2, 3, 4, 5, 6, 7, 8, 9, 13, 14, 18.


Please bring the book to class each week.


[edit] Week 1. September 26

Video

Chapter 3.

Homework. Problem 3.9 (page 90)

[edit] Week 2. October 3

Video

Chapter 4. Sections 4.1 and 4.2 (through top of p 108).

Homework.

  1. Refactor your Missionaries and Cannibals code to factor out the search engine and make it separate from the specific goal and steps.
  2. Add A* search as an option.
  3. Then use that code to solve Shirokuro (See also Alexandre Lomovtsev's Shirokuro project, Alexandre Lomovtsev's Shirokuro project poster, and Ben Bush's Shirokuro project poster.) A key to solving Shirokuro is to realize that there must be spanning trees for both black and white cells. Ensure that at any point both spanning trees can be constructed if you allow uncommitted cells in each tree, but where the two trees don't intersect, i.e., they don't both use the same uncommitted cells.
  4. Compare the number of nodes required to solve the two problems with and without A*.

[edit] Week 3. October 10

Video

Chapter 6. Minimax.

Homework. Use the Code available on the Text website to encode your missionaries and cannibals problem and Shirokuro. See this page for further discussion.

[edit] Week 4. October 17

Video

Chapter 6. AlphaBeta pruning

Homework. Create a "Hex" player. You may use the search functions from the aima code. The player should accept a board and return a move. The move should be an int[2] that indicates the hex cell to be occupied. See the Hex page for more information about the game.

[edit] Week 5. October 24

Video

Hex

[edit] Week 6. October 31

Video

More Hex

[edit] Week 7. November 7

No class. Furlough day.

[edit] Week 8. November 14

Video

Russell and Norvig: Chapter 5. Constraint Satisfaction Problems; Slides: on website, csp.pptx, csp.ppt

JaCoP (Java Constraint Programming) is a Java library that supports constraint programming.

[edit] Installing and using JoCoP (version 2.4.1)

  • Create a JaCoP Project in eclipse.
  • Download JaCoP and Examples zip file
  • Extract to the src directory
  • Download JDOM zip file
  • Extract only JDOM.jar to the top level of the JaCoP project.
  • In the JaCoP project properties > Java Build Path > Libraries, Add the jdom.jar file in jdom/build.

[edit] JaCoP Examples

[edit] Logic puzzles

[edit] Week 9. November 21

Video

Russell and Norvig

[edit] Week 10. December 5

[ Video]

[edit] Final. December 12

Retrieved from "http://cs.calstatela.edu/wiki/index.php/Courses/CS_460/Fall_2009"
Personal tools