CO2402 - Advanced Programming With C++ - Classic Board Game Monopoly - Report Writing - IT Assignment Help

Download Solution Order New Solution
Assignment Task

 

Introduction
For this assignment, you will work towards implementing a simplified version of the classic board game Monopoly. This is not an interactive game you can play, but rather a simulation of two players taking turns over a set number of rounds. Play is to be automated according to a sequence of pseudo-random numbers - there is no artificial intelligence, and no user input. All output will be text based and directed towards the console – there are no graphical elements to this assignment.

 

Learning Outcomes Assessed
• Make an informed choice of implementation method for a given problem (e.g. procedural, console, event-driven, object-oriented etc.)
• Implement and document a structured program to meet a given specification
• Select and apply appropriate data structures and algorithms to a given problem

 

Resources

• This assignment has an associated set of support files.

  • monopoly.txt – A text file for reading in the game configuration
  • random.cpp – Code to generate a sequence of pseudo-random numbers from a seed
  • seed.txt – A text file containing the random number seed for testing
  • code style guide

 

• A set of sample output files for the various levels of the assignment will be provided for you to compare your own results against.

 

Overview

In your simulation, the game should have two players, each with a playing piece. Player 1 has a dog playing piece, and player 2 has a car (perhaps it is a broken-down old Jaguar?). At the start of the game, the pieces are placed on the “GO” square. Players also have an amount of money. Each player starts the game with £1,500. During the game, players are allowed to have negative amounts of money – they do not go bankrupt unless you are aiming for a high first class mark. A game is played as a series of rounds. During a round, each player takes one turn to roll a single die. You will represent rolling the die by generating a random number between 1 and 6 (using the code I
have provided – see appendix). The player then moves their piece clockwise round the board by the number of squares indicated on the die. Different things will happen according to the square landed on which may result in the player gaining or losing money. Exactly what happens on each square depends on how many marks you want...
The game will be played for 20 rounds. At the end of the game, the player with the most money is declared the winner.

 

Program Specification
You should implement the features described below in order. To be eligible for a mark within any classification, you must have at least attempted all the features for all the previous classifications.

Basic Scenario = bare pass (40% max)

If you implement only what is in this section and provide video evidence of it running to completion, you will get 40%. No more, no less.
• Create a class called CSquare to represent the squares on the board.
• Read in the data file Monopoly.txt (see appendix on the last page) and use it to set up an array of 26 CSquare objects.

  • You do not need to use pointers or dynamic memory allocation at this level.
  • Each line in the file represents one square.

 

•  The first number in each line represents the square’s type, but for a base pass, you can treat all squares the same.
•  Following the type number is the square’s name. You will need to store the name as data in the CSquare objects as you create them.

• For each player you need to store their name, money, and position on the game board.

  • You could use variables for this, but use of a structure or class would be nicer.

 

This CO2402 - IT Assignment has been solved by our IT Experts at My Uni Paper. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style.
Be it a used or new solution, the quality of the work submitted by our assignment experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.

Get It Done! Today

Country
Applicable Time Zone is AEST [Sydney, NSW] (GMT+11)
+

Every Assignment. Every Solution. Instantly. Deadline Ahead? Grab Your Sample Now.