PROJECT- DUE : by day of final exam
This is a team project of at most 2 members per team:
(in addition to the code/software, submit a one page description
of which problem you are solving out of the ones given below-include
names of your team members)
Option 1: Solve the Mastermind Game, presented by Tony,
using one of the following approaches:
(A) the Bayesian approach to handling uncertainty
or
(B) The Genetic Algorithms approach (can use a progr. language or
download a free 30 day copy of "evolver" from www.palisades.com)
Option 2: Use the hill climbing, or best first, or branch and bound, or
branch and bound with underestimates or A* function to solve a
state space problem, like the "Farmer, Fox, Goose and Grain",
"cannibals and missionaries", "towers of Hanoi", or "eight-puzzle", etc.
Option 3: Implement the Bayesian approach to handling uncertainty in
knowledge bases and apply it to some data base from
the University of California Irvine Machine Learning database.
Option 4: Implement a natural language parser in LISP.
--------------------------------------------------------------------------
HAND IN:
1. A paper in a research paper format (abstract, introduction and
background, main results, conclusions, references, appendix
with the code).
2. An electronic version of your code by email to:
chris@bradley.edu
___________________________________