CS 482/682

News

Dec 10, 2013

AI from Udacity, taught by Sebastian Thrun

Dec 10, 2013

Computational and Artificial Intelligence in Games

Dec 9, 2013

Final exam will be in MS227 on Dec 16th at 10:15 a.m. to 12:15

Dec 9, 2013

Final exam practice

Dec 2, 2013

Forward and backward chaining

Dec 2, 2013

Updated Rule based systems with information on Mycin

Dec 1, 2013

Assignment 5 Decision Trees. Due December 9 in class

Dec 1, 2013

We will review decision trees and backpropagating neural nets on Dec 2 and 4.

Dec 1, 2013

The Comprehensive Final Exam is on Monday December 16 from 10:15 - 12:15. Review and sample exam on Monday December 9. We will review decision trees and backpropagating neural nets on Dec 2 and 4.

Nov 30, 2013

Decision trees in ppt.

Nov 11, 2013

Assignment 4: train a BPNN pose recognizer. Due Monday November 25 before class

Nov 11, 2013

Back propagating neural networks in ppt.

Nov 6, 2013

Logic: Resolution proofs (pdf) and in pptx.

Nov 4, 2013

Guest lecture by Siming Liu - Using potential fields for moving agents in starcraft.
Logic notes for Week 11 in pdf and in pptx.

October 30, 2013

Notes for Week 10 part 2 in pdf and in pptx.

October 30, 2013

Has anyone talked to a psychotherapist

October 28, 2013

Notes for Week 10 in pdf and in pptx.

October 27, 2013

Assignment 3 (pdf) and HTML . Here are 50, 9x9 sudoku puzzles for your assignment and a smaller set of 16x16 sudoku puzzles for grad students.
Due November 6.

October 23, 2013

Notes for Week 9 in pdf and in pptx.

October 22, 2013

Nishok's office new hours: T 2:30 - 3:30 p.m. in the ECC

October 21, 2013

Assignment 3: Write a Sudoku CSP solver and solve test problems found on the internet. More details on the way.

October 17, 2013

Kick Sudoku (Yes, you too can kick the sudoku habit)

October 16, 2013

Added shared library versions of black box functions for assignment 2 below.

October 14, 2013

Notes for Week 8 in pdf and in pptx.

October 9, 2013

More updates for the turning in portion of assignment 2

October , 2013

Read A coffee house conversation on the turing test

October 8, 2013

I have updated the turning in portion of assignment 2

October 7, 2013

Assignment 2 is now due to Nishok on Thursday October 17, 2013. Exam 1 is on October 21 in class.

October 7, 2013

Notes for Week 7 in pdf and in pptx.

Oct 7, 2013

I've made assignment 2 a bit easier. First, I changed f0 slightly so it is easier. Second, here is some additional information. The maximum possible on f0 is 150. The maximum possible on both f1 and f11 is the same: 64.
Please download and use the newest version of f0.o or f0C.o.

Oct 2, 2013

Nishok Yadav is our Grader. His office hours are Thursdays from 2:30 - 3:30 p.m. in the ECC. You can also make an appointment by sending email to nishok dot yadav at gmail dot com

September 30, 2013

Note the updates to assignment 2 below

September 30, 2013

Notes for Week 6 in pdf and in pptx.

September 16, 2013

Assignment 2: Genetic algorithms, hill-climbing, and game tree search. Due Oct 14, 2013 before 1:00 p.m.

Resources for the local search portion of assignment 2:

For 64 bit machines
You will use g++ for compiling these
64-bit, shared library versions for g++ (For David)
You will use gcc for compiling these and you will need to ensure that the math lib can be found with "-lm." For example: gcc -o f1C f1C.o main.c -lm

For 32 bit machines
You will use g++ for compiling these You will use gcc for compiling these and you will need to ensure that the math lib can be found with "-lm." For example: gcc -o f1C f1C.o main.c -lm

September 23, 2013

Notes for Week 5 notes in pdf and in pptx. Review local search and start game tree search.

September 16, 2013

Notes for Week 4 pdf and Week 4 pptx

September 16, 2013

Assignment 1: Path finding. Due Sept 30, 2013 before 1:00 p.m.

Here's my code for map generation. Think of this as sample code, you do not have to use it.

September 9, 2013

Notes for Week 3 pdf and Week 3 pptx

September 2, 2013

Notes for Week 2 pdf and Week 2 pptx

September 2, 2013

Assignment 0: Missionaries and Cannibals. Now Due Sept 16, 2013 at 1:00 p.m.

September 7, 2013

Read Turing's 1950 paper below and be prepared to answer question 1.2 from the book in class: In the paper, he discusses several objections to his proposed enterprise and his test for intelligence. What objections still carry weight? Can you think of new objections arising from developments since he wrote the paper? In the paper, he predicts that, by the year 2000, a computer will have a 30% chance of passing a five minute Turing test with an unskilled interrogator. What chance do you think a computer would have today? In another 50 years?

September 2, 2013

Turing's original paper Computing Machinery and Intelligence

August 26, 2013

Notes for the first day of class.

August 26, 2013

Assignment 0: Missionaries and Cannibals. Due Sept 11, 2013 at 1:00 p.m.

August 26, 2013

The tentative class Syllabus