Need BerryField.py, Tourist,py, Bears.py, part1, part2, and part3
CSCI 1100 — Computer Science 1 Homework 8 Bears, Berries and Tourists Redux: Classes Overview This homework is worth 100 points toward your overall homework grade, and is due Wednesday, December 11, 2019 at 11:59:59 pm. It has three parts. The first two are not worth many points, and may end up being worth 0. They are mainly there to give you information to help you debug your solution. Please download hw8_files_F19.zip. and unzip it into the directory for your HW8. You will find data files and sample outputs for each of the parts. The goal of this assignment is to work with classes. You will be asked to write a simulation engine and use classes to encapsulate data and functionality. You will have a lot of design choices to make. While we have done simulations before, this one will be more complex. It is especially important that you start slowly, build a program that works for simple cases, test it and then add more complexity. We will provide test cases of increasing difficulty. Make sure you develop slowly and test throughly. Submission Instructions In this homework, for the first time, you will be submitting multiple files to Submitty that together comprise a single program. Please follow these instructions carefully. Each of Part 1, Part 2 and Part 3 will require you to to write a main program: hw8_part1.py, hw8_part2.py and hw8_part3.py, respectively. You must also submit three modules per part in addition to this main file, each of which encapsulates a class. The first is a file called BerryField.py that contains your berry class, a file called Bear.py that contains your Bear class and a file called Tourist.py that contains your Tourist class. As always, make sure you follow the program structure guidelines. You will be graded on good program structure as well as program correctness. Remember as well that we will be continuing to test homeworks for similarity. So, follow our guidelines for the acceptable levels of collaboration. You can download the guidelines from the resources section in the Course Materials if you need a refresher. We take this very seriously and will not hesitate to impose penalties when warranted. Getting Started You will need to write at least three classes for this assignment corresponding to a BerryField, a Bear and a Tourist. We are going to give you a lot of freedom in how you organize these three classes, but each class must have at least an initializer and a string method. Additional methods are up to you. Each of the classes is described below. BerryField The berry field must maintain and manage the location of berries as a square Row X Column grid with (0,0) being the upper left corner and (N-1, N-1) being the lower right corner. Each space holds 0-10 berry units. • The initializer class must, minimally, be able to take in a grid of values (think of our Sodoku lab) and use it to create a berry field with the values contained in the grid. • The string function must, minimally, be able to generate a string of the current state of the berry patch. Each block in the grid must be formatted with the "{:>4}" format specifier. If there is a bear at the location the grid should have a "B", if there is a tourist the grid should have a "T", and if there is both a bear and a tourist the grid should have an "X". If there is neither a bear nor a tourist, it should have the number of berries at the location. • Berries grow. The berry class must provide a way to grow the berry field. When the berries grow, any location with a value 1 <= number="" of="" berries="">< 10 will gain an extra berry. • berries also spread. any location with no berries that is adjacent to a location with 10 berries will get 1 berry during the grow operation. bear each bear has a location and a direction in which they are walking. bears are also very hungry. in your program, you must manage 2 lists of bears. the first list are those bears that are currently walking in the field. the second is a queue of bears waiting to enter the field. • the initializer class must, minimally, be able to take in a row and column location and a direction of travel. • the string function must, minimally, be able to print out the location and direction of travel for the bear and if the bear is asleep. • bears can walk north (n), south (s), east (e), west (w), northeast (ne), northwest (nw), southeast (se), or southwest (sw). once a bear starts walking in a direction it never turns. • bears are always hungry. every turn, unless there is tourist on the same spot, the bear eats all the berries available on the space and then moves in its current direction to the next space. this continues during the current turn until the bear eats 30 berries or runs into a tourist. • for the special case of a bear and a tourist being in the same place during a turn, the bear does not eat any berries, but the tourist mysteriously disappears and the bear falls asleep for three turns. • once a bear reaches the boundary of the field (its row or column becomes -1 or n), it is no longer walking in the field and need not be considered any longer. tourist each tourist has a location. just like with bears, you must someplace maintain a list of tourists currently in the field and a queue of tourists waiting to enter the field. • the initializer class must, minimally, be able to take in a row and column location. • tourists see a bear if the bear is within 4 of their current position. • the string function must, minimally, be able to print out the location of the tourist and how many turns have passed since they have seen a bear. • tourists stand and watch. they do not move, but they will leave the field if 1. three turns pass without them seeing a bear they get bored and go home. 2. they can see three bears at the same time they get scared and go home 3. a bear runs into them they mysteriously disappear and can no longer be found in the field. execution remember to get hw8_files_f19.zip from the course materials section of submitty. it has two sample input files and the expected output for your program. for this homework all of the data required to initialize your classes and program can be found in json files. each of your 3 parts should start by asking for the name of the json file, reading the file, and then creating the objects you need based on the data read. the code below will help you with this. f = open("bears_and_berries_1.json") data = json.loads(f.read()) print(data["berry_field"]) print(data["active_bears"]) print(data["reserve_bears"]) print(data["active_tourists"]) print(data["reserve_tourists"]) you will see that field in a list of lists where each [row][column] value is the number of berries at that location; the "active_bears" and "reserve_bears" entries are lists of three-tuples (row, column, direction) defining the bears; and the "active_tourists" and "reserve_tourists" entries are lists of two-tuples (row, column) defining the tourists. part 1 in part one, read the json file, create your objects and then simply report on the initial state of the simulation by printing out the berry field, active bears, and active tourists. name your program hw8_part1.py and submit it along with the three classes you developed. part 2 in part two, start off the same by reading the json file and create your objects and again print out the initial state of the simulation. then run five turns of the simulation by: • growing the berries • moving the bears • checking on the tourists • print out the state of the simulation do not worry about the reserve bears or reserve tourists entering the field, but report on any tourists or bears that leave. name your program hw8_part2.py and submit it along with the three classes you developed. part 3 in part three, do everthing you did in part 2, but make the following changes. • after checking on the tourists, if there are still bears in the reserve queue and at least 500 berries, add the next reserve bear to the active bears. • then, if there is are still tourists in the reserve queue and at least 1 active bear, add the next reserve tourist to the field. • instead of stopping after 5 turns, run until there are no more bears on the field and no more bears in the reserve list; or if there are no more bears on the field and no more berries. • finally, instead of reporting status every turn, report it every 5 turns and then again when the simulation ends. as you go, report on any tourists or bears that leave or enter the field. name your program hw8_part3.py and submit it along with the three classes you developed. 10="" will="" gain="" an="" extra="" berry.="" •="" berries="" also="" spread.="" any="" location="" with="" no="" berries="" that="" is="" adjacent="" to="" a="" location="" with="" 10="" berries="" will="" get="" 1="" berry="" during="" the="" grow="" operation.="" bear="" each="" bear="" has="" a="" location="" and="" a="" direction="" in="" which="" they="" are="" walking.="" bears="" are="" also="" very="" hungry.="" in="" your="" program,="" you="" must="" manage="" 2="" lists="" of="" bears.="" the="" first="" list="" are="" those="" bears="" that="" are="" currently="" walking="" in="" the="" field.="" the="" second="" is="" a="" queue="" of="" bears="" waiting="" to="" enter="" the="" field.="" •="" the="" initializer="" class="" must,="" minimally,="" be="" able="" to="" take="" in="" a="" row="" and="" column="" location="" and="" a="" direction="" of="" travel.="" •="" the="" string="" function="" must,="" minimally,="" be="" able="" to="" print="" out="" the="" location="" and="" direction="" of="" travel="" for="" the="" bear="" and="" if="" the="" bear="" is="" asleep.="" •="" bears="" can="" walk="" north="" (n),="" south="" (s),="" east="" (e),="" west="" (w),="" northeast="" (ne),="" northwest="" (nw),="" southeast="" (se),="" or="" southwest="" (sw).="" once="" a="" bear="" starts="" walking="" in="" a="" direction="" it="" never="" turns.="" •="" bears="" are="" always="" hungry.="" every="" turn,="" unless="" there="" is="" tourist="" on="" the="" same="" spot,="" the="" bear="" eats="" all="" the="" berries="" available="" on="" the="" space="" and="" then="" moves="" in="" its="" current="" direction="" to="" the="" next="" space.="" this="" continues="" during="" the="" current="" turn="" until="" the="" bear="" eats="" 30="" berries="" or="" runs="" into="" a="" tourist.="" •="" for="" the="" special="" case="" of="" a="" bear="" and="" a="" tourist="" being="" in="" the="" same="" place="" during="" a="" turn,="" the="" bear="" does="" not="" eat="" any="" berries,="" but="" the="" tourist="" mysteriously="" disappears="" and="" the="" bear="" falls="" asleep="" for="" three="" turns.="" •="" once="" a="" bear="" reaches="" the="" boundary="" of="" the="" field="" (its="" row="" or="" column="" becomes="" -1="" or="" n),="" it="" is="" no="" longer="" walking="" in="" the="" field="" and="" need="" not="" be="" considered="" any="" longer.="" tourist="" each="" tourist="" has="" a="" location.="" just="" like="" with="" bears,="" you="" must="" someplace="" maintain="" a="" list="" of="" tourists="" currently="" in="" the="" field="" and="" a="" queue="" of="" tourists="" waiting="" to="" enter="" the="" field.="" •="" the="" initializer="" class="" must,="" minimally,="" be="" able="" to="" take="" in="" a="" row="" and="" column="" location.="" •="" tourists="" see="" a="" bear="" if="" the="" bear="" is="" within="" 4="" of="" their="" current="" position.="" •="" the="" string="" function="" must,="" minimally,="" be="" able="" to="" print="" out="" the="" location="" of="" the="" tourist="" and="" how="" many="" turns="" have="" passed="" since="" they="" have="" seen="" a="" bear.="" •="" tourists="" stand="" and="" watch.="" they="" do="" not="" move,="" but="" they="" will="" leave="" the="" field="" if="" 1.="" three="" turns="" pass="" without="" them="" seeing="" a="" bear="" they="" get="" bored="" and="" go="" home.="" 2.="" they="" can="" see="" three="" bears="" at="" the="" same="" time="" they="" get="" scared="" and="" go="" home="" 3.="" a="" bear="" runs="" into="" them="" they="" mysteriously="" disappear="" and="" can="" no="" longer="" be="" found="" in="" the="" field.="" execution="" remember="" to="" get="" hw8_files_f19.zip="" from="" the="" course="" materials="" section="" of="" submitty.="" it="" has="" two="" sample="" input="" files="" and="" the="" expected="" output="" for="" your="" program.="" for="" this="" homework="" all="" of="" the="" data="" required="" to="" initialize="" your="" classes="" and="" program="" can="" be="" found="" in="" json="" files.="" each="" of="" your="" 3="" parts="" should="" start="" by="" asking="" for="" the="" name="" of="" the="" json="" file,="" reading="" the="" file,="" and="" then="" creating="" the="" objects="" you="" need="" based="" on="" the="" data="" read.="" the="" code="" below="" will="" help="" you="" with="" this.="" f="open("bears_and_berries_1.json")" data="json.loads(f.read())" print(data["berry_field"])="" print(data["active_bears"])="" print(data["reserve_bears"])="" print(data["active_tourists"])="" print(data["reserve_tourists"])="" you="" will="" see="" that="" field="" in="" a="" list="" of="" lists="" where="" each="" [row][column]="" value="" is="" the="" number="" of="" berries="" at="" that="" location;="" the="" "active_bears"="" and="" "reserve_bears"="" entries="" are="" lists="" of="" three-tuples="" (row,="" column,="" direction)="" defining="" the="" bears;="" and="" the="" "active_tourists"="" and="" "reserve_tourists"="" entries="" are="" lists="" of="" two-tuples="" (row,="" column)="" defining="" the="" tourists.="" part="" 1="" in="" part="" one,="" read="" the="" json="" file,="" create="" your="" objects="" and="" then="" simply="" report="" on="" the="" initial="" state="" of="" the="" simulation="" by="" printing="" out="" the="" berry="" field,="" active="" bears,="" and="" active="" tourists.="" name="" your="" program="" hw8_part1.py="" and="" submit="" it="" along="" with="" the="" three="" classes="" you="" developed.="" part="" 2="" in="" part="" two,="" start="" off="" the="" same="" by="" reading="" the="" json="" file="" and="" create="" your="" objects="" and="" again="" print="" out="" the="" initial="" state="" of="" the="" simulation.="" then="" run="" five="" turns="" of="" the="" simulation="" by:="" •="" growing="" the="" berries="" •="" moving="" the="" bears="" •="" checking="" on="" the="" tourists="" •="" print="" out="" the="" state="" of="" the="" simulation="" do="" not="" worry="" about="" the="" reserve="" bears="" or="" reserve="" tourists="" entering="" the="" field,="" but="" report="" on="" any="" tourists="" or="" bears="" that="" leave.="" name="" your="" program="" hw8_part2.py="" and="" submit="" it="" along="" with="" the="" three="" classes="" you="" developed.="" part="" 3="" in="" part="" three,="" do="" everthing="" you="" did="" in="" part="" 2,="" but="" make="" the="" following="" changes.="" •="" after="" checking="" on="" the="" tourists,="" if="" there="" are="" still="" bears="" in="" the="" reserve="" queue="" and="" at="" least="" 500="" berries,="" add="" the="" next="" reserve="" bear="" to="" the="" active="" bears.="" •="" then,="" if="" there="" is="" are="" still="" tourists="" in="" the="" reserve="" queue="" and="" at="" least="" 1="" active="" bear,="" add="" the="" next="" reserve="" tourist="" to="" the="" field.="" •="" instead="" of="" stopping="" after="" 5="" turns,="" run="" until="" there="" are="" no="" more="" bears="" on="" the="" field="" and="" no="" more="" bears="" in="" the="" reserve="" list;="" or="" if="" there="" are="" no="" more="" bears="" on="" the="" field="" and="" no="" more="" berries.="" •="" finally,="" instead="" of="" reporting="" status="" every="" turn,="" report="" it="" every="" 5="" turns="" and="" then="" again="" when="" the="" simulation="" ends.="" as="" you="" go,="" report="" on="" any="" tourists="" or="" bears="" that="" leave="" or="" enter="" the="" field.="" name="" your="" program="" hw8_part3.py="" and="" submit="" it="" along="" with="" the="" three="" classes="" you="">