def test_is_valid_obstructed(self):
q = pc.Queen(3, 3)
p = pc.Pawn(3, 4)
b = board.Board()
b.pieces.extend([q, p])
self.assertTrue(move.Move(q, T(1, 1, 1)).is_valid(b))
self.assertFalse(move.Move(q, T(0, 1, 2)).is_valid(b))
self.assertFalse(move.Move(q, T(0, 1, 1)).is_valid(b))
def test_is_valid_capture(self):
q = pc.Queen(3, 3)
p = pc.Pawn(3, 4)
r = pc.Rook(2, 3, True)
b = board.Board()
b.pieces.extend([q, p, r])
self.assertTrue(move.Move(q, T(1, 1, 1)).is_valid(b))
self.assertFalse(move.Move(q, T(0, 1, 1)).is_valid(b))
self.assertTrue(move.Move(q, T(-1, 0, 1)).is_valid(b))
def test_is_valid_board_limits(self):
q = pc.Queen(0, 0)
b = board.Board()
# Remove initial board setup
b.pieces = [q]
self.assertTrue(move.Move(q, T(1, 1, 1)).is_valid(b))
self.assertFalse(move.Move(q, T(-1, 1, 1)).is_valid(b))
self.assertFalse(move.Move(q, T(1, -1, 1)).is_valid(b))
n = pc.Knight(6, 6)
self.assertTrue(move.Move(n, T(-2, 1, 1)).is_valid(b))
self.assertFalse(move.Move(n, T(2, 1, 1)).is_valid(b))
self.assertFalse(move.Move(n, T(-1, 2, 1)).is_valid(b))
def test_capture_value(self):
q = pc.Queen(3, 3)
p = pc.Pawn(3, 4)
r = pc.Rook(2, 3, True)
b = board.Board()
b.pieces.extend([q, p, r])
m1 = move.Move(q, T(1, 1, 1))
self.assertTrue(m1.is_valid(b))
self.assertEqual(m1.value(b), 0)
self.assertFalse(move.Move(q, T(0, 1, 1)).is_valid(b))
m2 = move.Move(q, T(-1, 0, 1))
self.assertTrue(m2.is_valid(b))
self.assertEqual(m2.value(b), 5)
def _populate_new_board(self):
# set up a blank chess board
self.pieces.append(pc.Rook(0, 0))
self.pieces.append(pc.Knight(1, 0))
self.pieces.append(pc.Bishop(2, 0))
self.pieces.append(pc.Queen(3, 0))
self.pieces.append(pc.King(4, 0))
self.pieces.append(pc.Bishop(5, 0))
self.pieces.append(pc.Knight(6, 0))
self.pieces.append(pc.Rook(7, 0))
for i in range(8):
self.pieces.append(pc.Pawn(i, 1))
self.pieces.append(pc.Rook(0, 7, True))
self.pieces.append(pc.Knight(1, 7, True))
self.pieces.append(pc.Bishop(2, 7, True))
self.pieces.append(pc.Queen(3, 7, True))
self.pieces.append(pc.King(4, 7, True))
self.pieces.append(pc.Bishop(5, 7, True))
self.pieces.append(pc.Knight(6, 7, True))
self.pieces.append(pc.Rook(7, 7, True))
for i in range(8):
self.pieces.append(pc.Pawn(i, 6, True))
def test_undo(self):
b = pc.Bishop(5, 5)
q = pc.Queen(6, 6, True)
bo = board.Board()
bo._clear_board()
bo.pieces.append(b)
bo.pieces.append(q)
m = move.Move(b, T(1, 1, 1))
m.is_valid(bo)
self.assertTrue(bo.to_play == bo.WHITE)
m.apply(bo)
m.undo(bo)
self.assertTrue(bo.to_play == bo.WHITE)
self.assertEqual(b.get_position()[0], 5)
self.assertEqual(b.get_position()[1], 5)
self.assertEqual(bo.get_piece_at(6, 6), q)
def test_get_position(self):
q = P.Queen(4, 5)
pos = q.get_position()
self.assertEqual(pos[0], 4)
self.assertEqual(pos[1], 5)
class Board():
WHITE = True
BLACK = False
def __init__(self):
self.pieces = []
self._populate_new_board()
self.to_play = self.WHITE
def _populate_new_board(self):
# set up a blank chess board
self.pieces.append(pc.Rook(0, 0))
self.pieces.append(pc.Knight(1, 0))
self.pieces.append(pc.Bishop(2, 0))
self.pieces.append(pc.Queen(3, 0))
self.pieces.append(pc.King(4, 0))
self.pieces.append(pc.Bishop(5, 0))
self.pieces.append(pc.Knight(6, 0))
self.pieces.append(pc.Rook(7, 0))
for i in range(8):
self.pieces.append(pc.Pawn(i, 1))
self.pieces.append(pc.Rook(0, 7, True))
self.pieces.append(pc.Knight(1, 7, True))
self.pieces.append(pc.Bishop(2, 7, True))
self.pieces.append(pc.Queen(3, 7, True))
self.pieces.append(pc.King(4, 7, True))
self.pieces.append(pc.Bishop(5, 7, True))
self.pieces.append(pc.Knight(6, 7, True))
self.pieces.append(pc.Rook(7, 7, True))
for i in range(8):
self.pieces.append(pc.Pawn(i, 6, True))
def get_piece_at(self, x, y):
for p in self.pieces:
if (p.is_at(x, y)):
return p
def remove_piece_at(self, x, y):
p = self.get_piece_at(x, y)
self.pieces.remove(p)
def change_turn(self):
self.to_play = not self.to_play
def render(self):
rendered = ""
for y in range(7, -1, -1):
for x in range(8):
p = self.get_piece_at(x, y)
if (p):
rendered = rendered + p.str()
else:
rendered = rendered + "."
rendered = rendered + "\n"
return rendered
#-----------------------------------------
# Private utility methods for ease of testing
def _clear_board(self):
self.pieces = []
PIECE_MAP = {
'r': lambda x, y, is_black: pc.Rook(x, y, is_black),
'n': lambda x, y, is_black: pc.Knight(x, y, is_black),
'b': lambda x, y, is_black: pc.Bishop(x, y, is_black),
'q': lambda x, y, is_black: pc.Queen(x, y, is_black),
'k': lambda x, y, is_black: pc.King(x, y, is_black),
'p': lambda x, y, is_black: pc.Pawn(x, y, is_black)
}
def _setup_position_from_representation(self, board_string):
self._clear_board()
rows = board_string.split('\n')
for y in range(8):
for x in range(8):
p = rows[7 - y][x]
if (p.lower() in self.PIECE_MAP):
self.pieces.append(self.PIECE_MAP[p.lower()](x, y,
p.islower()))
