responded to a couple comments. As mentioned before, I've got some work to do reworking game and view to actually do their jobs.
This commit is contained in:
parent
32b944a6db
commit
6de2542e08
|
@ -14,11 +14,18 @@ class Board:
|
|||
def get_initial_state(self):
|
||||
# For now we will use a 4x4 board and place the amazons in the middle
|
||||
# four squares, diagonlally from eachother for symmetry.
|
||||
# Note that because the board is symettrical, one of the players must
|
||||
# Note that because the board is symetrical, one of the players must
|
||||
# have an advantage... but is it player 1 or player 2?
|
||||
# CP: How does it follow that symmetrical board -> imbalance?
|
||||
# FG: It's because going first must therefore either be an advatage or
|
||||
# disadvantage, since geometrically the starting positions are identical.
|
||||
# CP: What if a game worked by flipping a coin at the beginning of each turn
|
||||
# CP: to decide which player will play?
|
||||
# FG: Of course, I suspect it would be a much worse game lol.
|
||||
# FG: You might consider also adding random elements, like rolling
|
||||
# FG: a die to see the maximum distance you can move on a turn.
|
||||
# FG: However, aside from mathematic and computational curiosity,
|
||||
# FG: it's not clear to me why we would want to bother implementing it.
|
||||
return [[0,0,0,0],[0,2,3,0],[0,3,2,0],[0,0,0,0]]
|
||||
|
||||
def get_active_player_code(self):
|
||||
|
|
|
@ -32,9 +32,9 @@ def turn():
|
|||
tui(board)
|
||||
print("Valid coordinates look like: \'b2\' or \'c4\'")
|
||||
# CP: Use None to represent nullity
|
||||
amazon = 'none'
|
||||
move = 'none'
|
||||
burn = 'none'
|
||||
amazon = None
|
||||
move = None
|
||||
burn = None
|
||||
while good_square_checker(amazon) == False:
|
||||
amazon = input("Choose a square containing the amazon of your choice: ")
|
||||
while good_square_checker(move) == False:
|
||||
|
|
Loading…
Reference in New Issue