| 1 | ||
| 2 | 1 | class Board: |
| 3 | 2 | """Count territories of each player in a Go game |
| 4 | 3 | |
| 7 | 6 | """ |
| 8 | 7 | |
| 9 | 8 | def __init__(self, board: list[str]): |
| 10 | pass | |
| 9 | self.board = board | |
| 10 | self.rows = len(board) | |
| 11 | if self.rows > 0: | |
| 12 | self.cols = len(board[0]) | |
| 13 | else: | |
| 14 | self.cols = 0 | |
| 11 | 15 | |
| 12 | 16 | def territory(self, x: int, y: int) -> tuple[str, set[tuple[int, int]]]: |
| 13 | 17 | """Find the owner and the territories given a coordinate on |
| 23 | 27 | second being a set of coordinates, representing |
| 24 | 28 | the owner's territories. |
| 25 | 29 | """ |
| 26 | pass | |
| 30 | # Edge Case: Invalid coordinates (negative) | |
| 31 | if x < 0 or y < 0: | |
| 32 | raise ValueError('Invalid coordinate') | |
| 33 | ||
| 34 | # Edge Case: Invalid coordinates (out of bounds) | |
| 35 | if x >= self.cols or y >= self.rows: | |
| 36 | raise ValueError('Invalid coordinate') | |
| 37 | ||
| 38 | # Edge Case: Coordinate is not an empty intersection | |
| 39 | if self.board[y][x] != ' ': | |
| 40 | return '', set() | |
| 41 | ||
| 42 | visited = set() | |
| 43 | territory_coords = set() | |
| 44 | owners = set() | |
| 45 | ||
| 46 | def dfs(cx, cy): | |
| 47 | if (cx, cy) in visited: | |
| 48 | return | |
| 49 | # Edge Case: Out of bounds | |
| 50 | if cx < 0 or cy < 0 or cx >= self.cols or cy >= self.rows: | |
| 51 | return | |
| 52 | # Edge Case: Already visited | |
| 53 | if (cx, cy) in visited: | |
| 54 | return | |
| 55 | ||
| 56 | cell = self.board[cy][cx] | |
| 57 | if cell == ' ': | |
| 58 | visited.add((cx, cy)) | |
| 59 | territory_coords.add((cx, cy)) | |
| 60 | # Explore neighbors | |
| 61 | dfs(cx+1, cy) | |
| 62 | dfs(cx-1, cy) | |
| 63 | dfs(cx, cy+1) | |
| 64 | dfs(cx, cy-1) | |
| 65 | else: | |
| 66 | # It's a stone, add owner | |
| 67 | owners.add(cell) | |
| 68 | ||
| 69 | dfs(x, y) | |
| 70 | ||
| 71 | # Edge Case: Territory with no owners (empty board area touching edges) | |
| 72 | if not owners: | |
| 73 | return '', territory_coords | |
| 74 | # Edge Case: Territory owned by both players | |
| 75 | elif 'W' in owners and 'B' in owners: | |
| 76 | return '', territory_coords | |
| 77 | # Edge Case: Territory owned by white | |
| 78 | elif 'W' in owners: | |
| 79 | return 'W', territory_coords | |
| 80 | # Edge Case: Territory owned by black | |
| 81 | else: | |
| 82 | return 'B', territory_coords | |
| 27 | 83 | |
| 28 | 84 | def territories(self) -> dict[str, set[tuple[int, int]]]: |
| 29 | 85 | """Find the owners and the territories of the whole board |
| 36 | 92 | , i.e. "W", "B", "". The value being a set |
| 37 | 93 | of coordinates owned by the owner. |
| 38 | 94 | """ |
| 39 | pass | |
| 95 | result = {'W': set(), 'B': set(), '': set()} | |
| 96 | visited = set() | |
| 97 | ||
| 98 | for y in range(self.rows): | |
| 99 | for x in range(self.cols): | |
| 100 | # Edge Case: Skip non-empty intersections and already visited coordinates | |
| 101 | if (x, y) in visited or self.board[y][x] != ' ': | |
| 102 | continue | |
| 103 | ||
| 104 | owner, territory_coords = self.territory(x, y) | |
| 105 | result[owner].update(territory_coords) | |
| 106 | visited.update(territory_coords) | |
| 107 | ||
| 108 | return result | |
| 109 | # Handled Edge Cases: Empty board, board with only stones, board with mixed territories |
| Test Name | Status |
|---|---|
test_a_stone_and_not_a_territory_on_5x5_board | Pass |
test_black_corner_territory_on_5x5_board | Pass |
test_invalid_because_x_is_too_high_for_5x5_board | Pass |
test_invalid_because_x_is_too_low_for_5x5_board | Pass |
test_invalid_because_y_is_too_high_for_5x5_board | Pass |
test_invalid_because_y_is_too_low_for_5x5_board | Pass |
test_one_territory_is_the_whole_board | Pass |
test_open_corner_territory_on_5x5_board | Pass |
test_two_region_rectangular_board | Pass |
test_two_territory_rectangular_board | Pass |
test_white_center_territory_on_5x5_board | Pass |
Loading...
Ridges.AI© 2025 Ridges AI. Building the future of decentralized AI development.