algorhino-anemone 0.1.3__py3-none-any.whl → 0.1.4__py3-none-any.whl

{algorhino_anemone-0.1.3.dist-info → algorhino_anemone-0.1.4.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: algorhino-anemone
-Version: 0.1.3
+Version: 0.1.4
 Summary: anemone searches trees
 Author-email: Victor Gabillon <victorgabillon@gmail.com>
 License-Expression: GPL-3.0-only

{algorhino_anemone-0.1.3.dist-info → algorhino_anemone-0.1.4.dist-info}/RECORD

@@ -1,9 +1,9 @@
-algorhino_anemone-0.1.3.dist-info/licenses/LICENSE,sha256=OXLcl0T2SZ8Pmy2_dmlvKuetivmyPd5m1q-Gyd-zaYY,35149
+algorhino_anemone-0.1.4.dist-info/licenses/LICENSE,sha256=OXLcl0T2SZ8Pmy2_dmlvKuetivmyPd5m1q-Gyd-zaYY,35149
 anemone/__init__.py,sha256=iKX9OGJxbyIqe9Fy-xxZY6sdH7WcG4RFyPR0WBai7Ls,942
 anemone/basics.py,sha256=plCN-SfAcCj4TPDVD3r19Q36UFjiKmNvuEyPH0kQ7Qs,574
-anemone/factory.py,sha256=Nmx84UrSqED3R9891XoBTX56jKlINvZn4DLYduSbHgo,6020
+anemone/factory.py,sha256=seGZuwQNzfdSV7moN-kwqDGp0EfEY0srS0awHAR7mvk,6044
 anemone/state_transition.py,sha256=fxvHZOYRtWV5ExXRIoehdRg9qV6zhgiE5uiCeOc80Dc,1418
-anemone/tree_and_value_branch_selector.py,sha256=7s_Tz3JeG0rFYfFLSEUegMSb-av7vKg_9jM2AANUbig,3474
+anemone/tree_and_value_branch_selector.py,sha256=9m7cWzw_nsFKiqZ4l7B2fz0lZ9HZ2NUNH2flZpaaQvQ,3479
 anemone/tree_exploration.py,sha256=cg1iTp3j9p9jUNjm07ogbflX8VC15AV8GEhGz3g1YNU,10529
 anemone/indices/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 anemone/indices/index_manager/__init__.py,sha256=P49ofGrnP_Nfmv63Rg_-Zvwn5NFvFFDQ3MD3GMeWNWw,515
@@ -17,12 +17,12 @@ anemone/nn/torch_evaluator.py,sha256=cXcaldEI5S8JE1Yy9aNUamVEK3DPsPmBmGeUi9611zU
 anemone/node_evaluation/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 anemone/node_evaluation/node_direct_evaluation/__init__.py,sha256=2_YwJ3oe0KBfIc3Hs-FLz093RLZsTG-VaNmecLceoiY,898
 anemone/node_evaluation/node_direct_evaluation/factory.py,sha256=lpFmBJkIGAnar5-pQ1vMze9jUFKFchp5Pg2S8eK-ABM,470
-anemone/node_evaluation/node_direct_evaluation/node_direct_evaluator.py,sha256=jM-gkNeaOOXBXS4JNAAVeXJ5K2bAOppQwV7wpTBX1Ck,5787
-anemone/node_evaluation/node_tree_evaluation/node_minmax_evaluation.py,sha256=KfU781UnaD9P2qibIKHXXnc8q7Rd2eJJl5NzKKsntsc,35126
-anemone/node_evaluation/node_tree_evaluation/node_tree_evaluation.py,sha256=x5fnbf6NhKGouBgU0rNVNSmusmNovbcnQ3eLH6JV7Ow,4260
+anemone/node_evaluation/node_direct_evaluation/node_direct_evaluator.py,sha256=EU9idWUGVjVBclnSiGE-3OZvvV9a7nhUZKTJCnOBhqw,5787
+anemone/node_evaluation/node_tree_evaluation/node_minmax_evaluation.py,sha256=JuD1yg15l-FONW85s3rkp9mD1a1Y_kCZoiqI4-DGlg0,35127
+anemone/node_evaluation/node_tree_evaluation/node_tree_evaluation.py,sha256=fHAKN_8vriERrfKfr_qDH-y7El6HBYFXHOe9eFFCDUw,4260
 anemone/node_evaluation/node_tree_evaluation/node_tree_evaluation_factory.py,sha256=UY1glqflqMOqOPAHhtuzJ8QhGOp55Y9InqdhCMt9KJ8,1279
 anemone/node_factory/__init__.py,sha256=qhbX58hu8-TdFof5zo3ibfPFvF-OWNSgJf3RDMrtyTQ,553
-anemone/node_factory/algorithm_node_factory.py,sha256=eHsyZ6_no8i9ACfZV8VSKefV3kXiQHvdMNEighDn8Lc,3947
+anemone/node_factory/algorithm_node_factory.py,sha256=DfFRIJAdycwJ1CROXVdvEbyJAmVzjN_UBqF3BhT5pIs,3994
 anemone/node_factory/base.py,sha256=t_immiv-BDrPeQTUiOqvZLSlUq0zA2IbnM5Rweqv_n8,2134
 anemone/node_selector/__init__.py,sha256=DThR5UV-4WZG4PT5Lo0RPv9_P83ixFGfOSFoGihKtuA,1320
 anemone/node_selector/branch_explorer.py,sha256=3ywYkJe2R1Dg5nhmDXCgyhex85bT39Ql7ifRY--9Z_A,2677
@@ -45,7 +45,7 @@ anemone/nodes/tree_node.py,sha256=C9jKzA62ToYhANYjwhS2qPAHti81l-x-p7RmKe6Sb0Q,77
 anemone/nodes/tree_traversal.py,sha256=sE9as_8-74bIUuAYNhk2MK6VvlrN1Y3mFExff_HGpQ8,3958
 anemone/nodes/utils.py,sha256=_NPGFnjzouFMpepyNPw5D0d3999_F3tmJHa0bafwo7M,4501
 anemone/nodes/algorithm_node/__init__.py,sha256=8cNk3PmDzd22K78YWiO29Mu5A1FCObzPwEfWE1ym6Jk,116
-anemone/nodes/algorithm_node/algorithm_node.py,sha256=SlYxmClzIgd6y1yPB3G2vZMoPIzylo8hHqcO2iXJje8,6528
+anemone/nodes/algorithm_node/algorithm_node.py,sha256=DUJIVM9PdSRndeir9lPe5e9ebiu9lNx27c0z819Rw64,6544
 anemone/progress_monitor/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 anemone/progress_monitor/progress_monitor.py,sha256=ExuvwOntZBwrBjIbNr8ZpeCd2F5s21rsX74FFog7gqY,10896
 anemone/recommender_rule/__init__.py,sha256=9K73T0bkpvHg0IsQc1OW8QgsUhCNYq9ceqPMkwdqE8c,347
@@ -56,7 +56,7 @@ anemone/tree_manager/__init__.py,sha256=D3j8emzRNF1fkPTpNUPsXbqAzMM9SyI3Ty_4Y_b2
 anemone/tree_manager/algorithm_node_tree_manager.py,sha256=ekDfS4lfYGP9tNtUGre6DGz0haHi3-MZuUVO-kF0JQU,8801
 anemone/tree_manager/factory.py,sha256=d10uuf5DtHZ_jKT7Z688Wd3_a7TewwmUywlTeWdUQwc,2679
 anemone/tree_manager/tree_expander.py,sha256=LpKFDKsOrW0cq09m11aXQZV82s10iyiizQafRBHQ7ts,4041
-anemone/tree_manager/tree_manager.py,sha256=n0ck4Z-i0WIiRI5RkqrhnYNFD88B9Uw1cU0Xa_q0LAE,8281
+anemone/tree_manager/tree_manager.py,sha256=QJAKOyln-zPSAwGbcyX3OTnHW-lawshOgwxp69j_sN0,8284
 anemone/trees/__init__.py,sha256=FtX6ZDfZI7JDjv6IAgKRVytJmafL3Vod3RF7L-bDTWc,269
 anemone/trees/descendants.py,sha256=bq8GrckFsPpteWr68og4a5KA94hYWn-qrDzC6dDfOKw,27249
 anemone/trees/factory.py,sha256=GIZcojZzxl5VG6lEpxxF9PV8VZnS-c18xWxg0dza0r8,2180
@@ -76,7 +76,7 @@ anemone/utils/dict_of_numbered_dict_with_pointer_on_max.py,sha256=s5Z-O5mBwJUh4P
 anemone/utils/logger.py,sha256=bJQ8COqdn5obtbi8TuokQHmdHpp57XRksTmfvCLLfyM,2973
 anemone/utils/my_value_sorted_dict.py,sha256=LbqtpBSCS7VrUTUChWCsi18IKZj65FkTJREqbl-xSVA,619
 anemone/utils/small_tools.py,sha256=l9dy5Oqvuvg8qQXqJUfyb3uwBHwVGVrKz6WeTHjyLTk,2766
-algorhino_anemone-0.1.3.dist-info/METADATA,sha256=1ky2d5juHL2FQc6VTlRsVJNqej1Pr69dvR0dYX1ZoJA,5691
-algorhino_anemone-0.1.3.dist-info/WHEEL,sha256=_zCd3N1l69ArxyTb8rzEoP9TpbYXkqRFSNOD5OuxnTs,91
-algorhino_anemone-0.1.3.dist-info/top_level.txt,sha256=G1vbB-vAevQVde3UZ5X1_Ysy1_6sJDEueHRi2qcDgrY,8
-algorhino_anemone-0.1.3.dist-info/RECORD,,
+algorhino_anemone-0.1.4.dist-info/METADATA,sha256=beVHIe1Er6XUzU7LmxPcJTvD9x9TMCJAOzrfDES-5kw,5691
+algorhino_anemone-0.1.4.dist-info/WHEEL,sha256=qELbo2s1Yzl39ZmrAibXA2jjPLUYfnVhUNTlyF1rq0Y,92
+algorhino_anemone-0.1.4.dist-info/top_level.txt,sha256=G1vbB-vAevQVde3UZ5X1_Ysy1_6sJDEueHRi2qcDgrY,8
+algorhino_anemone-0.1.4.dist-info/RECORD,,

{algorhino_anemone-0.1.3.dist-info → algorhino_anemone-0.1.4.dist-info}/WHEEL

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

anemone/factory.py

@@ -56,7 +56,8 @@ def create_tree_and_value_branch_selector[StateT: TurnState](
     args: TreeAndValuePlayerArgs,
     random_generator: Random,
     master_state_evaluator: MasterStateEvaluator,
-    state_representation_factory: RepresentationFactory[ContentRepresentation] | None,
+    state_representation_factory: RepresentationFactory[StateT, ContentRepresentation]
+    | None,
     queue_progress_player: Queue[IsDataclass] | None,
 ) -> TreeAndValueBranchSelector[StateT]:
     """Convenience constructor using the default minmax tree evaluation.
@@ -85,7 +86,8 @@ def create_tree_and_value_branch_selector_with_tree_eval_factory[StateT: TurnSta
     args: TreeAndValuePlayerArgs,
     random_generator: Random,
     master_state_evaluator: MasterStateEvaluator,
-    state_representation_factory: RepresentationFactory[ContentRepresentation] | None,
+    state_representation_factory: RepresentationFactory[StateT, ContentRepresentation]
+    | None,
     node_tree_evaluation_factory: NodeTreeEvaluationFactory[StateT],
     queue_progress_player: Queue[IsDataclass] | None,
 ) -> TreeAndValueBranchSelector[StateT]:

anemone/node_evaluation/node_direct_evaluation/node_direct_evaluator.py

@@ -89,7 +89,7 @@ class MasterStateEvaluator(Protocol):
 class NodeDirectEvaluator[StateT: State = State]:
     """
     The NodeEvaluator class is responsible for evaluating the value of nodes in a tree structure.
-    It uses a board evaluator and a syzygy evaluator to calculate the value of the nodes.
+    It uses a state evaluator and a syzygy evaluator to calculate the value of the nodes.
     """
 
     master_state_evaluator: MasterStateEvaluator

anemone/node_evaluation/node_tree_evaluation/node_minmax_evaluation.py

@@ -140,7 +140,7 @@ class NodeMinmaxEvaluation[
         return self.value_white_minmax
 
     def set_evaluation(self, evaluation: float) -> None:
-        """sets the evaluation from the board evaluator
+        """Set the evaluation from the state evaluator.
 
         Args:
             evaluation (float): The evaluation value to be set.
@@ -876,6 +876,7 @@ class NodeMinmaxEvaluation[
 
     def evaluate(self) -> StateEvaluation:
         """Build a StateEvaluation from current minmax state."""
+
         if self.over_event.is_over():
             return ForcedOutcome(
                 outcome=self.over_event,

anemone/node_evaluation/node_tree_evaluation/node_tree_evaluation.py

@@ -43,7 +43,7 @@ class NodeTreeEvaluation[StateT: State = State](Protocol):
     value_white_minmax: float | None = None
 
     def set_evaluation(self, evaluation: float) -> None:
-        """sets the evaluation from the board evaluator
+        """Set the evaluation from the state evaluator.
 
         Args:
             evaluation (float): The evaluation value to be set.

anemone/node_factory/algorithm_node_factory.py

@@ -37,7 +37,9 @@ class AlgorithmNodeFactory[StateT: State = State]:
     """
 
     tree_node_factory: TreeNodeFactory[AlgorithmNode[StateT], StateT]
-    state_representation_factory: RepresentationFactory | None
+    state_representation_factory: (
+        RepresentationFactory[StateT, ContentRepresentation] | None
+    )
     node_tree_evaluation_factory: NodeTreeEvaluationFactory[StateT]
     exploration_index_data_create: node_indices.ExplorationIndexDataFactory[
         AlgorithmNode[StateT], StateT

anemone/nodes/algorithm_node/algorithm_node.py

@@ -57,7 +57,7 @@ class AlgorithmNode[StateT: State = State]:
             tree_node (TreeNode): The tree node that is wrapped.
             tree_evaluation (NodeTreeEvaluation): The object computing the value.
             exploration_index_data (NodeExplorationData | None): The object storing the information to help the algorithm decide the next nodes to explore.
-            state_representation (StateRepresentation | None): The board representation.
+            state_representation (ContentRepresentation | None): The state representation used for evaluation.
         """
         self.tree_node = tree_node
         self.tree_evaluation = tree_evaluation
@@ -147,7 +147,7 @@ class AlgorithmNode[StateT: State = State]:
     @property
     def all_branches_keys(self) -> BranchKeyGeneratorP[BranchKey]:
         """
-        Returns a generator that yields the branch keys for the current board state.
+        Returns a generator that yields the branch keys for the current state.
 
         Returns:
             BranchKeyGenerator: A generator that yields the branch keys.

anemone/tree_and_value_branch_selector.py

@@ -49,7 +49,7 @@ class TreeAndValueBranchSelector[StateT: TurnState = TurnState]:
         Selects the best branch based on the tree and value strategy.
 
         Args:
-        - board: The current board state.
+        - state: The current state to explore.
         - selection_seed: The seed used for randomization during branch selection.
 
         Returns:

anemone/tree_manager/tree_manager.py

@@ -70,7 +70,7 @@ class TreeManager[
         Returns:
             The tree expansion object.
         """
-        # The parent board is copied, we only copy the stack (history of previous board) if the depth is smaller than 2
+        # The parent state is copied; we only copy the stack (history of previous states) if the depth is smaller than 2.
         # Having the stack information allows checking for draw by repetition.
         # To limit computation we limit copying it all the time. The resulting policy will only be aware of immediate
         # risk of draw by repetition
@@ -117,7 +117,7 @@ class TreeManager[
             The tree expansion object.
         """
 
-        # Creation of the child node. If the board already exited in another node, that node is returned as child_node.
+        # Creation of the child node. If the state already existed in another node, that node is returned as child_node.
         tree_depth: int = parent_node.tree_depth + 1
         state_tag: StateTag = state.tag