Assignment 2, Due Sept. 27 at 5:00 p.m.
Connect 4
Sushil J. Louis
email: sushil@cs.unr.edu
Write a program that plays Connect-4 well. Your program should not
lose when given a large enough minimax tree depth.
Extend the above program to play Connect-N well where N
ranges from 4 - 10. N should be a command line argument (see below).
Use minimax search and
pruning and with user
selectable depth to speed up your program. The program should allow
the user the choice of specifying who makes the first move and it
should print out the board after each move. For this game your program
should not lose (ever) above a certain search depth. The program
should also do error checking so that a user cannot cheat.
Your program should user the following optional command line arguments
- User selectable depth (-d depth)
- Whether or not to use
pruning
(-A means to use
pruning)
- For graduate students only: N in Connect-N (-n N), board size in
terms of the number of columns (-c nColumns) and rows (-r Rows).
You need to do two things:
- Turn in a hardcopy of source code and a script of your interaction
with the program that shows off its strengths and weaknesses. In
addition, we need a writeup of your assignment that includes,
- A typeset explanation of your program's design: logic,
data structures and control. Justify your static evaluator.
- A typeset explanation of how to use your program (A man
page).
Finally, place the program executable on your web page; tell me where
it is (URL) in your handin. Test and make sure you can download the
executable from your web-page and can run the executable after
downloading.
- Sign up for a
demo on the sheet outside my door. Demos will be held in SEM 252 on
the
of September. If you demo, we won't need the script of your
interaction. In any case you will be graded on your program's
correctness (80%), writeup (15%), and man page (5%). Use any language
available on our machines (CS and Engr Lab). We can help you only with
C/C++, Java, Scheme, and Lisp.
You will get extra credit for writing a web-version that runs on ALL
web browsers. Make sure that you specify the URL in your assignment
writeup.
- Static Evaluator:
- Minimax:
pruning:
- Documentation and description of algorithms:
Assignment 2, Due Sept. 27 at 5:00 p.m.
Connect 4
This document was generated using the
LaTeX2HTML translator Version 2002-2-1 (1.71)
Copyright © 1993, 1994, 1995, 1996,
Nikos Drakos,
Computer Based Learning Unit, University of Leeds.
Copyright © 1997, 1998, 1999,
Ross Moore,
Mathematics Department, Macquarie University, Sydney.
The command line arguments were:
latex2html -split 1 as2
The translation was initiated by Sushil Louis on 2005-09-21
Sushil Louis
2005-09-21