CIT 591 Assignment 3: Three Musketeers
Fall 2010, David Matuszek
Write a program to play the game of Three Musketeers--human against computer.
You have probably never heard of this game. That's okay, the rules are simple--that's why I chose it. The link above is to a Wikipedia article that explains the game, and I can answer questions if necessary. It also happens to be a pretty good game.
The human should be able to choose which side to play: the Musketeers, or Cardinal Richelieu's men. Once chosen, the human plays the same side for the entire game. The Musketeers always move first.
After each move--computer or human--the program should print out the new game board. This could be just a display of the pieces, or it could be a display with rows and columns labeled in some fashion. For example, you might print the board like one of these:
R R R R M R R R R R R R M R R R R R R R M R R R R A B C D E ----------- 1 | R R R R M 2 | R R R R R 3 | R R M R R 4 | R R R R R 5 | M R R R R 1 2 3 4 5 ----------- 1 | R R R R M 2 | R R R R R 3 | R R M R R 4 | R R R R R 5 | M R R R R
In addition, after each move, you should print a message telling what piece moved where. Don't make the user compare two game boards to figure out what just happened.
It's up to you and your partner to figure out the best way for the human to enter moves. When the program is run, it must explain how to enter moves; do this once, when the game is first started. If we can't figure out how to enter moves, when we grade your program, you will lose points. The easier it is to use your program, the more fun it will be to play.
Of course, the computer should prevent the human from making illegal moves. It should also tell when the game is over, and who won.
Since we will be calling your methods with our own testing methods, it is essential that you follow these instructions exactly.
The "board" will be represented as a list of five lists; each of these lists represents a row, and each list contains five elements. The first list represents the first row; the first element in each list represents the first column. The values in the list must each be one of three things: an
'M', representing a Musketeer, an
'R', representing one of Cardinal Richelieu's men; and a
'-', representing an empty space.
Directions will be given as one of the four strings
def create_board():returns: A list of five 5-element sublists.
[['R', 'R', 'R', 'R', 'M'], ['R', 'R', 'R', 'R', 'R'], ['R', 'R', 'M', 'R', 'R'], ['R', 'R', 'R', 'R', 'R'], ['M', 'R', 'R', 'R', 'R']]. The first sublist is regarded as the "top" row of the board, and the
'M'in it is in the righthand column.
returns: A (row, column) tuple.
def new_location(row, column, direction):
(new_row, new_column)that results from moving in the given direction. No error checking is done, so it is possible for this function to return an illegal location.
def is_legal_move(row, column, direction, board):
returns: True or False.
Trueif the move is legal. A move is legal if:
'M') and the move would be onto a square containing an enemy (
'R'), and it would be moving onto an empty (
Falseto be returned.
returns: True or False.
def has_legal_move(who, board):
'R'). Does not provide any information on where the legal move is, if one exists.
def make_move(row, column, direction, board):
returns: A board (a list of five 5-element sublists) .
board[row][column]in the indicated direction, and returns the modified board. The move is assumed to be legal (you should call
is_legal_movebefore calling this function).
returns: True or False.
Trueif the Musketeers are all in the same row, or all in the same column, and
globalkeyword anywhere. This constraint is to prevent you from modifying the values of global variables; it does not prevent you from using globally defined names. For example, I found it handy to globally define names like
M = 'M'and
left = 'left'.
start, should do any input or output.
The computer does not have to play a great game--it does have to play legally. If you would like to implement a simple strategy (rather than just make random moves), here's a start:
Again, don't spend any more time than necessary on strategy until after the program is working.
Here's what we will be looking for when we grade your program:
M = 'M', are okay.
= + - * / % <= < == != >= >
start) to determine whether they return the correct results. (For example,
is_legal_moveshould behave differently depending on whether the location contains a Musketeer, an enemy, or nothing, so we will probably have three tests for that function.) You will lose points for every test that fails.
Turn your assignment in to Blackboard before midnight Thursday, September 30. This is a pair programming assignment, so you should decide which of you will turn it in (we don't want to grade two copies of the same program). Be sure to put both of your names in a comment right at the top of the program.