Homework 2 (due 10/15 by 6 p.m.)
Group assignment (100 pts)
In this assignment you will implement a smart, successful,
goal-based agent for the wumpus world (AIMA problem 7.13).
The
agent will use a logical reasoning system to determine where
the gold is and how to bring it back to safety.
Requirements:
- use first-order logic to represent "the laws" of the wumpus world
- use explicit representations of the agent's goals (i.e., find
gold, get
out of cave)
Options:
- you may also use search methods to find a safe way back out of
the cave once the agent found the gold
- you may use any AIMA code you deem helpful in this assignment
(but no other supporting code except your own)
- it is up to you to decide what representational scheme to use
for
the world, its objects, actions, changes, etc. (e.g., you may decide to
go with the situation calculus)
Caveats:
- make no assumptions about the starting square of the agent (it
could be different from <1,1>)
- make sure your agent does not get stuck in the cave when the
gold
cannot be retrieved (e.g., because it is surrounded by pits)
Hints:
- first, take a look at the agents already defined for the wumpus
world
- then familiarize yourself with the logic subsystem of AIMA and
integrate whatever you find appropriate into your agent (unfortunately,
not all the AIMA code works properly, in particular, the 1st order
reasoning system in LISP is broken and not even implemented in
JAVA--please talk to the TA or instructor if you
intend to use it)
- finally, determine all the rules your agent needs and enter them
in the agent's KB (you may find the rules in ch. 7 of the AIMA book
very useful)
- START EARLY (this is a big project!)
After all groups have turned in their code, the best "wumpus world
agent" will be determined (in a series of test-worlds using the AIMA
scoring function for the wumpus world). Again, the winning group
will get bonus points.
Code and comments
Same as assignment 1.
Academic honesty
Same as assignment 1.
Submission information
Please submit all your code in a file called
wa<GID>.{java/lisp}
(depending on whether you write it in JAVA or LISP) in
/afs/nd.edu/coursefa.04/cse/cse471.01/dropbox/group<GID>/hw2/
before 6 p.m. on the day the assignment is due. Furthermore,
submit an ASCII text file called
info<GID>.txt
which lists the responsibilities of the group members (i.e. which
part of the problem and code they were in charge of). List all
the rules you defined for your agent at the end of this file in logical
notion (or prefix
notation for first order logic as defined on the logic subsystem of
the AIMA page).
Individual assignment (100 pts)
Undergraduates (100 pts)
AIMA problems 7.4, 7.8 (e,f,g), 7.9, 8.3, 8.6 (c,d,k), 8.15, 9.4 (c,d),
9.19, 10.1, 10.18
Graduates (100 pts)--in addition to the above
AIMA problems 7.16, 8.4, 9.18, and 10.3
Academic honesty
Same as assignment 1.
Submission information
Turn in an ASCII version of your answers called
answers.txt
in the hw2 directory in your space in the course dropbox
/afs/nd.edu/coursefa.04/cse/cse471.01/dropbox/<yourAFSid>/hw2/
Good luck!
This page is maintained by:
Matthias Scheutz
Copyright © 2004, University of
Notre Dame
All rights reserved.
Last revised on September 27, 2004