def test_newB_heuristicPiecesCovered(self):
# Maximum covered value for new board is 39
wVal = heuristicPiecesCovered(ChessBoard.WHITE, getBoardNew())
bVal = heuristicPiecesCovered(ChessBoard.BLACK, getBoardNew())
properRetVal = -1 + 29 / 39 * 2
self.assertTrue(wVal == properRetVal)
self.assertTrue(bVal == properRetVal)
def test_bCmplx_heuristicPiecesCovered(self):
# Maximum covered value for new board is 39
wVal = heuristicPiecesCovered(ChessBoard.WHITE, getBoardComplex())
bVal = heuristicPiecesCovered(ChessBoard.BLACK, getBoardComplex())
properWhiteVal = -1 + 28 / 39 * 2
properBlackVal = -1 + 19 / 35 * 2
self.assertTrue(wVal == properWhiteVal)
self.assertTrue(bVal == properBlackVal)