CS 4960 Fall Semester 1999

Problem 3-2

Assigned: 7 September 1999 Due: 16 September 1999

Write a Matlab program to determine which property is most frequently landed on in a game of Monopoly. Take into account the go to's from the two card decks (Community Chest and Chance), as well as the Go To Jail location on the board.

Info on Game:

Monopoly Squares

         1    Mediterranean Place
         2 Community Chest
         3    Baltic Ave
         4 Income Tax
         5    Reading RR
         6    Oriental Ave
         7 Chance
         8    Vermont Ave
         9    Commecticut Ave
        10 Jail
        11    St. Charles Place
        12    Electric Company
        13    States Ave
        14    Virginia Ave
        15    Pennsylvania RR
        16    St. James Place
        17 Community Chest
        18    Tennessee
        19    New York
        20 Free Parking
        21    Kentucky Ave
        22 Chance
        23    Indiana
        24    Illinois Ave
        25    B&O RR
        26    Atlantic Ave
        27    Ventnor Place
        28    Water Works
        29    Marvin Gardens
        30 Go To Jail
        31    Pacific
        32    North Carolina
        33 Community Chest
        34    Pennsylvania
        35    Short Line RR
        36 Chance
        37    Park Place
        38 Luxury Tax
        39    Boardwalk
        40 Go

The cards are as follows:

Community Chest

Go to jail
Advance to go

Chance

Advance to nearest railroad
Advance to nearest railroad (2nd card)
Go back 3 spaces
Go to jail
Advance to go
Advance to St. Charles Place
Advance to nearest utility
Advance to the Reading Railroad
Advance to Board Walk
Advance to Illinois Avenue