gymcts 1.2.0__py3-none-any.whl → 1.3.0__py3-none-any.whl

gymcts/gymcts_node.py

@@ -2,7 +2,7 @@ import uuid
 import random
 import math
 
-from typing import TypeVar, Any, SupportsFloat, Callable, Generator
+from typing import TypeVar, Any, SupportsFloat, Callable, Generator, Literal
 
 from gymcts.gymcts_env_abc import GymctsABC
 
@@ -13,22 +13,55 @@ TGymctsNode = TypeVar("TGymctsNode", bound="GymctsNode")
 
 class GymctsNode:
     # static properties
-    best_action_weight: float = 0.05
-    ubc_c = 0.707
+    best_action_weight: float = 0.05 # weight for the best action
+    ubc_c = 0.707 # exploration coefficient
+
+    """
+    UCT (Upper Confidence Bound applied to Trees) exploration terms:
+
+    UCT 0:
+        c * √( 2 * ln(N(s)) / N(s,a) )
+
+    UCT 1:
+        c * √( ln(N(s)) / (1 + N(s,a)) )
+
+    UCT 2:
+        c * ( √(N(s)) / (1 + N(s,a)) )
+
+    Where:
+        N(s)     = number of times state s has been visited
+        N(s,a)   = number of times action a was taken from state s
+        c        = exploration constant
+    """
+    score_variate: Literal["UCT_v0", "UCT_v1", "UCT_v2",] = "UCT_v0"
+
+
 
     # attributes
-    visit_count: int = 0
-    mean_value: float = 0
-    max_value: float = -float("inf")
-    min_value: float = +float("inf")
-    terminal: bool = False
-    state: Any
+    #
+    # Note these attributes are not static. Their defined here to give developers a hint what fields are available
+    # in the class. They are not static because they are not shared between instances of the class in scope of
+    # this library.
+    visit_count: int = 0 # number of times the node has been visited
+    mean_value: float = 0 # mean value of the node
+    max_value: float = -float("inf") # maximum value of the node
+    min_value: float = +float("inf") # minimum value of the node
+    terminal: bool = False # whether the node is terminal or not
+    state: Any = None # state of the node
 
     def __str__(self, colored=False, action_space_n=None) -> str:
+        """
+        Returns a string representation of the node. The string representation is used for visualisation purposes.
+        It is used for example in the mcts tree visualisation functionality.
+
+        :param colored: true if the string representation should be colored, false otherwise. (ture is used by the mcts tree visualisation)
+        :param action_space_n: the number of actions in the action space. This is used for coloring the action in the string representation.
+        :return: a potentially colored string representation of the node.
+        """
         if not colored:
 
             if not self.is_root():
-                return f"(a={self.action}, N={self.visit_count}, Q_v={self.mean_value:.2f}, best={self.max_value:.2f}, ubc={self.ucb_score():.2f})"
+                return f"(a={self.action}, N={self.visit_count}, Q_v={self.mean_value:.2f}, best={self.max_value:.2f}, ubc={self.tree_policy_score():.2f})"
             else:
                 return f"(N={self.visit_count}, Q_v={self.mean_value:.2f}, best={self.max_value:.2f}) [root]"
 
@@ -69,25 +102,47 @@ class GymctsNode:
                  f"{p}N{e}={colorful_value(self.visit_count)}, "
                  f"{p}Q_v{e}={ccu.wrap_with_color_scale(s=mean_val, value=self.mean_value, min_val=root_node.min_value, max_val=root_node.max_value)}, "
                  f"{p}best{e}={colorful_value(self.max_value)}") +
-                (f", {p}ubc{e}={colorful_value(self.ucb_score())})" if not self.is_root() else ")"))
+                (f", {p}ubc{e}={colorful_value(self.tree_policy_score())})" if not self.is_root() else ")"))
 
     def traverse_nodes(self) -> Generator[TGymctsNode, None, None]:
+        """
+        Traverse the tree and yield all nodes in the tree.
+
+        :return: a generator that yields all nodes in the tree.
+        """
         yield self
         if self.children:
             for child in self.children.values():
                 yield from child.traverse_nodes()
 
     def get_root(self) -> TGymctsNode:
+        """
+        Returns the root node of the tree. The root node is the node that has no parent.
+
+        :return: the root node of the tree.
+        """
         if self.is_root():
             return self
         return self.parent.get_root()
 
     def max_tree_depth(self):
+        """
+        Returns the maximum depth of the tree. The depth of a node is the number of edges from
+        the node to the root node.
+
+        :return: the maximum depth of the tree.
+        """
         if self.is_leaf():
             return 0
         return 1 + max(child.max_tree_depth() for child in self.children.values())
 
     def n_children_recursively(self):
+        """
+        Returns the number of children of the node recursively. The number of children of a node is the number of
+        children of the node plus the number of children of all children of the node.
+
+        :return: the number of children of the node recursively.
+        """
         if self.is_leaf():
             return 0
         return len(self.children) + sum(child.n_children_recursively() for child in self.children.values())
@@ -97,6 +152,14 @@ class GymctsNode:
                  parent: TGymctsNode | None,
                  env_reference: GymctsABC,
                  ):
+        """
+        Initializes the node. The node is initialized with the state of the environment and the action that was taken to
+        reach the node. The node is also initialized with the parent node and the environment reference.
+
+        :param action: the action that was taken to reach the node. If the node is a root node, this parameter is None.
+        :param parent: the parent node of the node. If the node is a root node, this parameter is None.
+        :param env_reference: a reference to the environment. The environment is used to get the state of the node and the valid actions.
+        """
 
         # field depending on whether the node is a root node or not
         self.action: int | None
@@ -148,22 +211,56 @@ class GymctsNode:
         if self.parent:
             self.parent.reset()
 
+    def remove_parent(self) -> None:
+        self.parent = None
+
+        if self.parent is not None:
+            self.parent.remove_parent()
+
     def is_root(self) -> bool:
+        """
+        Returns true if the node is a root node. A root node is a node that has no parent.
+
+        :return: true if the node is a root node, false otherwise.
+        """
         return self.parent is None
 
     def is_leaf(self) -> bool:
+        """
+        Returns true if the node is a leaf node. A leaf node is a node that has no children. A leaf node is a node that has no children.
+
+        :return: true if the node is a leaf node, false otherwise.
+        """
         return self.children is None or len(self.children) == 0
 
     def get_random_child(self) -> TGymctsNode:
+        """
+        Returns a random child of the node. A random child is a child that is selected randomly from the list of children.
+        :return:
+        """
         if self.is_leaf():
             raise ValueError("cannot get random child of leaf node")  # todo: maybe return self instead?
 
         return list(self.children.values())[random.randint(0, len(self.children) - 1)]
 
     def get_best_action(self) -> int:
+        """
+        Returns the best action of the node. The best action is the action that has the highest score.
+        The score is calculated using the get_score() method. The best action is the action that has the highest score.
+        The best action is the action that has the highest score.
+
+        :return: the best action of the node.
+        """
         return max(self.children.values(), key=lambda child: child.get_score()).action
 
     def get_score(self) -> float:  # todo: make it an attribute?
+        """
+        Returns the score of the node. The score is calculated using the mean value and the maximum value of the node.
+        The score is calculated using the formula: score = (1 - a) * mean_value + a * max_value
+        where a is the best action weight.
+
+        :return: the score of the node.
+        """
         # return self.mean_value
         assert 0 <= GymctsNode.best_action_weight <= 1
         a = GymctsNode.best_action_weight
@@ -173,11 +270,46 @@ class GymctsNode:
         return self.mean_value
 
     def get_max_value(self) -> float:
+        """
+        Returns the maximum value of the node. The maximum value is the maximum value of the node.
+
+        :return: the maximum value of the node.
+        """
         return self.max_value
 
-    def ucb_score(self):
+    def tree_policy_score(self):
         """
+        TODO: update docstring
+
         The score for an action that would transition between the parent and child.
+        For vanilla MCTS, this is the UCB1 score.
+
+        The UCB1 score is calculated using the formula:
+
+        UCT (Upper Confidence Bound applied to Trees) exploration terms:
+
+        UCT_v0:
+            c * √( 2 * ln(N(s)) / N(s,a) )
+
+        UCT_v1:
+            c * √( ln(N(s)) / (1 + N(s,a)) )
+
+        UCT_v2:
+            c * ( √(N(s)) / (1 + N(s,a)) )
+
+        Where:
+            N(s)     = number of times state s has been visited
+            N(s,a)   = number of times action a was taken from state s
+            c        = exploration constant
+
+        where:
+        - mean_value is the mean value of the node
+        - c is a constant that controls the exploration-exploitation trade-off (GymctsNode.ubc_c)
+        - parent_visit_count is the number of times the parent node has been visited
+        - visit_count is the number of times the node has been visited
+
+        If the node has not been visited yet, the score is set to infinity.
+
         prior_score = child.prior * math.sqrt(parent.visit_count) / (child.visit_count + 1)
 
         if child.visit_count > 0:
@@ -192,8 +324,20 @@ class GymctsNode:
         """
         if self.is_root():
             raise ValueError("ucb_score can only be called on non-root nodes")
-        # c = 0.707 # todo: make it an attribute?
-        c = GymctsNode.ubc_c
-        if self.visit_count == 0:
-            return float("inf")
-        return self.mean_value + c * math.sqrt(math.log(self.parent.visit_count) / (self.visit_count))
+        c = GymctsNode.ubc_c # default is 0.707
+
+        if GymctsNode.score_variate == "UCT_v0":
+            if self.visit_count == 0:
+                return float("inf")
+            return self.mean_value + c * math.sqrt( 2 * math.log(self.parent.visit_count) / (self.visit_count))
+
+        if GymctsNode.score_variate == "UCT_v1":
+            return self.mean_value + c * math.sqrt( math.log(self.parent.visit_count) / (1 + self.visit_count))
+
+        if GymctsNode.score_variate == "UCT_v2":
+            return self.mean_value + c * math.sqrt(self.parent.visit_count) / (1 + self.visit_count)
+
+        raise ValueError(f"unknown score variate: {GymctsNode.score_variate}. ")
+
+
+

gymcts/gymcts_tree_plotter.py

@@ -1,3 +1,5 @@
+from typing import Any, Generator
+
 from gymcts.gymcts_node import GymctsNode
 
 from gymcts.logger import log
@@ -9,7 +11,19 @@ def _generate_mcts_tree(
         depth: int = None,
         exclude_unvisited_nodes_from_render: bool = True,
         action_space_n: int = None
-) -> list[str]:
+) -> Generator[str, Any | None, None]:
+    """
+    Generates a tree representation of the MCTS tree starting from the given node.
+
+    This is a recursive function that generates a tree representation of the MCTS tree starting from the given node. The
+
+    :param start_node: the node to start from
+    :param prefix: used to format the tree
+    :param depth: used to limit the depth of the tree
+    :param exclude_unvisited_nodes_from_render: used to exclude unvisited nodes from the render
+    :param action_space_n: the number of actions in the action space
+    :return: a list of strings representing the tree
+    """
     if prefix is None:
         prefix = ""
     import gymcts.colorful_console_utils as ccu
@@ -70,6 +84,13 @@ def show_mcts_tree(
         tree_max_depth: int = None,
         action_space_n: int = None
 ) -> None:
+    """
+    Renders the MCTS tree starting from the given node.
+
+    :param start_node: the node to start from
+    :param tree_max_depth: the maximum depth of the tree to render
+    :param action_space_n: the number of actions in the action space
+    """
     print(start_node.__str__(colored=True, action_space_n=action_space_n))
     for line in _generate_mcts_tree(start_node=start_node, depth=tree_max_depth):
         print(line)

gymcts/logger.py

@@ -18,10 +18,7 @@ banner_sw = f"""
      ▟█▛      ▜██▛ ▟█▛██▛██▛▟█▛     ▟█▛  ▜███▙ 
     ▟█▛ ▟█▛   ▟█▛ ▟█▛   ▟█▛▟█▛     ▟█▛      ▟█▛ 
     ▜████▛   ▟█▛ ▟█▛   ▟█▛ ▜████▛ ▟█▛  ▟████▛  
-    
-    
-    
-                                       
+                                           
 """
 
 

{gymcts-1.2.0.dist-info → gymcts-1.3.0.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: gymcts
-Version: 1.2.0
+Version: 1.3.0
 Summary: A minimalistic implementation of the Monte Carlo Tree Search algorithm for planning problems fomulated as gymnaisum reinforcement learning environments.
 Author: Alexander Nasuta
 Author-email: Alexander Nasuta <alexander.nasuta@wzl-iqs.rwth-aachen.de>
@@ -47,7 +47,7 @@ Requires-Dist: graph-matrix-jsp-env; extra == "examples"
 Requires-Dist: graph-jsp-env; extra == "examples"
 Provides-Extra: dev
 Requires-Dist: jsp-instance-utils; extra == "dev"
-Requires-Dist: graph-matrix-jsp-env; extra == "dev"
+Requires-Dist: graph-matrix-jsp-env>=0.3.0; extra == "dev"
 Requires-Dist: graph-jsp-env; extra == "dev"
 Requires-Dist: JSSEnv; extra == "dev"
 Requires-Dist: pip-tools; extra == "dev"
@@ -59,21 +59,31 @@ Requires-Dist: stable_baselines3; extra == "dev"
 Requires-Dist: sphinx; extra == "dev"
 Requires-Dist: myst-parser; extra == "dev"
 Requires-Dist: sphinx-autobuild; extra == "dev"
+Requires-Dist: sphinx-copybutton; extra == "dev"
 Requires-Dist: furo; extra == "dev"
 Requires-Dist: twine; extra == "dev"
 Requires-Dist: sphinx-copybutton; extra == "dev"
 Requires-Dist: nbsphinx; extra == "dev"
+Requires-Dist: pandoc; extra == "dev"
 Requires-Dist: jupytext; extra == "dev"
 Requires-Dist: jupyter; extra == "dev"
+Requires-Dist: typing_extensions>=4.12.0; extra == "dev"
 Dynamic: license-file
 
-# Graph Matrix Job Shop Env
+[![DOI](https://zenodo.org/badge/DOI/10.5281/zenodo.15283390.svg)](https://doi.org/10.5281/zenodo.15283390)
+[![Python Badge](https://img.shields.io/badge/Python-3776AB?logo=python&logoColor=fff&style=flat)](https://www.python.org/downloads/)
+[![PyPI version](https://img.shields.io/pypi/v/gymcts)](https://pypi.org/project/gymcts/)
+[![License](https://img.shields.io/pypi/l/gymcts)](https://github.com/Alexander-Nasuta/gymcts/blob/master/LICENSE)
+[![Documentation Status](https://readthedocs.org/projects/gymcts/badge/?version=latest)](https://gymcts.readthedocs.io/en/latest/?badge=latest)
+
+# GYMCTS
 
 A Monte Carlo Tree Search Implementation for Gymnasium-style Environments.
 
-- Github: [GYMCTS on Github](https://github.com/Alexander-Nasuta/GraphMatrixJobShopEnv)
-- Pypi: [GYMCTS on PyPi](https://pypi.org/project/graph-matrix-jsp-env/)
-- Documentation: [GYMCTS Docs](https://graphmatrixjobshopenv.readthedocs.io/en/latest/)
+- Github: [GYMCTS on Github](https://github.com/Alexander-Nasuta/gymcts)
+- GitLab: [GYMCTS on GitLab](https://git-ce.rwth-aachen.de/alexander.nasuta/gymcts)
+- Pypi: [GYMCTS on PyPi](https://pypi.org/project/gymcts/)
+- Documentation: [GYMCTS Docs](https://gymcts.readthedocs.io/en/latest/)
 
 ## Description
 
@@ -101,22 +111,26 @@ The usage of a MCTS agent can roughly organised into the following steps:
 - Render the solution
 
 The GYMCTS package provides a two types of wrappers for Gymnasium-style environments:
-- `NaiveSoloMCTSGymEnvWrapper`: A wrapper that uses deepcopies of the environment to save a snapshot of the environment state for each node in the MCTS tree.
-- `DeterministicSoloMCTSGymEnvWrapper`: A wrapper that saves the action sequence that lead to the current state in the MCTS node.
+- `DeepCopyMCTSGymEnvWrapper`: A wrapper that uses deepcopies of the environment to save a snapshot of the environment state for each node in the MCTS tree.
+- `ActionHistoryMCTSGymEnvWrapper`: A wrapper that saves the action sequence that lead to the current state in the MCTS node.
 
-These wrappers can be used with the `SoloMCTSAgent` to solve the environment. 
-The wrapper implement methods that are required by the `SoloMCTSAgent` to interact with the environment.
+These wrappers can be used with the `GymctsAgent` to solve the environment. 
+The wrapper implement methods that are required by the `GymctsAgent` to interact with the environment.
 GYMCTS is designed to use a single environment instance and reconstructing the environment state form a state snapshot, when needed.
 
 NOTE: MCTS works best when the return of an episode is in the range of [-1, 1]. Please adjust the reward function of the environment accordingly (or change the ubc-scaling parameter of the MCTS agent).
 Adjusting the reward function of the environment is easily done with a [NormalizeReward](https://gymnasium.farama.org/api/wrappers/reward_wrappers/#gymnasium.wrappers.NormalizeReward) or [TransformReward](https://gymnasium.farama.org/api/wrappers/reward_wrappers/#gymnasium.wrappers.TransformReward) Wrapper.
+```python
+env = NormalizeReward(env, gamma=0.99, epsilon=1e-8)
+```
 
-NormalizeReward(env, gamma=0.99, epsilon=1e-8)
-env = TransformReward(env, lambda r: r / 36)
-### FrozenLake Example (NaiveSoloMCTSGymEnvWrapper)
+```python
+env = TransformReward(env, lambda r: r / n_steps_per_episode)
+```
+### FrozenLake Example (DeepCopyMCTSGymEnvWrapper)
 
 A minimal example of how to use the package with the FrozenLake environment and the NaiveSoloMCTSGymEnvWrapper is provided in the following code snippet below.
-The NaiveSoloMCTSGymEnvWrapper can be used with non-deterministic environments, such as the FrozenLake environment with slippery ice.
+The DeepCopyMCTSGymEnvWrapper can be used with non-deterministic environments, such as the FrozenLake environment with slippery ice.
 
 ```python
 import gymnasium as gym
@@ -135,7 +149,7 @@ if __name__ == '__main__':
     env = gym.make('FrozenLake-v1', desc=None, map_name="4x4", is_slippery=True, render_mode="ansi")
     env.reset()
 
-    # 1. wrap the environment with the naive wrapper or a custom gymcts wrapper
+    # 1. wrap the environment with the deep copy wrapper or a custom gymcts wrapper
     env = DeepCopyMCTSGymEnvWrapper(env)
 
     # 2. create the agent
@@ -158,7 +172,7 @@ if __name__ == '__main__':
 
     # 5. print the solution
     # read the solution from the info provided by the RecordEpisodeStatistics wrapper 
-    # (that NaiveSoloMCTSGymEnvWrapper uses internally)
+    # (that DeepCopyMCTSGymEnvWrapper uses internally)
     episode_length = info["episode"]["l"]
     episode_return = info["episode"]["r"]
 
@@ -251,7 +265,7 @@ if __name__ == '__main__':
     env = gym.make('FrozenLake-v1', desc=None, map_name="4x4", is_slippery=False, render_mode="rgb_array")
     env.reset()
 
-    # 1. wrap the environment with the naive wrapper or a custom gymcts wrapper
+    # 1. wrap the environment with the deep copy wrapper or a custom gymcts wrapper
     env = DeepCopyMCTSGymEnvWrapper(env)
 
     # 2. create the agent
@@ -280,7 +294,7 @@ if __name__ == '__main__':
     env.close()
 
     # 5. print the solution
-    # read the solution from the info provided by the RecordEpisodeStatistics wrapper (that NaiveSoloMCTSGymEnvWrapper wraps internally)
+    # read the solution from the info provided by the RecordEpisodeStatistics wrapper (that DeepCopyMCTSGymEnvWrapper wraps internally)
     episode_length = info["episode"]["l"]
     episode_return = info["episode"]["r"]
 
@@ -321,13 +335,13 @@ import gymnasium as gym
 from graph_jsp_env.disjunctive_graph_jsp_env import DisjunctiveGraphJspEnv
 from jsp_instance_utils.instances import ft06, ft06_makespan
 
-from gymcts.gymcts_agent import SoloMCTSAgent
-from gymcts.gymcts_gym_env import SoloMCTSGymEnv
+from gymcts.gymcts_agent import GymctsAgent
+from gymcts.gymcts_env_abc import GymctsABC
 
 from gymcts.logger import log
 
 
-class GraphJspGYMCTSWrapper(SoloMCTSGymEnv, gym.Wrapper):
+class GraphJspGYMCTSWrapper(GymctsABC, gym.Wrapper):
 
     def __init__(self, env: DisjunctiveGraphJspEnv):
         gym.Wrapper.__init__(self, env)
@@ -378,7 +392,7 @@ if __name__ == '__main__':
 
     env = GraphJspGYMCTSWrapper(env)
 
-    agent = SoloMCTSAgent(
+    agent = GymctsAgent(
         env=env,
         clear_mcts_tree_after_step=True,
         render_tree_after_step=True,
@@ -421,7 +435,6 @@ import gymnasium as gym
 
 from gymcts.gymcts_agent import GymctsAgent
 from gymcts.gymcts_action_history_wrapper import ActionHistoryMCTSGymEnvWrapper
-from gymcts.gymcts_deepcopy_wrapper import DeepCopyMCTSGymEnvWrapper
 
 from gymcts.logger import log
 
@@ -434,7 +447,7 @@ if __name__ == '__main__':
     env = gym.make('FrozenLake-v1', desc=None, map_name="4x4", is_slippery=False, render_mode="ansi")
     env.reset()
 
-    # wrap the environment with the naive wrapper or a custom gymcts wrapper
+    # wrap the environment with the wrapper or a custom gymcts wrapper
     env = ActionHistoryMCTSGymEnvWrapper(env)
 
     # create the agent
@@ -505,11 +518,11 @@ clone the repository in your favorite code editor (for example PyCharm, VSCode,
 
 using https:
 ```shell
-git clone https://github.com/Alexander-Nasuta/todo
+git clone https://github.com/Alexander-Nasuta/gymcts.git
 ```
 or by using the GitHub CLI:
 ```shell
-gh repo clone Alexander-Nasuta/todo
+gh repo clone Alexander-Nasuta/gymcts
 ```
 
 if you are using PyCharm, I recommend doing the following additional steps:
@@ -518,9 +531,6 @@ if you are using PyCharm, I recommend doing the following additional steps:
 - mark the `tests` folder as test root (by right-clicking on the folder and selecting `Mark Directory as` -> `Test Sources Root`)
 - mark the `resources` folder as resources root (by right-clicking on the folder and selecting `Mark Directory as` -> `Resources Root`)
 
-at the end your project structure should look like this:
-
-todo
 
 ### Create a Virtual Environment (optional)
 
@@ -576,9 +586,6 @@ This project uses `pytest` for testing. To run the tests, run the following comm
 ```shell
 pytest
 ```
-Here is a screenshot of what the output might look like:
-
-![](https://github.com/Alexander-Nasuta/GraphMatrixJobShopEnv/raw/master/resources/pytest-screenshot.png)
 
 For testing with `tox` run the following command:
 
@@ -586,12 +593,6 @@ For testing with `tox` run the following command:
 tox
 ```
 
-Here is a screenshot of what the output might look like:
-
-![](https://github.com/Alexander-Nasuta/GraphMatrixJobShopEnv/raw/master/resources/tox-screenshot.png)
-
-Tox will run the tests in a separate environment and will also check if the requirements are installed correctly.
-
 ### Builing and Publishing the Project to PyPi 
 
 In order to publish the project to PyPi, the project needs to be built and then uploaded to PyPi.
@@ -630,7 +631,6 @@ sphinx-autobuild ./docs/source/ ./docs/build/html/
 This project features most of the extensions featured in this Tutorial: [Document Your Scientific Project With Markdown, Sphinx, and Read the Docs | PyData Global 2021](https://www.youtube.com/watch?v=qRSb299awB0).
 
 
-
 ## Contact
 
 If you have any questions or feedback, feel free to contact me via [email](mailto:alexander.nasuta@wzl-iqs.rwth-aachen.de) or open an issue on repository.

gymcts-1.3.0.dist-info/RECORD

@@ -0,0 +1,16 @@
+gymcts/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+gymcts/colorful_console_utils.py,sha256=n7nymC8kKZnA_8nXcdn201NAzjZjgEHfKpbBcnl4oAE,5891
+gymcts/gymcts_action_history_wrapper.py,sha256=7-p17Fgb80SRCBaCm6G8SJrEPsl2Y4aIO3InviuQP08,6993
+gymcts/gymcts_agent.py,sha256=OAcN2-mFCR2AVJrRZlRtROF_zHk90SIM-uAebKektIc,10768
+gymcts/gymcts_deepcopy_wrapper.py,sha256=lCCT5-6JVCwUCP__4uPMMkT5HnO2JWm2ebzJ69zXp9c,6792
+gymcts/gymcts_distributed_agent.py,sha256=Ha9UBQvFjoErfMWvPyN0JcTYz-JaiJ4eWjLMikp9Yhs,11569
+gymcts/gymcts_env_abc.py,sha256=iqrFNNSa-kZyAGk1UN2BjkdkV6NufAkYJT8d7PlQ07E,2525
+gymcts/gymcts_neural_agent.py,sha256=urYGA5D6idChPke8Ac9zqhKy2NqkJzt3Zt-j8V6OpuQ,15785
+gymcts/gymcts_node.py,sha256=-YKfK5fryPteCp-UTsAgzFVIBucZdXPMbXHCIb6mS24,13151
+gymcts/gymcts_tree_plotter.py,sha256=PR6C7q9Q4kuz1aLGyD7-aZsxk3RqlHZpOqmOiRpCyK0,3547
+gymcts/logger.py,sha256=RI7B9cvbBGrj0_QIAI77wihzuu2tPG_-z9GM2Mw5aHE,926
+gymcts-1.3.0.dist-info/licenses/LICENSE,sha256=UGe75WojDiw_77SEnK2aysEDlElRlkWie7U7NaAFx00,1072
+gymcts-1.3.0.dist-info/METADATA,sha256=pyhdSu_PAMi9IbVeSsHU0EcJSasAMttrtz-pKIjbePw,23864
+gymcts-1.3.0.dist-info/WHEEL,sha256=_zCd3N1l69ArxyTb8rzEoP9TpbYXkqRFSNOD5OuxnTs,91
+gymcts-1.3.0.dist-info/top_level.txt,sha256=E8MoLsPimUPD0H1Y6lum4TVe-lhSDAyBAXGrkYIT52w,7
+gymcts-1.3.0.dist-info/RECORD,,

{gymcts-1.2.0.dist-info → gymcts-1.3.0.dist-info}/WHEEL

@@ -1,5 +1,5 @@
 Wheel-Version: 1.0
-Generator: setuptools (78.0.2)
+Generator: setuptools (80.9.0)
 Root-Is-Purelib: true
 Tag: py3-none-any
 

gymcts-1.2.0.dist-info/RECORD

@@ -1,15 +0,0 @@
-gymcts/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-gymcts/colorful_console_utils.py,sha256=OhULcXHKbEA4uJDAEYCTcW6wUv0LsHX_XSYzZ_Szsv4,4553
-gymcts/gymcts_action_history_wrapper.py,sha256=AjvBBwd1t9-nTYP09aMdlScAkFNXf5vOagejpjWYOPo,3810
-gymcts/gymcts_agent.py,sha256=O2y98jKFjR5TzqVV7DO1jlcYDyzAgd_H2RF4-w4NP0g,8499
-gymcts/gymcts_deepcopy_wrapper.py,sha256=OleQTnvxv3gLEo8-2asyeo-CpZ4HEbgyFGS5DTCD7NM,4167
-gymcts/gymcts_distributed_agent.py,sha256=M7dyBfC8u3M99PJFoXKgIc_CPTyHGppmktkH-y9ci4U,10448
-gymcts/gymcts_env_abc.py,sha256=7nCRiiClmmVLX-d_Q1dxeztmuvmAtmWZwjT81zrG1_w,575
-gymcts/gymcts_node.py,sha256=PT_YZFwt1zjuvd8i9Wb5LEkHAqmJOFyPDp3GFD05lqM,7138
-gymcts/gymcts_tree_plotter.py,sha256=eg207wHcDepwWODXzmDYQn1Aai29Cs4jFS1HNvAhlXs,2651
-gymcts/logger.py,sha256=nAkUa4djiuCR7hF0EUsplhqFHCp76QcOX1cV3lIPzOI,937
-gymcts-1.2.0.dist-info/licenses/LICENSE,sha256=UGe75WojDiw_77SEnK2aysEDlElRlkWie7U7NaAFx00,1072
-gymcts-1.2.0.dist-info/METADATA,sha256=zhEIFo0rOnv5hCv6ukImkq-9nshO4EfXMbHlhNlYhyA,23640
-gymcts-1.2.0.dist-info/WHEEL,sha256=DK49LOLCYiurdXXOXwGJm6U4DkHkg4lcxjhqwRa0CP4,91
-gymcts-1.2.0.dist-info/top_level.txt,sha256=E8MoLsPimUPD0H1Y6lum4TVe-lhSDAyBAXGrkYIT52w,7
-gymcts-1.2.0.dist-info/RECORD,,