Homework 3: Expanded Engagement Classification
This scheme expands on the earlier assignment to set-up a undesigning textbased possession frolic. This scheme focuses on processizing the processes of your software. There are three tasks that your software must accomplish.
1. Create a benefactor
2. Create a prodigy
3. Run the engagement algorithm: benefactor versus prodigy
The overhead defines the basic essential constitution for a accomplished frolic. In the pristine exhibition, the player accomplish determine how to best set-up their own benefactor. In the promote exhibition, the rankification accomplish haphazardly originate a prodigy such as a gorgon, orc, or troll. In the terminal exhibition, the rankification accomplish complete a turnbased engagement rankification harmonious to the one in the earlier assignment. You should test the uncertain responsibilities that direct your software rankification and mould them using processs.
We accomplish disclose this scheme using an iterative plan temporization suitableness testing our command betwixt each succession. Your pristine succession should set-out delay instrumenting a process that creates a benefactor. The promote succession should instrument a process that creates a prodigy. The terminal succession should instrument a process that manages the engagement algorithm. This engagement process may insufficiency to call submethods which touch the uncertain onset options such as: disturbance possessions, enchantment possessions, advise possessions, or decamp possessions. You are encouraged to customize, variegate, or plan your very own engagement rules and stats so desire as you coalesce the poverty enumerate of options as listed delayin these specifications.
You accomplish set-up a undesigning frolic contact that uses all the essential concepts that we bear adept up to Chapter 5. Concepts you may insufficiency to investigate using for your frolic may include:
1. Named Constants (used for evaluating & executing user input)
2. Class variables (frolic basis must be undetermined to all processs in rank)
3. Enumeration types (models the likely frolic states)
4. Class processs (used to violate down the frolic logic into undesigningr volume)
5. Passing parameters (ignoring topical basis eager from one process to another)
6. Returning values (ignoring topical basis unskilled from one process to another)
7. Logical operators (evaluate multiple criteria for loop moderate)
8. Repetition statements (genius fable and engagement loop)
9. Random rank (originate scoped haphazard values for impairment & sanity)