jirikalvoda/SKSP_2022_strategicka_hra
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

Strategická: Fix chybek

Browse source
This commit is contained in:
David Klement 2022-09-18 11:49:16 +02:00
parent 0961d4161c
commit 626f29f7fd
1 changed files with 6 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

12
klient/play.py
View file

@ -37,8 +37,8 @@ state: State
class Member: class Member:
def __init__(self, field: Field, team: int, id: int): def __init__(self, field: Field, team: int, id: int) -> None:
self.field = field, self.field = field
self.team = team self.team = team
self.id = id self.id = id
self.action = Action.STAY self.action = Action.STAY
@ -49,7 +49,7 @@ class Field:
def __init__(self, i: int, j: int, hill: bool, def __init__(self, i: int, j: int, hill: bool,
home_for_team: Optional[int], home_for_team: Optional[int],
occupied_by_team: Optional[int]): occupied_by_team: Optional[int]) -> None:
self.i = i self.i = i
self.j = j self.j = j
self.hill = hill self.hill = hill
@ -79,7 +79,7 @@ class Field:
neighbour_i = self.i neighbour_i = self.i
neighbour_j = self.j neighbour_j = self.j
# ensure coords are in bounds # ensure coords are in bounds
neighbour_i %= len(state.world), neighbour_i %= len(state.world)
neighbour_j %= len(state.world[0]) neighbour_j %= len(state.world[0])
return state.world[neighbour_i][neighbour_j] return state.world[neighbour_i][neighbour_j]
@ -147,10 +147,10 @@ def pathfind(member: Member, goal: Field) -> Action:
if (neighbour in explored or if (neighbour in explored or
not neighbour.is_accessible(member.team)): not neighbour.is_accessible(member.team)):
continue continue
if field == member.field: if neighbour == member.field:
return action.invert() return action.invert()
queue.append(neighbour) queue.append(neighbour)
explored.add(field) explored.add(neighbour)
return Action.STAY return Action.STAY