algorhino-anemone 0.1.3__tar.gz → 0.1.5__tar.gz

{algorhino_anemone-0.1.3/src/algorhino_anemone.egg-info → algorhino_anemone-0.1.5}/PKG-INFO

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

{algorhino_anemone-0.1.3 → algorhino_anemone-0.1.5}/pyproject.toml

@@ -5,7 +5,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "algorhino-anemone"
-version = "0.1.3"
+version = "0.1.5"
 description = "anemone searches trees"
 keywords = ["tree", "search"]
 classifiers = [
@@ -14,7 +14,7 @@ classifiers = [
 ]
 requires-python = ">=3.13"
 dependencies = [
-    "valanga>=0.1.4",
+    "valanga>=0.1.6",
     "atomheart>=0.1.2",
     "rich",
     "sortedcollections>=2.1.0",
@@ -265,7 +265,7 @@ description = "ruff + pylint (fast, no package build/install)"
 package = "skip"
 deps = [
   # runtime deps needed for pylint imports (match [project].dependencies)
-  "valanga>=0.1.4",
+  "valanga>=0.1.6",
   "atomheart>=0.1.2",
   "rich",
   "sortedcollections>=2.1.0",
@@ -290,7 +290,7 @@ description = "mypy + pyright (fast, no package build/install)"
 package = "skip"
 deps = [
   # runtime deps for import resolution
-  "valanga>=0.1.4",
+  "valanga>=0.1.6",
   "atomheart>=0.1.2",
   "rich",
   "sortedcollections>=2.1.0",

{algorhino_anemone-0.1.3 → algorhino_anemone-0.1.5/src/algorhino_anemone.egg-info}/PKG-INFO

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

{algorhino_anemone-0.1.3 → algorhino_anemone-0.1.5}/src/algorhino_anemone.egg-info/requires.txt

@@ -1,4 +1,4 @@
-valanga>=0.1.4
+valanga>=0.1.6
 atomheart>=0.1.2
 rich
 sortedcollections>=2.1.0

algorhino_anemone-0.1.5/src/anemone/basics.py

@@ -0,0 +1,6 @@
+"""Basic types and protocols for Anemone."""
+
+from typing import Annotated
+
+type Seed = Annotated[int, "seed"]
+type TreeDepth = Annotated[int, "Depth level of a node in a tree structure"]

{algorhino_anemone-0.1.3 → algorhino_anemone-0.1.5}/src/anemone/factory.py

@@ -7,7 +7,8 @@ from queue import Queue
 from random import Random
 from typing import Literal, Type
 
-from valanga import ContentRepresentation, RepresentationFactory, TurnState
+from valanga import RepresentationFactory, TurnState
+from valanga.evaluator_types import EvaluatorInput
 
 from anemone import node_factory
 from anemone import search_factory as search_factories
@@ -56,7 +57,7 @@ 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, EvaluatorInput] | None,
     queue_progress_player: Queue[IsDataclass] | None,
 ) -> TreeAndValueBranchSelector[StateT]:
     """Convenience constructor using the default minmax tree evaluation.
@@ -85,7 +86,7 @@ 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, EvaluatorInput] | None,
     node_tree_evaluation_factory: NodeTreeEvaluationFactory[StateT],
     queue_progress_player: Queue[IsDataclass] | None,
 ) -> TreeAndValueBranchSelector[StateT]:

{algorhino_anemone-0.1.3 → algorhino_anemone-0.1.5}/src/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

{algorhino_anemone-0.1.3 → algorhino_anemone-0.1.5}/src/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,

{algorhino_anemone-0.1.3 → algorhino_anemone-0.1.5}/src/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.

{algorhino_anemone-0.1.3 → algorhino_anemone-0.1.5}/src/anemone/node_factory/algorithm_node_factory.py

@@ -12,6 +12,7 @@ from valanga import (
     State,
     StateModifications,
 )
+from valanga.evaluator_types import EvaluatorInput
 
 from anemone.basics import TreeDepth
 from anemone.indices import node_indices
@@ -37,7 +38,7 @@ class AlgorithmNodeFactory[StateT: State = State]:
     """
 
     tree_node_factory: TreeNodeFactory[AlgorithmNode[StateT], StateT]
-    state_representation_factory: RepresentationFactory | None
+    state_representation_factory: RepresentationFactory[StateT, EvaluatorInput] | None
     node_tree_evaluation_factory: NodeTreeEvaluationFactory[StateT]
     exploration_index_data_create: node_indices.ExplorationIndexDataFactory[
         AlgorithmNode[StateT], StateT
@@ -60,7 +61,9 @@ class AlgorithmNodeFactory[StateT: State = State]:
             node_indices.NodeExplorationData[AlgorithmNode[StateT], StateT] | None
         ) = self.exploration_index_data_create(tree_node)
 
-        state_representation: ContentRepresentation | None = None
+        state_representation: ContentRepresentation[StateT, EvaluatorInput] | None = (
+            None
+        )
         if self.state_representation_factory is not None:
             if parent_node is not None:
                 parent_node_representation = parent_node.state_representation

{algorhino_anemone-0.1.3 → algorhino_anemone-0.1.5}/src/anemone/nodes/algorithm_node/algorithm_node.py

@@ -12,6 +12,7 @@ from valanga import (
     State,
     StateTag,
 )
+from valanga.evaluator_types import EvaluatorInput
 
 from anemone.indices.node_indices import NodeExplorationData
 from anemone.node_evaluation.node_tree_evaluation.node_tree_evaluation import (
@@ -33,11 +34,13 @@ class AlgorithmNode[StateT: State = State]:
         NodeExplorationData[Self, StateT] | None
     )  # the object storing the information to help the algorithm decide the next nodes to explore
     _state_representation: (
-        ContentRepresentation | None
+        ContentRepresentation[StateT, EvaluatorInput] | None
     )  # the state representation for evaluation
 
     @property
-    def state_representation(self) -> ContentRepresentation | None:
+    def state_representation(
+        self,
+    ) -> ContentRepresentation[StateT, EvaluatorInput] | None:
         """
         Returns the state representation.
         """
@@ -48,7 +51,7 @@ class AlgorithmNode[StateT: State = State]:
         tree_node: TreeNode[Self, StateT],
         tree_evaluation: NodeTreeEvaluation[StateT],
         exploration_index_data: NodeExplorationData[Self, StateT] | None,
-        state_representation: ContentRepresentation | None,
+        state_representation: ContentRepresentation[StateT, EvaluatorInput] | None,
     ) -> None:
         """
         Initializes an AlgorithmNode object.
@@ -57,7 +60,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 +150,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.

{algorhino_anemone-0.1.3 → algorhino_anemone-0.1.5}/src/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:

{algorhino_anemone-0.1.3 → algorhino_anemone-0.1.5}/src/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
 

algorhino_anemone-0.1.3/src/anemone/basics.py

@@ -1,23 +0,0 @@
-"""Basic types and protocols for Anemone."""
-
-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."""
-        ...