algorhino-anemone 0.1.9__py3-none-any.whl → 0.1.10__py3-none-any.whl

{algorhino_anemone-0.1.9.dist-info → algorhino_anemone-0.1.10.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: algorhino-anemone
-Version: 0.1.9
+Version: 0.1.10
 Summary: anemone searches trees
 Author-email: Victor Gabillon <victorgabillon@gmail.com>
 License-Expression: GPL-3.0-only
@@ -12,8 +12,8 @@ Classifier: Operating System :: OS Independent
 Requires-Python: >=3.13
 Description-Content-Type: text/markdown
 License-File: LICENSE
-Requires-Dist: valanga>=0.1.10
-Requires-Dist: atomheart>=0.1.2
+Requires-Dist: valanga>=0.1.13
+Requires-Dist: atomheart>=0.1.6
 Requires-Dist: rich
 Requires-Dist: sortedcollections>=2.1.0
 Requires-Dist: graphviz

{algorhino_anemone-0.1.9.dist-info → algorhino_anemone-0.1.10.dist-info}/RECORD

@@ -1,9 +1,9 @@
-algorhino_anemone-0.1.9.dist-info/licenses/LICENSE,sha256=OXLcl0T2SZ8Pmy2_dmlvKuetivmyPd5m1q-Gyd-zaYY,35149
+algorhino_anemone-0.1.10.dist-info/licenses/LICENSE,sha256=OXLcl0T2SZ8Pmy2_dmlvKuetivmyPd5m1q-Gyd-zaYY,35149
 anemone/__init__.py,sha256=iKX9OGJxbyIqe9Fy-xxZY6sdH7WcG4RFyPR0WBai7Ls,942
-anemone/basics.py,sha256=wKagPFuxXhDQbjTuM1Qjh37HcJt0m39NBMDg2dc2M6M,188
-anemone/factory.py,sha256=mZ-YD8bZYNsejDbLExcu96kM3LTQLKqwug2xROGCsJ8,6163
+anemone/basics.py,sha256=plCN-SfAcCj4TPDVD3r19Q36UFjiKmNvuEyPH0kQ7Qs,574
+anemone/factory.py,sha256=V4uretydlF0ykyq4ybn28GkctrOv7-78RSsxOJsQgPg,6146
 anemone/state_transition.py,sha256=fxvHZOYRtWV5ExXRIoehdRg9qV6zhgiE5uiCeOc80Dc,1418
-anemone/tree_and_value_branch_selector.py,sha256=9m7cWzw_nsFKiqZ4l7B2fz0lZ9HZ2NUNH2flZpaaQvQ,3479
+anemone/tree_and_value_branch_selector.py,sha256=2K3AprInjzTIMm1sQsL4B33hljZcT-ToQfwpQrrRk5o,3455
 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
@@ -22,7 +22,7 @@ anemone/node_evaluation/node_tree_evaluation/node_minmax_evaluation.py,sha256=Ju
 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=xqa0d2ulkTsGJIbb5KMxWB5yxcFUton9TeBiYwObR1o,4106
+anemone/node_factory/algorithm_node_factory.py,sha256=Pz0YYPqsuKaRiOhL9gJdEBPXEFepZNr_mZ_Ib94OVHs,4106
 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
@@ -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.9.dist-info/METADATA,sha256=qqp9hJxlMYL6l1UsW_ahurX6rslDBGXvjHwWidw7dWA,5692
-algorhino_anemone-0.1.9.dist-info/WHEEL,sha256=qELbo2s1Yzl39ZmrAibXA2jjPLUYfnVhUNTlyF1rq0Y,92
-algorhino_anemone-0.1.9.dist-info/top_level.txt,sha256=G1vbB-vAevQVde3UZ5X1_Ysy1_6sJDEueHRi2qcDgrY,8
-algorhino_anemone-0.1.9.dist-info/RECORD,,
+algorhino_anemone-0.1.10.dist-info/METADATA,sha256=Z1k54ME5SXYqL4aFeYt4157f7ikwIZslHJS0eV6md58,5693
+algorhino_anemone-0.1.10.dist-info/WHEEL,sha256=wUyA8OaulRlbfwMtmQsvNngGrxQHAvkKcvRmdizlJi0,92
+algorhino_anemone-0.1.10.dist-info/top_level.txt,sha256=G1vbB-vAevQVde3UZ5X1_Ysy1_6sJDEueHRi2qcDgrY,8
+algorhino_anemone-0.1.10.dist-info/RECORD,,

{algorhino_anemone-0.1.9.dist-info → algorhino_anemone-0.1.10.dist-info}/WHEEL

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

anemone/basics.py

@@ -1,6 +1,23 @@
 """Basic types and protocols for Anemone."""
 
-from typing import Annotated
+from typing import Annotated, Protocol
+
+from valanga import Color, HasTurn, State
 
 type Seed = Annotated[int, "seed"]
 type TreeDepth = Annotated[int, "Depth level of a node in a tree structure"]
+
+
+class StateWithTurn(State, HasTurn, Protocol):
+    """A `valanga.State` that also exposes turn information."""
+
+    ...
+
+
+class HasBlackAndWhiteTurn(Protocol):
+    """Protocol for state that has black and white turns."""
+
+    @property
+    def turn(self) -> Color:
+        """Return the current player's turn color."""
+        ...

anemone/factory.py

@@ -7,11 +7,7 @@ from queue import Queue
 from random import Random
 from typing import Literal, Type
 
-from valanga import (
-    RepresentationFactory,
-    StateModifications,
-    TurnState,
-)
+from valanga import RepresentationFactory, StateModifications, TurnState
 from valanga.evaluator_types import EvaluatorInput
 
 from anemone import node_factory
@@ -62,7 +58,7 @@ def create_tree_and_value_branch_selector[StateT: TurnState](
     random_generator: Random,
     master_state_evaluator: MasterStateEvaluator,
     state_representation_factory: RepresentationFactory[
-        StateT, StateModifications, EvaluatorInput
+        StateT, EvaluatorInput, StateModifications
     ]
     | None,
     queue_progress_player: Queue[IsDataclass] | None,
@@ -94,7 +90,7 @@ def create_tree_and_value_branch_selector_with_tree_eval_factory[StateT: TurnSta
     random_generator: Random,
     master_state_evaluator: MasterStateEvaluator,
     state_representation_factory: RepresentationFactory[
-        StateT, StateModifications, EvaluatorInput
+        StateT, EvaluatorInput, StateModifications
     ]
     | None,
     node_tree_evaluation_factory: NodeTreeEvaluationFactory[StateT],

anemone/node_factory/algorithm_node_factory.py

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

anemone/tree_and_value_branch_selector.py

@@ -44,7 +44,7 @@ class TreeAndValueBranchSelector[StateT: TurnState = TurnState]:
     recommend_branch_after_exploration: recommender_rule.AllRecommendFunctionsArgs
     queue_progress_player: Queue[IsDataclass] | None
 
-    def select_branch(self, state: StateT, selection_seed: Seed) -> Recommendation:
+    def recommend(self, state: StateT, seed: Seed) -> Recommendation:
         """
         Selects the best branch based on the tree and value strategy.
 
@@ -56,7 +56,7 @@ class TreeAndValueBranchSelector[StateT: TurnState = TurnState]:
         - The recommended branch based on the tree and value strategy.
         """
         tree_exploration: TreeExploration = self.create_tree_exploration(state=state)
-        self.random_generator.seed(selection_seed)
+        self.random_generator.seed(seed)
 
         branch_recommendation: Recommendation = tree_exploration.explore(
             random_generator=self.random_generator