1 from naja.constants import BITS, MOVES
4 class PlayerBits(object):
9 def __init__(self, bits):
17 def bits(self, value):
18 assert 0 <= value <= 0xff
21 # Operate on individual bits
23 def check_bit(self, bit):
24 return bool(self.bits & (1 << bit))
26 def set_bit(self, bit):
27 self.bits |= (1 << bit)
29 def clear_bit(self, bit):
30 self.bits &= (0xff ^ (1 << bit))
32 def toggle_bit(self, bit):
33 self.bits ^= (1 << bit)
35 # Operate on sets of bits
37 def check_bits(self, bits):
38 return all(self.check_bit(bit) for bit in bits)
40 def set_bits(self, bits):
44 def clear_bits(self, bits):
48 def toggle_bits(self, bits):
52 def shift_bits_left(self, shift):
55 def shift_bits_right(self, shift):
61 A representation of the player.
64 def __init__(self, bits, position, movement_mode=None):
65 self.bits = PlayerBits(bits)
66 self.position = position
67 self.movement_mode = movement_mode if movement_mode else MOVES.ADJACENT
70 def import_player(cls, definition):
73 tuple(definition['position']),
74 definition['movement_mode'])
78 'bits': self.bits.bits,
79 'position': list(self.position),
80 'movement_mode': self.movement_mode,
83 def get_adjacent_positions(self):
84 positions = [self.position]
88 if self.bits.check_bit(BITS.NORTH) and y > 0:
89 positions.append((x, y - 1))
90 if self.bits.check_bit(BITS.SOUTH) and y < 4:
91 positions.append((x, y + 1))
92 if self.bits.check_bit(BITS.EAST) and x < 4:
93 positions.append((x + 1, y))
94 if self.bits.check_bit(BITS.WEST) and x > 0:
95 positions.append((x - 1, y))
99 def get_knight_positions(self):
100 positions = set([self.position])
107 if 0 <= i < 5 and 0 <= j < 5:
108 positions.add((i, j))
111 if 0 <= i < 5 and 0 <= j < 5:
112 positions.add((i, j))
114 return sorted(list(positions))
116 def get_bishop_positions(self):
124 positions.add((i, j))
128 positions.add((i, j))
130 return sorted(list(positions))
132 def get_castle_positions(self):
138 positions.add((x, i))
139 positions.add((i, y))
141 return sorted(list(positions))
143 def set_position(self, new_position):
144 if new_position in self.legal_moves():
145 self.position = new_position
146 self.movement_mode = MOVES.ADJACENT
150 def legal_moves(self):
151 POSITION_FUNCTION = {
152 MOVES.ADJACENT: self.get_adjacent_positions,
153 MOVES.KNIGHT: self.get_knight_positions,
154 MOVES.BISHOP: self.get_bishop_positions,
155 MOVES.CASTLE: self.get_castle_positions,
157 return POSITION_FUNCTION[self.movement_mode]()
159 def allow_chess_move(self, chesspiece):
160 self.movement_mode = chesspiece