graph-games-proto 0.3.1709__py3-none-any.whl → 0.3.1710__py3-none-any.whl

graph_games_proto/fns.py

@@ -1514,34 +1514,34 @@ class ActionMovePiecesToPathOptional(PClass):
     
 
 class PublicLegalActionMovePiecesToPath(PClass):
-    path_uuid = field(type=str)
+    path_idx = field(type=str)
     def __todict__(self):
         return {
-            "path_uuid": self.path_uuid,
+            "path_idx": self.path_idx,
         }
     @staticmethod
     def __fromdict__(d):
         return PublicLegalActionMovePiecesToPath(
-            path_uuid=d["path_uuid"]
+            path_idx=d["path_idx"]
         )
 
 
 class LegalActionMovePiecesToPath(PClass):
-    path_uuid = field(type=str)
+    path_idx = field(type=str)
     default = field(type=ActionMovePiecesToPathOptional)  # Optional[MovePiecesToPathAction]
     def get_public(self, state):
         return PublicLegalActionMovePiecesToPath(
-            path_uuid=self.path_uuid,
+            path_idx=self.path_idx,
         )
     def __todict__(self):
         return {
-            "path_uuid": self.path_uuid,
+            "path_idx": self.path_idx,
             "default": self.default.__todict__(),
         }
     @staticmethod
     def __fromdict__(d):
         return LegalActionMovePiecesToPath(
-            path_uuid=d["path_uuid"],
+            path_idx=d["path_idx"],
             default=ActionMovePiecesToPathOptional.__fromdict__(d["default"])
         )
     @staticmethod
@@ -2155,7 +2155,7 @@ class BonusStatus(PClass):
 
 class State(PClass):
     uuid2edge = field(type=dict)  # Dict[str, BiEdge]
-    uuid2path = field(type=dict)  # Dict[str, Path2]
+    idx2path = field(type=dict)  # Dict[str, Path2]
     uuid2segment = field(type=dict)  # Dict[str, Segment]
     pieceuuid2piece = field(type=dict)  # Dict[str, Piece]
     carduuid2card = field(type=dict)  # Dict[str, Card]
@@ -2199,7 +2199,7 @@ class State(PClass):
     def __todict__(self):
         return {
             "uuid2edge": {k: v.__todict__() for k, v in self.uuid2edge.items()},
-            "uuid2path": {k: v.__todict__() for k, v in self.uuid2path.items()},
+            "idx2path": {k: v.__todict__() for k, v in self.idx2path.items()},
             "uuid2segment": {k: v.__todict__() for k, v in self.uuid2segment.items()},
             "pieceuuid2piece": {k: v.__todict__() for k, v in self.pieceuuid2piece.items()},
             "carduuid2card": {k: v.__todict__() for k, v in self.carduuid2card.items()},
@@ -2244,7 +2244,7 @@ class State(PClass):
     def __fromdict__(d):
         return State(
             uuid2edge={k: BiEdge.__fromdict__(v) for k, v in d["uuid2edge"].items()},
-            uuid2path={k: Path2.__fromdict__(v) for k, v in d["uuid2path"].items()},
+            idx2path={k: Path2.__fromdict__(v) for k, v in d["idx2path"].items()},
             uuid2segment={k: Segment2.__fromdict__(v) for k, v in d["uuid2segment"].items()},
             pieceuuid2piece={k: Piece.__fromdict__(v) for k, v in d["pieceuuid2piece"].items()},
             carduuid2card={k: Card.__fromdict__(v) for k, v in d["carduuid2card"].items()},
@@ -2874,13 +2874,13 @@ def getinitialstate(game_config):
 
 
     uuid2edge = {}
-    uuid2path = {}
+    idx2path = {}
     uuid2segment = {}
     
     for edge in edges:
         uuid2edge[edge.uuid] = edge
         for path in edge.paths:
-            uuid2path[path.uuid] = path
+            idx2path[path.uuid] = path
             for segment in path.segments:
                 uuid2segment[segment.uuid] = segment
 
@@ -2904,7 +2904,7 @@ def getinitialstate(game_config):
 
     state = State(
         uuid2edge=uuid2edge,
-        uuid2path=uuid2path,
+        idx2path=idx2path,
         uuid2segment=uuid2segment,
         pieceuuid2piece=pieceuuid2piece,
         carduuid2card=carduuid2card,
@@ -3161,20 +3161,6 @@ def default_after_accept_action(game, action):
     )
 
 
-def get_path_by_idx(game, path_idx):
-    if not game or path_idx < 0 or path_idx >= len(game.game_config.fig.board_config.board_paths):
-        return None
-    
-    for edge in game.edges:
-        if len(edge.paths) == 0:
-            raise ValueError(f"Edge {edge.uuid} has no paths")
-        for path in edge.paths:
-            if path.idx == path_idx:
-                return path
-    
-    return None
-
-
 def handle_draw_action(game, action):
     if not game or not action or not action.legal_action or not action.legal_action.draw:
         return game
@@ -3504,8 +3490,8 @@ def handle_move_pieces_to_path_action(game, action):
     if not player or not player.pieces:
         return game
 
-    path_uuid = move_pieces_to_path.path_uuid
-    path = game.uuid2path[path_uuid]
+    path_idx = move_pieces_to_path.path_idx
+    path = game.idx2path[path_idx]
 
     if path is None or not path.segments:
         return game
@@ -3528,7 +3514,7 @@ def handle_move_pieces_to_path_action(game, action):
             game.decks[game.carduuid2card[card_uuid].deck_idx].discard.append(card_uuid)
 
     game = game.set(players=game.players)
-    game = game.set(uuid2path=game.uuid2path)
+    game = game.set(idx2path=game.idx2path)
     game = game.set(player_graphs=calc_player_graphs(game)) #
 
     return game
@@ -3794,8 +3780,8 @@ def is_move_pieces_to_path_action_legal(game, action):
     # print("******************************1234 is_move_pieces_to_path_action_legal 1")
     player_idx = action.legal_action.player_idx
     proposed_cards_uuids = action.move_pieces_to_path.card_uuids
-    path_uuid = action.legal_action.move_pieces_to_path.path_uuid
-    path = game.uuid2path[path_uuid]
+    path_idx = action.legal_action.move_pieces_to_path.path_idx
+    path = game.idx2path[path_idx]
     proposed_cards = [card_uuid for card_uuid in game.players[player_idx].cards if card_uuid in proposed_cards_uuids]
     proposed_pieces = [piece_uuid for piece_uuid in game.players[player_idx].pieces if piece_uuid in action.move_pieces_to_path.piece_uuids]
     remaining_segments = path.segments
@@ -3894,18 +3880,18 @@ def append_default_legal_actions_for_next_player(game, action, log=False):
 
 
 def get_total_path_count(game):
-    return len(game.uuid2path.values())
+    return len(game.idx2path.values())
 
 
-def get_legal_actions_for_path(game, player_idx, path_uuid):
-    if path_uuid not in game.uuid2path:
+def get_legal_actions_for_path(game, player_idx, path_idx):
+    if path_idx not in game.idx2path:
         return []
 
-    if not is_path_open_to_player(game, path_uuid, player_idx):
+    if not is_path_open_to_player(game, path_idx, player_idx):
         return []
 
     legal_actions = []
-    default = get_sample_actionclaimpath(game, player_idx, path_uuid)
+    default = get_sample_actionclaimpath(game, player_idx, path_idx)
     if default:
         legal_actions.append(
             LegalAction(
@@ -3917,7 +3903,7 @@ def get_legal_actions_for_path(game, player_idx, path_uuid):
                 allotted_since_action_idx=(len(game.history) - 1),
                 btn_text="Claim path",
                 move_pieces_to_path=LegalActionMovePiecesToPath(
-                    path_uuid=path_uuid,
+                    path_idx=path_idx,
                     default=default
                 )
             )
@@ -3929,8 +3915,8 @@ def get_legal_actions_for_path(game, player_idx, path_uuid):
 def get_legal_actions_for_paths(game, player_idx):
     legal_actions = []
     
-    for path_uuid in game.uuid2path.keys():
-        legal_actions_for_path = get_legal_actions_for_path(game, player_idx, path_uuid)
+    for path_idx in game.idx2path.keys():
+        legal_actions_for_path = get_legal_actions_for_path(game, player_idx, path_idx)
         if legal_actions_for_path:
             legal_actions.extend(legal_actions_for_path)
         # else:
@@ -3939,16 +3925,16 @@ def get_legal_actions_for_paths(game, player_idx):
     return legal_actions
 
 
-def is_path_open_to_player(game, path_uuid, player_idx):
+def is_path_open_to_player(game, path_idx, player_idx):
 
-    if not game or path_uuid not in game.uuid2path:
+    if not game or path_idx not in game.idx2path:
         return False
     
     # Check if edge is too crowded for the number of players
     
     
     # Check if any segment of the path has pieces from any player
-    path = game.uuid2path[path_uuid]
+    path = game.idx2path[path_idx]
     if path.segments[0].pieces:
         return False
 
@@ -4118,8 +4104,8 @@ def does_fulfill_path(game, player_idx, path_idx, fulfillment):
     return False
 
 
-def get_sample_actionclaimpath(game, player_idx, path_uuid):
-    card_fulfillment, piece_fulfillment = get_sample_path_fulfillment(game, player_idx, path_uuid)
+def get_sample_actionclaimpath(game, player_idx, path_idx):
+    card_fulfillment, piece_fulfillment = get_sample_path_fulfillment(game, player_idx, path_idx)
     if not card_fulfillment or not piece_fulfillment:
         return None
 
@@ -4129,8 +4115,8 @@ def get_sample_actionclaimpath(game, player_idx, path_uuid):
     )
 
 
-def get_sample_path_fulfillment(game, player_idx, path_uuid):
-    path = game.uuid2path[path_uuid]
+def get_sample_path_fulfillment(game, player_idx, path_idx):
+    path = game.idx2path[path_idx]
     remaining_card_uuids = [card_uuid for card_uuid in game.players[player_idx].cards if game.carduuid2card[card_uuid].deck_idx == 0]
     remaining_pieces = [
         piece_uuid 

{graph_games_proto-0.3.1709.dist-info → graph_games_proto-0.3.1710.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: graph_games_proto
-Version: 0.3.1709
+Version: 0.3.1710
 Requires-Dist: multipledispatch==1.0.0
 Requires-Dist: pyrsistent==0.20.0
 Requires-Dist: numpy==2.2.4

{graph_games_proto-0.3.1709.dist-info → graph_games_proto-0.3.1710.dist-info}/RECORD

@@ -1,9 +1,9 @@
 graph_games_proto/__init__.py,sha256=LOpk1mGZxPWMRGrPNoXDENn7JPG6rNfhieehItW8bEA,881
 graph_games_proto/all_types.py,sha256=IpbwftEcHS5Ewz-saFNk0lO9FvcbuHG36odRTayCXUk,54911
-graph_games_proto/fns.py,sha256=C8KNhuDQLg2u_ws2HgQd0a8WdhiHIQRQ0wHL1hDxY48,264516
+graph_games_proto/fns.py,sha256=h1o-uA304yMKqLSgLgFSRrpWSkvmCLY8EbQwi1JO-7g,264059
 graph_games_proto/main.py,sha256=fj2U7KcwrpZtuUhjOX5yVxY18LZvvsxDFYZ_S5mxe04,145
 graph_games_proto/state.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-graph_games_proto-0.3.1709.dist-info/METADATA,sha256=ev79QNjtQd3Qtaqdx1nasU_MaiYPGxVtrO6Sp3dk8xA,188
-graph_games_proto-0.3.1709.dist-info/WHEEL,sha256=CmyFI0kx5cdEMTLiONQRbGQwjIoR1aIYB7eCAQ4KPJ0,91
-graph_games_proto-0.3.1709.dist-info/top_level.txt,sha256=-4QSrBMf_MM4BGsr2QXBpqDx8c8k_OPnzGyFjqjakes,18
-graph_games_proto-0.3.1709.dist-info/RECORD,,
+graph_games_proto-0.3.1710.dist-info/METADATA,sha256=AzBXd589rEtm5U23ya7vjrmlWGBU4rbZ8nKCHZEvnx8,188
+graph_games_proto-0.3.1710.dist-info/WHEEL,sha256=CmyFI0kx5cdEMTLiONQRbGQwjIoR1aIYB7eCAQ4KPJ0,91
+graph_games_proto-0.3.1710.dist-info/top_level.txt,sha256=-4QSrBMf_MM4BGsr2QXBpqDx8c8k_OPnzGyFjqjakes,18
+graph_games_proto-0.3.1710.dist-info/RECORD,,