graph-games-proto 0.3.1732__py3-none-any.whl → 0.3.1734__py3-none-any.whl

graph_games_proto/fns.py

@@ -2155,7 +2155,7 @@ class BonusStatus(PClass):
 
 class State(PClass):
     uuid2edge = field(type=dict)  # Dict[str, BiEdge]
-    idx2path = field(type=dict)  # Dict[str, Path2]
+    idx2path = field(type=list)  # List[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()},
-            "idx2path": {k: v.__todict__() for k, v in self.idx2path.items()},
+            "idx2path": [v.__todict__() for v in self.idx2path],
             "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()},
-            idx2path={k: Path2.__fromdict__(v) for k, v in d["idx2path"].items()},
+            idx2path=[Path2.__fromdict__(v) for v in d["idx2path"]],
             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 = {}
-    idx2path = {}
+    idx2path = []
     uuid2segment = {}
     
     for edge in edges:
         uuid2edge[edge.uuid] = edge
         for path in edge.paths:
-            idx2path[path.idx] = path
+            idx2path.append(path)
             for segment in path.segments:
                 uuid2segment[segment.uuid] = segment
 
@@ -3880,14 +3880,14 @@ def append_default_legal_actions_for_next_player(game, action, log=False):
 
 
 def get_total_path_count(game):
-    return len(game.idx2path.values())
+    return len(game.idx2path)
 
 
 def get_legal_actions_for_path(game, player_idx, path_idx):
     # print("****************************** get_legal_actions_for_path 1", path_idx)
-    if path_idx not in game.idx2path.keys():
+    if path_idx < 0 or get_total_path_count(game) <= path_idx:
         return []
-    # print("****************************** get_legal_actions_for_path 2", path_idx)
+    print("****************************** get_legal_actions_for_path 2", path_idx)
 
     if not is_path_open_to_player(game, path_idx, player_idx):
         return []
@@ -3905,7 +3905,7 @@ def get_legal_actions_for_path(game, player_idx, path_idx):
                 allotted_since_action_idx=(len(game.history) - 1),
                 btn_text="Claim path",
                 move_pieces_to_path=LegalActionMovePiecesToPath(
-                    path_idx=path_idx,
+                    path_idx=int(path_idx),
                     default=default
                 )
             )
@@ -3917,7 +3917,7 @@ def get_legal_actions_for_path(game, player_idx, path_idx):
 def get_legal_actions_for_paths(game, player_idx):
     legal_actions = []
     
-    for path_idx in game.idx2path.keys():
+    for path_idx in range(get_total_path_count(game)):
         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)
@@ -3929,7 +3929,7 @@ def get_legal_actions_for_paths(game, player_idx):
 
 def is_path_open_to_player(game, path_idx, player_idx):
 
-    if not game or path_idx not in game.idx2path:
+    if not game or path_idx < 0 or get_total_path_count(game) <= path_idx:
         return False
     
     # Check if edge is too crowded for the number of players

{graph_games_proto-0.3.1732.dist-info → graph_games_proto-0.3.1734.dist-info}/METADATA

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

{graph_games_proto-0.3.1732.dist-info → graph_games_proto-0.3.1734.dist-info}/RECORD

@@ -1,9 +1,9 @@
 graph_games_proto/__init__.py,sha256=sI31dBPkrs_UHYsuc1Q2sdYkJfpVPKpB--FuqghA208,864
 graph_games_proto/all_types.py,sha256=IpbwftEcHS5Ewz-saFNk0lO9FvcbuHG36odRTayCXUk,54911
-graph_games_proto/fns.py,sha256=Ur9B2VAmCvbkjK5h7uG2FGI0fhuq-Uie6XSIvq5y5ic,264235
+graph_games_proto/fns.py,sha256=k6zmeQgeN6gQo2C2x7BM0GtT_T4TCY7nS62lcNDExKg,264248
 graph_games_proto/main.py,sha256=fj2U7KcwrpZtuUhjOX5yVxY18LZvvsxDFYZ_S5mxe04,145
 graph_games_proto/state.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-graph_games_proto-0.3.1732.dist-info/METADATA,sha256=6Pgt0b7Z3G-xgLUCoxrsgW9SQp-yKuLPFIvyH6i1bRw,188
-graph_games_proto-0.3.1732.dist-info/WHEEL,sha256=CmyFI0kx5cdEMTLiONQRbGQwjIoR1aIYB7eCAQ4KPJ0,91
-graph_games_proto-0.3.1732.dist-info/top_level.txt,sha256=-4QSrBMf_MM4BGsr2QXBpqDx8c8k_OPnzGyFjqjakes,18
-graph_games_proto-0.3.1732.dist-info/RECORD,,
+graph_games_proto-0.3.1734.dist-info/METADATA,sha256=mAgaz24fZzDM8nprclZ6IMK6Rds56iDl_r9iDz6TUII,188
+graph_games_proto-0.3.1734.dist-info/WHEEL,sha256=CmyFI0kx5cdEMTLiONQRbGQwjIoR1aIYB7eCAQ4KPJ0,91
+graph_games_proto-0.3.1734.dist-info/top_level.txt,sha256=-4QSrBMf_MM4BGsr2QXBpqDx8c8k_OPnzGyFjqjakes,18
+graph_games_proto-0.3.1734.dist-info/RECORD,,