def testHash():
puzzle0 = Peg.deserialize('1_11_010_1111_01101_')
puzzle1 = Peg.deserialize('1_11_010_1111_01101_')
puzzle2 = Peg.deserialize('1_11_100_0011_11110_')
puzzle3 = Peg.deserialize('0_10_100_1101_10111_')
assert hash(puzzle0) == hash(puzzle1)
#assert hash(puzzle0) == hash(puzzle2)
assert hash(puzzle0) != hash(puzzle3)
def testPrimitive():
puzzle = Peg.deserialize('1_11_010_1111_01101_')
assert puzzle.primitive() == PuzzleValue.UNDECIDED
puzzle = Peg.deserialize('0_00_000_1000_00000_')
assert puzzle.primitive() == PuzzleValue.SOLVABLE
puzzle = Peg.deserialize('0_00_000_0000_00010_')
assert puzzle.primitive() == PuzzleValue.SOLVABLE
puzzle = Peg.deserialize('0_10_000_0000_00010_')
assert puzzle.primitive() == PuzzleValue.UNDECIDED
def testSerialization():
codes = [
'1_11_010_1111_01101_', '1_11_110_0000_01101_', '0_00_010_0000_00000_',
'1_11_110_0011_00011_', '0_11_111_1111_00001_'
]
for code in codes:
puzzle = Peg.deserialize(code)
assert puzzle.serialize() == code
def testMoves():
puzzle0 = Peg.deserialize('0_11_111_1111_11111_')
puzzle1 = puzzle0.doMove('[D]->[A]')
assert puzzle1.serialize() == '1_01_011_1111_11111_'
puzzle2 = puzzle1.doMove('[F]->[D]')
assert puzzle2.serialize() == '1_01_100_1111_11111_'
puzzle3 = puzzle2.doMove('[G]->[B]')
assert puzzle3.serialize() == '1_11_000_0111_11111_'
with pytest.raises(Exception):
puzzle1.doMove('[B]->[C]')
with pytest.raises(Exception):
puzzle0.doMove('[A]->[B]')
with pytest.raises(Exception):
puzzle0.doMove('[G]->[A]')
assert len(puzzle0.generateMoves(movetype='for')) == 2
assert len(puzzle1.generateMoves(movetype='for')) == 4
assert len(puzzle2.generateMoves(movetype='for')) == 6
assert len(puzzle3.generateMoves(movetype='for')) == 8
def testPositions():
puzzle0 = Peg.generateStartPosition('Triangle')
assert puzzle0.serialize() == '0_11_111_1111_11111_'
puzzles = puzzle0.generateSolutions()
assert len(puzzles) == 15