101 lines
6.1 KiB
Python
101 lines
6.1 KiB
Python
import definitions
|
|
import graph
|
|
import random
|
|
class Plant:
|
|
def __init__(self, name, state):
|
|
self.name = name #nazwa rośliny np. "wheat"
|
|
self.state = state #etap rozwoju rośliny
|
|
def get_name(self):
|
|
return self.name
|
|
def set_name(self, name):
|
|
self.name = name
|
|
def get_state(self):
|
|
return self.state
|
|
def set_state(self, state):
|
|
self.state = state
|
|
@staticmethod
|
|
def get_closest_mature_plant(istate, map): # TO DO, pobiera współrzędne najbliższej dojrzałej rośliny od miejsca, w którym znajduje się traktor
|
|
x = None #x'owa pola
|
|
y = None #y'kowa pola
|
|
min = None
|
|
for i in range(definitions.WIDTH_AMOUNT):
|
|
for j in range(definitions.HEIGHT_AMOUNT):
|
|
field = map.fields[i][j]
|
|
if field.get_plant().get_name() == "beetroot" and field.get_plant().get_state() == definitions.BEETROOTS_MAXIMUM_STATE:
|
|
if min is None:
|
|
x = i
|
|
y = j
|
|
min = len((graph.graphsearch([], [], (x, y), istate, graph.succ)))
|
|
else:
|
|
if len((graph.graphsearch([], [], (x, y), istate, graph.succ))) < min:
|
|
x = i
|
|
y = j
|
|
min = len((graph.graphsearch([], [], (x, y), istate, graph.succ)))
|
|
elif field.get_plant().get_name() == "carrot" and field.get_plant().get_state() == definitions.CARROTS_MAXIMUM_STATE:
|
|
if min is None:
|
|
x = i
|
|
y = j
|
|
min = len((graph.graphsearch([], [], (x, y), istate, graph.succ)))
|
|
else:
|
|
if len((graph.graphsearch([], [], (x, y), istate, graph.succ))) < min:
|
|
x = i
|
|
y = j
|
|
min = len((graph.graphsearch([], [], (x, y), istate, graph.succ)))
|
|
elif field.get_plant().get_name() == "potato" and field.get_plant().get_state() == definitions.POTATOES_MAXIMUM_STATE:
|
|
if min is None:
|
|
x = i
|
|
y = j
|
|
min = len((graph.graphsearch([], [], (x, y), istate, graph.succ)))
|
|
else:
|
|
if len((graph.graphsearch([], [], (x, y), istate, graph.succ))) < min:
|
|
x = i
|
|
y = j
|
|
min = len((graph.graphsearch([], [], (x, y), istate, graph.succ)))
|
|
elif field.get_plant().get_name() == "wheat" and field.get_plant().get_state() == definitions.WHEAT_MAXIMUM_STATE:
|
|
if min is None:
|
|
x = i
|
|
y = j
|
|
min = len((graph.graphsearch([], [], (x, y), istate, graph.succ)))
|
|
else:
|
|
if len((graph.graphsearch([], [], (x, y), istate, graph.succ))) < min:
|
|
x = i
|
|
y = j
|
|
min = len((graph.graphsearch([], [], (x, y), istate, graph.succ)))
|
|
return x, y
|
|
@staticmethod
|
|
def grow_flower_dandelion(map): #metoda statyczna, losująca czy na danym polu ma urosnąć kwiat dandelion
|
|
for i in range(definitions.WIDTH_AMOUNT):
|
|
for j in range(definitions.HEIGHT_AMOUNT):
|
|
field = map.get_fields()[i][j]
|
|
if field.get_plant().get_name() == "none":
|
|
random1 = random.uniform(0, 100)
|
|
if random1 <= definitions.FLOWER_DANDELION_GROW_PROBABILITY:
|
|
field.get_plant().set_name("flower_dandelion")
|
|
field.get_plant().set_state(definitions.FLOWER_DANDELION_MAXIMUM_STATE)
|
|
@staticmethod
|
|
def grow_plants(map): #metoda statyczna, która zwiększa pole state (etap rozwoju rośliny) dla danej rośliny na danym polu o 1
|
|
for i in range(definitions.WIDTH_AMOUNT):
|
|
for j in range(definitions.HEIGHT_AMOUNT):
|
|
field = map.get_fields()[i][j]
|
|
if field.get_plant().get_name() == "beetroot" and field.get_plant().get_state() > 0 and field.get_plant().get_state() < definitions.BEETROOTS_MAXIMUM_STATE:
|
|
field.get_plant().set_state(field.get_plant().get_state() + 1)
|
|
elif field.get_plant().get_name() == "carrot" and field.get_plant().get_state() > 0 and field.get_plant().get_state() < definitions.CARROTS_MAXIMUM_STATE:
|
|
field.get_plant().set_state(field.get_plant().get_state() + 1)
|
|
elif field.get_plant().get_name() == "potato" and field.get_plant().get_state() > 0 and field.get_plant().get_state() < definitions.POTATOES_MAXIMUM_STATE:
|
|
field.get_plant().set_state(field.get_plant().get_state() + 1)
|
|
elif field.get_plant().get_name() == "wheat" and field.get_plant().get_state() > 0 and field.get_plant().get_state() < definitions.WHEAT_MAXIMUM_STATE:
|
|
field.get_plant().set_state(field.get_plant().get_state() + 1)
|
|
@staticmethod
|
|
def if_any_mature_plant(map): #sprawdza czy na polu występuje choć jedna dojrzała roślina, jeśli tak zwraca prawdę, w przeciwnym razie zwraca fałsz
|
|
for i in range(definitions.WIDTH_AMOUNT):
|
|
for j in range(definitions.HEIGHT_AMOUNT):
|
|
field = map.get_fields()[i][j]
|
|
if field.get_plant().get_name() == "beetroot" and field.get_plant().get_state() == definitions.BEETROOTS_MAXIMUM_STATE:
|
|
return True
|
|
elif field.get_plant().get_name() == "carrot" and field.get_plant().get_state() == definitions.CARROTS_MAXIMUM_STATE:
|
|
return True
|
|
elif field.get_plant().get_name() == "potato" and field.get_plant().get_state() == definitions.POTATOES_MAXIMUM_STATE:
|
|
return True
|
|
elif field.get_plant().get_name() == "wheat" and field.get_plant().get_state() == definitions.WHEAT_MAXIMUM_STATE:
|
|
return True
|
|
return False |