|
| 1 | +import unittest |
| 2 | +from typing import List, Tuple, Set |
| 3 | +from domino_game_analyzer import DominoTile, PlayerPosition |
| 4 | +from domino_probability_calc import generate_sample, PlayerTiles |
| 5 | + |
| 6 | +class TestGenerateSample(unittest.TestCase): |
| 7 | + def setUp(self): |
| 8 | + self.remaining_tiles = [ |
| 9 | + DominoTile(0, 1), DominoTile(0, 2), DominoTile(1, 2), |
| 10 | + DominoTile(1, 3), DominoTile(2, 3), DominoTile(3, 3) |
| 11 | + ] |
| 12 | + |
| 13 | + def test_basic_functionality(self): |
| 14 | + not_with = {'N': set(), 'E': set(), 'W': set()} |
| 15 | + # known_with = {} |
| 16 | + player_tiles = PlayerTiles(N=2, E=2, W=2) |
| 17 | + |
| 18 | + sample = generate_sample(self.remaining_tiles, not_with, player_tiles) |
| 19 | + # sample = generate_sample(self.remaining_tiles, not_with, known_with, player_tiles) |
| 20 | + |
| 21 | + self.assertEqual(len(sample), 3) # Should have 3 players |
| 22 | + self.assertEqual(sum(len(tiles) for tiles in sample.values()), 6) # Total tiles should be 6 |
| 23 | + self.assertEqual(len(sample['N']), 2) |
| 24 | + self.assertEqual(len(sample['E']), 2) |
| 25 | + self.assertEqual(len(sample['W']), 2) |
| 26 | + |
| 27 | + def test_not_with_constraint(self): |
| 28 | + not_with = {'N': {DominoTile(0, 1), DominoTile(0, 2)}, 'E': set(), 'W': set()} |
| 29 | + known_with = {} |
| 30 | + player_tiles = PlayerTiles(N=2, E=2, W=2) |
| 31 | + |
| 32 | + for _ in range(25): |
| 33 | + sample = generate_sample(self.remaining_tiles, not_with, player_tiles) |
| 34 | + # sample = generate_sample(self.remaining_tiles, not_with, known_with, player_tiles) |
| 35 | + |
| 36 | + self.assertNotIn(DominoTile(0, 1), sample['N']) |
| 37 | + self.assertNotIn(DominoTile(0, 2), sample['N']) |
| 38 | + |
| 39 | + # def test_known_with_constraint(self): |
| 40 | + # not_with = {} |
| 41 | + # # known_with = {'E': {DominoTile(1, 2), DominoTile(2, 3)}} |
| 42 | + # player_tiles = PlayerTiles(N=2, E=2, W=2) |
| 43 | + |
| 44 | + # for _ in range(25): |
| 45 | + # sample = generate_sample(self.remaining_tiles, not_with, player_tiles) |
| 46 | + # # sample = generate_sample(self.remaining_tiles, not_with, known_with, player_tiles) |
| 47 | + |
| 48 | + # self.assertIn(DominoTile(1, 2), sample['E']) |
| 49 | + # self.assertIn(DominoTile(2, 3), sample['E']) |
| 50 | + |
| 51 | + def test_uneven_distribution(self): |
| 52 | + not_with = {'N': set(), 'E': set(), 'W': set()} |
| 53 | + # known_with = {} |
| 54 | + player_tiles = PlayerTiles(N=3, E=2, W=1) |
| 55 | + |
| 56 | + for _ in range(25): |
| 57 | + sample = generate_sample(self.remaining_tiles, not_with, player_tiles) |
| 58 | + # sample = generate_sample(self.remaining_tiles, not_with, known_with, player_tiles) |
| 59 | + |
| 60 | + self.assertEqual(len(sample['N']), 3) |
| 61 | + self.assertEqual(len(sample['E']), 2) |
| 62 | + self.assertEqual(len(sample['W']), 1) |
| 63 | + |
| 64 | + def test_all_tiles_assigned(self): |
| 65 | + not_with = {'N': set(), 'E': set(), 'W': set()} |
| 66 | + # known_with = {} |
| 67 | + player_tiles = PlayerTiles(N=2, E=2, W=2) |
| 68 | + |
| 69 | + for _ in range(25): |
| 70 | + sample = generate_sample(self.remaining_tiles, not_with, player_tiles) |
| 71 | + # sample = generate_sample(self.remaining_tiles, not_with, known_with, player_tiles) |
| 72 | + |
| 73 | + all_assigned_tiles = set().union(*sample.values()) |
| 74 | + self.assertEqual(set(self.remaining_tiles), all_assigned_tiles) |
| 75 | + |
| 76 | + def test_no_duplicate_assignments(self): |
| 77 | + not_with = {'N': set(), 'E': set(), 'W': set()} |
| 78 | + # known_with = {} |
| 79 | + player_tiles = PlayerTiles(N=2, E=2, W=2) |
| 80 | + |
| 81 | + for _ in range(25): |
| 82 | + sample = generate_sample(self.remaining_tiles, not_with, player_tiles) |
| 83 | + # sample = generate_sample(self.remaining_tiles, not_with, known_with, player_tiles) |
| 84 | + |
| 85 | + all_assigned_tiles = list(sample['N']) + list(sample['E']) + list(sample['W']) |
| 86 | + self.assertEqual(len(all_assigned_tiles), len(set(all_assigned_tiles))) |
| 87 | + |
| 88 | + def test_conflicting_constraints(self): |
| 89 | + not_with = {'N': {DominoTile(0, 1), DominoTile(0, 2)}, 'E': {DominoTile(0, 1)}, 'W': {DominoTile(0, 1)}} |
| 90 | + # known_with = {'N': {DominoTile(0, 1)}} |
| 91 | + player_tiles = PlayerTiles(N=2, E=2, W=2) |
| 92 | + |
| 93 | + with self.assertRaises(AssertionError) as context: |
| 94 | + for _ in range(25): |
| 95 | + generate_sample(self.remaining_tiles, not_with, player_tiles) |
| 96 | + # generate_sample(self.remaining_tiles, not_with, known_with, player_tiles) |
| 97 | + self.assertEqual(str(context.exception), "Tile in remaining_tiles and not with any player!") |
| 98 | + |
| 99 | + def test_double_not_with_constraint(self): |
| 100 | + not_with = {'N': {DominoTile(0, 1), DominoTile(0, 2)}, 'E':{DominoTile(0,1),DominoTile(1,2)}, 'W': set()} |
| 101 | + # known_with = {} |
| 102 | + player_tiles = PlayerTiles(N=2, E=2, W=2) |
| 103 | + |
| 104 | + # with self.assertRaises(AssertionError): |
| 105 | + for _ in range(25): |
| 106 | + sample = generate_sample(self.remaining_tiles, not_with, player_tiles) |
| 107 | + # sample = generate_sample(self.remaining_tiles, not_with, known_with, player_tiles) |
| 108 | + self.assertIn(DominoTile(0, 1), sample['W']) |
| 109 | + self.assertNotIn(DominoTile(0, 1), sample['N']) |
| 110 | + self.assertNotIn(DominoTile(0, 1), sample['E']) |
| 111 | + self.assertNotIn(DominoTile(0, 2), sample['N']) |
| 112 | + self.assertNotIn(DominoTile(1, 2), sample['E']) |
| 113 | + |
| 114 | + |
| 115 | + def test_double_not_with_constraint2(self): |
| 116 | + remaining_tiles = set([ |
| 117 | + DominoTile(0, 0), DominoTile(0, 1), DominoTile(0, 2), DominoTile(0, 6), |
| 118 | + DominoTile(1, 3), DominoTile(1, 4), DominoTile(1, 5), DominoTile(1, 6), |
| 119 | + DominoTile(2, 2), DominoTile(2, 3), DominoTile(2, 6), DominoTile(3, 3), |
| 120 | + DominoTile(5, 6) |
| 121 | + # DominoTile(2, 4), DominoTile(3, 6) # Tiles in human player's hand |
| 122 | + ]) |
| 123 | + |
| 124 | + # Define not_with based on _knowledge_tracker |
| 125 | + not_with = { |
| 126 | + 'E': set(), |
| 127 | + 'N': {DominoTile(5, 6), DominoTile(1, 4)}, |
| 128 | + 'W': {DominoTile(1, 4)} |
| 129 | + } |
| 130 | + |
| 131 | + # Define player_tiles (assuming 7 tiles per player at the start) |
| 132 | + player_tiles = PlayerTiles(N=1, E=1, W=1) |
| 133 | + |
| 134 | + player_tiles = PlayerTiles(N=4, E=4, W=5) |
| 135 | + # with self.assertRaises(AssertionError): |
| 136 | + for _ in range(25): |
| 137 | + sample = generate_sample(remaining_tiles, not_with, player_tiles) |
| 138 | + # sample = generate_sample(self.remaining_tiles, not_with, known_with, player_tiles) |
| 139 | + self.assertIn(DominoTile(1, 4), sample['E']) |
| 140 | + self.assertNotIn(DominoTile(1, 4), sample['N']) |
| 141 | + self.assertNotIn(DominoTile(1, 4), sample['W']) |
| 142 | + self.assertNotIn(DominoTile(5, 6), sample['N']) |
| 143 | + |
| 144 | + |
| 145 | + def test_invalid_player_tiles(self): |
| 146 | + not_with = {'N': set(), 'E': set(), 'W': set()} |
| 147 | + known_with = {} |
| 148 | + player_tiles = PlayerTiles(N=3, E=2, W=2) # Total is 7, but we only have 6 tiles |
| 149 | + |
| 150 | + with self.assertRaises(AssertionError): |
| 151 | + generate_sample(self.remaining_tiles, not_with, player_tiles) |
| 152 | + # generate_sample(self.remaining_tiles, not_with, known_with, player_tiles) |
| 153 | + |
| 154 | +if __name__ == '__main__': |
| 155 | + unittest.main() |
0 commit comments