Syllabus
COSC 461/561: Artificial Intelligence
14258/14259
Fall 2019
Monday/Wednesday 2:00-3:15
203 Pray-Harrold
Instructor:
Dr. William Sverdlik
Office: 512D Pray-Harrold
Office Hours: Walk-In MW 9:00-10:00,
MW 12:00-2:00,
W 4:30-5:30
Other times by
appointment (I will be on campus everyday - just check with me)
Phone:
734-487-7081
e-mail:
wsverdlik@emich.edu
Textbook:
Artificial
Intelligence: A Modern Approach by Russell and Norvig
Format:
Programming assignments - 70%
-
Checkers (team project- 3 people per team) - 35% .Your grade
is dependent upon your final ranking. The best team receives an A, the
second ranked team receives an A-, etc.
- Travelling Salesman Problem (TSP) (tsolo effort) - 35%.
Quizzes/Tests/Whatever_you_want_to_call_it
- 3 of these; about an hour long. Each is worth 10% of your grade.
Quiz 1 - Monday September 30
Quiz 2 - Wednesday October 30
Quiz 3 - to be determined
NOTE: those taking this class as a graduate class will have extra work. This will most likely be a presentation of a
paper to the class. For gradute students, the paper/presentation is
worth 10% of your grade and the preceding 3 items are reduced to 30%
each.
You will be giving many demos , both in class and in my office, demonstrating the progress of your programs.
IMPORTANT: You will be evaluating yourself and each member of your
team. These evaluations weigh heavily in your grade on the respective
assignments.
______________________
CHECKERS !
You will need to form teams of 3 people. Do
this by Wednesday September 11 and hand in a list of names on your team.
Checkers
Assignment
Checkers
notation : we'll all use the
notation described here
Important Dates for Checkers
Monday October 14, 2019- first checkers demo and
playoff
Monday November 11, 2019- second checkers playoff
Sometime in December - final checkers playoff (probably last week of classes)
-----------------------------------------------------
Your Main Solo Programming Assignment
Travelling
Salesman Problem
Due dates are Monday October 28 and Wednesday December 2 Monday December 9
Traveling Salesman Problem - data set
(we'll try 120
cities - assumes a 100x100 grid ) :
Text
File (Comma Delimited)
Excel
Spreadsheet with scatter plot
-----------------------------------------------------------
Searching
- in Russell and Norvig, read the chapters on Searching (chapters 3,4,5 in the third edition)
- Patrick Henry Winston videos from MIT : watch videos 1,2,3,4,5,6 here
Some Links:
Outside Reading Assignment #1:
John
Searle -
the man people in AI love to hate. Make sure to look up his "Chinese
Room/Monkey in a Box" argument
The Chinese Room Problem
Simon Newcomb Award
Chinook
- the
world's best checkers player (a computer!!). You can play it here. Also
read the related articles.
Solved
Board Games
- good list of references here
Andrew
Moore's Slides on Hill Climbing and Simulated Annealing
Interesting AI software:
AMZI
Prolog -
free version , only runs under Windows
Common
Lisp - from Franz LISP Allegro CL 8.1
Tutorials for:
PROLOG:
Adventure in PROLOG
(from AMZI) - same page as download
for software (scroll down the page)
Common
LISP: A Gentle Introduction to Symbolic Computation by David Touretzky
Common
LISP: An Interactive Approach by Stuart Shapiro
Assignments from a Previous Class (maybe we'll do these???)
Monkey
Business
Who
Owns the Zebra
Map
of Rumania
Astar
Astar and 8 puzzle
Wumpus
World
Introduction to Propositional Logic, Entailment and more Wumpi!
Notes from Chap 7.
Generalized Modus Ponens
Abduction
Cheating:
It violates University policy, you know....so
don't do it. Cheating is defined as representing all or part of
someones elses work as your own. While you are certainly encouraged
to seek the advice of others in this class on assignments, the work
you hand in should represent your own efforts. Violation of this rule
will be dealt with according to University policy. If you are really
stuck on a problem, come see the instructor!
Checkers Teams (tell me your teams and I will fill this in)
Kyle Stevenson, Neha Puchaka, Matt Straigh.
Sam Orosz E01545104
Greg Oyafuso E00869452
Nick Calleja E01562484
Brian Mikolajczyk E01579041
Li Sa E01963939
Peter Richter E01710777
Venkata santosh chadalavada E01962690
Bryce VanAsselt E01697558
Athena Xia E00979010
Othman Wahab E01413792
Allison Hawkins E01484427
Garrett Maitland E01237712
Zachariah Pelletier - E01417917
Sarah Yaw - E01558191
Steve Rice - E01854640
Ryan Carney E01167587
Brendan Schmidt E01566004
Tony Mumanyi E02057435
Graduate Talks: Wednesday December 11 - Each talk should be about 25 minutes
Talk 1) Steve Rice and Laya Karimi "Few Shot Video-to-Video Synthesis"
Talk 2) Brian Mikolajczyk, Greg Oyafuso, Neha Reddy Puchakayala "Deep Neural Networks"
Talk 3) Garrett Maitland, Venkata Santosh Chadalavada, Li Sa "Prolog: Language of Logic"
There are 2 unreported people