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

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

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: algorhino-anemone
-Version: 0.1.1
+Version: 0.1.3
 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
-Requires-Dist: atomheart
+Requires-Dist: valanga>=0.1.4
+Requires-Dist: atomheart>=0.1.2
 Requires-Dist: rich
 Requires-Dist: sortedcollections>=2.1.0
 Requires-Dist: graphviz
@@ -83,7 +83,7 @@ from anemone.node_selector.factory import UniformArgs
 from anemone.node_selector.node_selector_types import NodeSelectorType
 from anemone.progress_monitor.progress_monitor import (
     StoppingCriterionTypes,
-    TreeMoveLimitArgs,
+    TreeBranchLimitArgs,
 )
 from anemone.recommender_rule.recommender_rule import SoftmaxRule
 
@@ -91,9 +91,9 @@ from anemone.recommender_rule.recommender_rule import SoftmaxRule
 args = TreeAndValuePlayerArgs(
     node_selector=UniformArgs(type=NodeSelectorType.UNIFORM),
     opening_type=None,
-    stopping_criterion=TreeMoveLimitArgs(
-        type=StoppingCriterionTypes.TREE_MOVE_LIMIT,
-        tree_move_limit=100,
+    stopping_criterion=TreeBranchLimitArgs(
+        type=StoppingCriterionTypes.TREE_BRANCH_LIMIT,
+        tree_branch_limit=100,
     ),
     recommender_rule=SoftmaxRule(type="softmax", temperature=1.0),
 )

{algorhino_anemone-0.1.1 → algorhino_anemone-0.1.3}/README.md

@@ -39,7 +39,7 @@ from anemone.node_selector.factory import UniformArgs
 from anemone.node_selector.node_selector_types import NodeSelectorType
 from anemone.progress_monitor.progress_monitor import (
     StoppingCriterionTypes,
-    TreeMoveLimitArgs,
+    TreeBranchLimitArgs,
 )
 from anemone.recommender_rule.recommender_rule import SoftmaxRule
 
@@ -47,9 +47,9 @@ from anemone.recommender_rule.recommender_rule import SoftmaxRule
 args = TreeAndValuePlayerArgs(
     node_selector=UniformArgs(type=NodeSelectorType.UNIFORM),
     opening_type=None,
-    stopping_criterion=TreeMoveLimitArgs(
-        type=StoppingCriterionTypes.TREE_MOVE_LIMIT,
-        tree_move_limit=100,
+    stopping_criterion=TreeBranchLimitArgs(
+        type=StoppingCriterionTypes.TREE_BRANCH_LIMIT,
+        tree_branch_limit=100,
     ),
     recommender_rule=SoftmaxRule(type="softmax", temperature=1.0),
 )

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

@@ -5,7 +5,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "algorhino-anemone"
-version = "0.1.1"
+version = "0.1.3"
 description = "anemone searches trees"
 keywords = ["tree", "search"]
 classifiers = [
@@ -14,9 +14,8 @@ classifiers = [
 ]
 requires-python = ">=3.13"
 dependencies = [
-    "valanga",
-"atomheart",
-
+    "valanga>=0.1.4",
+    "atomheart>=0.1.2",
     "rich",
     "sortedcollections>=2.1.0",
     "graphviz",
@@ -236,9 +235,17 @@ extraPaths = ["src"]
 
 [tool.tox]
 min_version = "4.32.0"
-env_list = ["py313", "lint", "typecheck"]
+env_list = ["py313", "lint", "typecheck", "build"]
 isolated_build = true
 
+[tool.tox.env.build]
+deps = ["build", "twine"]
+commands = [
+  ["python", "-m", "build"],
+  ["python", "-m", "twine", "check", "dist/*"],
+]
+
+
 [tool.tox.env_run_base]
 base_python = ["python3.13"]
 
@@ -258,8 +265,8 @@ description = "ruff + pylint (fast, no package build/install)"
 package = "skip"
 deps = [
   # runtime deps needed for pylint imports (match [project].dependencies)
-  "valanga",
-  "atomheart",
+  "valanga>=0.1.4",
+  "atomheart>=0.1.2",
   "rich",
   "sortedcollections>=2.1.0",
   "graphviz",
@@ -283,8 +290,8 @@ description = "mypy + pyright (fast, no package build/install)"
 package = "skip"
 deps = [
   # runtime deps for import resolution
-  "valanga",
-  "atomheart",
+  "valanga>=0.1.4",
+  "atomheart>=0.1.2",
   "rich",
   "sortedcollections>=2.1.0",
   "graphviz",

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

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: algorhino-anemone
-Version: 0.1.1
+Version: 0.1.3
 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
-Requires-Dist: atomheart
+Requires-Dist: valanga>=0.1.4
+Requires-Dist: atomheart>=0.1.2
 Requires-Dist: rich
 Requires-Dist: sortedcollections>=2.1.0
 Requires-Dist: graphviz
@@ -83,7 +83,7 @@ from anemone.node_selector.factory import UniformArgs
 from anemone.node_selector.node_selector_types import NodeSelectorType
 from anemone.progress_monitor.progress_monitor import (
     StoppingCriterionTypes,
-    TreeMoveLimitArgs,
+    TreeBranchLimitArgs,
 )
 from anemone.recommender_rule.recommender_rule import SoftmaxRule
 
@@ -91,9 +91,9 @@ from anemone.recommender_rule.recommender_rule import SoftmaxRule
 args = TreeAndValuePlayerArgs(
     node_selector=UniformArgs(type=NodeSelectorType.UNIFORM),
     opening_type=None,
-    stopping_criterion=TreeMoveLimitArgs(
-        type=StoppingCriterionTypes.TREE_MOVE_LIMIT,
-        tree_move_limit=100,
+    stopping_criterion=TreeBranchLimitArgs(
+        type=StoppingCriterionTypes.TREE_BRANCH_LIMIT,
+        tree_branch_limit=100,
     ),
     recommender_rule=SoftmaxRule(type="softmax", temperature=1.0),
 )

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

@@ -1,5 +1,5 @@
-valanga
-atomheart
+valanga>=0.1.4
+atomheart>=0.1.2
 rich
 sortedcollections>=2.1.0
 graphviz

algorhino_anemone-0.1.3/src/anemone/basics.py

@@ -0,0 +1,23 @@
+"""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."""
+        ...

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

@@ -1,14 +1,5 @@
 """
-This module provides functions for creating a TreeAndValueMoveSelector object.
-
-The TreeAndValueMoveSelector is a player that uses a tree-based approach to select moves in a game. It evaluates the
-game tree using a node evaluator and selects moves based on a set of criteria defined by the node selector. The player
-uses a stopping criterion to determine when to stop the search and a recommender rule to recommend a move after
-exploration.
-
-This module also provides functions for creating the necessary components of the TreeAndValueMoveSelector, such as the
-node evaluator, node selector, tree factory, and tree manager.
-
+Module for creating Tree and Value Branch Selector objects.
 """
 
 from dataclasses import dataclass
@@ -49,7 +40,7 @@ TREE_AND_VALUE_LITERAL_STRING: Literal["TreeAndValue"] = "TreeAndValue"
 @dataclass
 class TreeAndValuePlayerArgs:
     """
-    Data class for the arguments of a TreeAndValueMoveSelector.
+    Dataclass for Tree and Value Player Arguments.
     """
 
     node_selector: node_selector_m.AllNodeSelectorArgs
@@ -149,13 +140,15 @@ def create_tree_and_value_branch_selector_with_tree_eval_factory[StateT: TurnSta
         index_updater=search_factory.create_node_index_updater(),
     )
 
-    tree_move_selector: TreeAndValueBranchSelector[StateT] = TreeAndValueBranchSelector(
-        tree_manager=tree_manager,
-        random_generator=random_generator,
-        tree_factory=tree_factory,
-        node_selector_create=search_factory.create_node_selector_factory(),
-        stopping_criterion_args=args.stopping_criterion,
-        recommend_move_after_exploration=args.recommender_rule,
-        queue_progress_player=queue_progress_player,
+    tree_branch_selector: TreeAndValueBranchSelector[StateT] = (
+        TreeAndValueBranchSelector(
+            tree_manager=tree_manager,
+            random_generator=random_generator,
+            tree_factory=tree_factory,
+            node_selector_create=search_factory.create_node_selector_factory(),
+            stopping_criterion_args=args.stopping_criterion,
+            recommend_branch_after_exploration=args.recommender_rule,
+            queue_progress_player=queue_progress_player,
+        )
     )
-    return tree_move_selector
+    return tree_branch_selector

{algorhino_anemone-0.1.1 → algorhino_anemone-0.1.3}/src/anemone/indices/index_manager/node_exploration_manager.py

@@ -71,7 +71,7 @@ class NodeExplorationIndexManager(Protocol):
         Args:
             child_node (AlgorithmNode): The child node to update.
             parent_node (AlgorithmNode): The parent node of the child node.
-            tree (trees.ValueTree): The tree containing the nodes.
+            tree (Tree): The tree containing the nodes.
             child_rank (int): The rank of the child node among its siblings.
         """
         ...
@@ -116,7 +116,7 @@ class NullNodeExplorationIndexManager(NodeExplorationIndexManager):
         Args:
             child_node (AlgorithmNode): The child node to update.
             parent_node (AlgorithmNode): The parent node of the child node.
-            tree (trees.ValueTree): The tree containing the nodes.
+            tree (Tree): The tree containing the nodes.
             child_rank (int): The rank of the child node among its siblings.
         """
         raise NotImplementedError("should not be raised")
@@ -164,7 +164,7 @@ class UpdateIndexGlobalMinChange:
         Args:
             child_node (AlgorithmNode): The child node to update.
             parent_node (AlgorithmNode): The parent node of the child node.
-            tree (trees.ValueTree): The tree containing the nodes.
+            tree (Tree): The tree containing the nodes.
             child_rank (int): The rank of the child node among its siblings.
         """
 
@@ -261,7 +261,7 @@ class UpdateIndexZipfFactoredProba:
         Args:
             child_node (AlgorithmNode): The child node to update.
             parent_node (AlgorithmNode): The parent node of the child node.
-            tree (trees.ValueTree): The tree containing the nodes.
+            tree (Tree): The tree containing the nodes.
             child_rank (int): The rank of the child node among its siblings.
         """
         _ = parent_node
@@ -347,7 +347,7 @@ class UpdateIndexLocalMinChange:
         Args:
             child_node (AlgorithmNode): The child node to update.
             parent_node (AlgorithmNode): The parent node of the child node.
-            tree (trees.ValueTree): The tree containing the nodes.
+            tree (Tree): The tree containing the nodes.
             child_rank (int): The rank of the child node among its siblings.
         """
 
@@ -492,10 +492,9 @@ def update_all_indices[NodeT: AlgorithmNode[Any]](
         # todo how are we sure that the hm comes in order?
         parent_node: NodeT
         for parent_node in tree_nodes[tree_depth].values():
-            # for child_node in parent_node.moves_children.values():
-            move_rank: int
+            branch_rank: int
             branch: BranchKey
-            for move_rank, branch in enumerate(
+            for branch_rank, branch in enumerate(
                 parent_node.tree_evaluation.branches_sorted_by_value_
             ):
                 child_node = parent_node.branches_children[branch]
@@ -511,7 +510,7 @@ def update_all_indices[NodeT: AlgorithmNode[Any]](
                 index_manager.update_node_indices(
                     child_node=child_node,
                     tree=tree,
-                    child_rank=move_rank,
+                    child_rank=branch_rank,
                     parent_node=parent_node,
                     parent_node_exploration_index_data=parent_node.exploration_index_data,
                     child_node_exploration_index_data=child_node.exploration_index_data,
@@ -529,17 +528,17 @@ def print_all_indices[NodeT: AlgorithmNode[Any]](
     Prints the exploration indices of all nodes in the given tree.
 
     Args:
-        tree (trees.ValueTree): The tree containing the nodes.
+        tree (Tree): The tree containing the nodes.
 
     Returns:
         None
     """
     tree_nodes: RangedDescendants[NodeT] = tree.descendants
 
-    half_move: int
-    for half_move in tree_nodes:
+    tree_depth: TreeDepth
+    for tree_depth in tree_nodes:
         # todo how are we sure that the hm comes in order?
-        for parent_node in tree_nodes[half_move].values():
+        for parent_node in tree_nodes[tree_depth].values():
             assert isinstance(parent_node, AlgorithmNode)
             if parent_node.exploration_index_data is not None:
                 print(

{algorhino_anemone-0.1.1 → algorhino_anemone-0.1.3}/src/anemone/node_evaluation/node_direct_evaluation/node_direct_evaluator.py

@@ -1,22 +1,5 @@
 """
-This module contains the implementation of the NodeEvaluator class, which is responsible for evaluating the value of
- nodes in a tree-based move selector.
-
-The NodeEvaluator class wraps a board evaluator and a syzygy table to provide more complex evaluations of chess
- positions. It handles queries for evaluating nodes and manages obvious over events.
-
-Classes:
-- NodeEvaluator: Wrapping node evaluator with syzygy and obvious over event.
-
-Enums:
-- NodeEvaluatorTypes: Types of node evaluators.
-
-Constants:
-- DISCOUNT: Discount factor used in the evaluation.
-
-Functions:
-- None
-
+Module for evaluating algorithm nodes directly using a master state evaluator.
 """
 
 from enum import Enum
@@ -116,10 +99,7 @@ class NodeDirectEvaluator[StateT: State = State]:
         master_state_evaluator: MasterStateEvaluator,
     ) -> None:
         """
-        Initializes a NodeEvaluator object.
-
-        Args:
-            state_evaluator (MasterStateEvaluator): The state evaluator used to evaluate the chess state.
+        Initializes a new instance of the NodeEvaluator class.
         """
         self.master_state_evaluator = master_state_evaluator
 

{algorhino_anemone-0.1.1 → algorhino_anemone-0.1.3}/src/anemone/node_evaluation/node_tree_evaluation/node_minmax_evaluation.py

@@ -21,12 +21,12 @@ from random import choice
 from typing import Any, Protocol, Self, runtime_checkable
 
 from valanga import (
-    BoardEvaluation,
     BranchKey,
     Color,
     FloatyStateEvaluation,
     ForcedOutcome,
     OverEvent,
+    StateEvaluation,
     TurnState,
 )
 
@@ -874,8 +874,8 @@ class NodeMinmaxEvaluation[
                     best_branches.append(branch_key)
         return best_branches
 
-    def evaluate(self) -> BoardEvaluation:
-        """Build a BoardEvaluation from current minmax state."""
+    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.1 → algorhino_anemone-0.1.3}/src/anemone/node_evaluation/node_tree_evaluation/node_tree_evaluation.py

@@ -1,10 +1,10 @@
 from typing import TYPE_CHECKING, Protocol, Self
 
 from valanga import (
-    BoardEvaluation,
     BranchKey,
     OverEvent,
     State,
+    StateEvaluation,
 )
 
 type BranchSortValue = tuple[float, int, int]
@@ -90,8 +90,8 @@ class NodeTreeEvaluation[StateT: State = State](Protocol):
         """Update terminal state based on updated branches."""
         ...
 
-    def evaluate(self) -> BoardEvaluation:
-        """Return a board evaluation for this node."""
+    def evaluate(self) -> StateEvaluation:
+        """Return a state evaluation for this node."""
         ...
 
     def description_tree_visualizer_branch(self, child: "ITreeNode[StateT]") -> str:

{algorhino_anemone-0.1.1 → algorhino_anemone-0.1.3}/src/anemone/node_factory/__init__.py

@@ -1,11 +1,11 @@
 """
-This module provides the node factory classes for creating tree nodes in the move selector algorithm.
+This module provides the node factory classes for creating tree nodes in the branch selector algorithm.
 
 The available classes in this module are:
 - TreeNodeFactory: A base class for creating tree nodes.
 - Base: A base class for the node factory classes.
 - create_node_factory: A function for creating a node factory.
-- AlgorithmNodeFactory: A node factory class for the move selector algorithm.
+- AlgorithmNodeFactory: A node factory class for the branch selector algorithm.
 """
 
 from .algorithm_node_factory import AlgorithmNodeFactory

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

@@ -33,7 +33,7 @@ if TYPE_CHECKING:
 @dataclass
 class AlgorithmNodeFactory[StateT: State = State]:
     """
-    The classe creating Algorithm Nodes
+    Factory for building AlgorithmNode instances.
     """
 
     tree_node_factory: TreeNodeFactory[AlgorithmNode[StateT], StateT]
@@ -92,18 +92,18 @@ class AlgorithmNodeFactory[StateT: State = State]:
         modifications: StateModifications | None,
     ) -> AlgorithmNode[StateT]:
         """
-        Creates an AlgorithmNode object.
+        Create an AlgorithmNode object.
 
         Args:
-            branch_from_parent (BranchKey | None): the move that led to the node from the parent node
-            state: The state object.
-            tree_depth: The tree depth.
-            count: The count.
+            branch_from_parent: The branch key leading from the parent node.
+            state: The state object for the node.
+            tree_depth: The depth of the node in the tree.
+            count: The node identifier.
             parent_node: The parent node object.
-            modifications: The board modifications object.
+            modifications: The state modifications object.
 
         Returns:
-            An AlgorithmNode object.
+            The created AlgorithmNode.
 
         """
         tree_node: TreeNode[AlgorithmNode[StateT], StateT] = (

{algorhino_anemone-0.1.1 → algorhino_anemone-0.1.3}/src/anemone/node_factory/base.py

@@ -44,17 +44,18 @@ class TreeNodeFactory[T: ITreeNode[Any] = ITreeNode[Any], StateT: State = State]
         modifications: StateModifications | None = None,
     ) -> TreeNode[T, StateT]:
         """
-        Creates a new TreeNode object.
+        Create a new TreeNode object.
 
         Args:
-            board (boards.BoardChi): The current board state.
-            half_move (int): The half-move count.
-            count (int): The ID of the new node.
-            parent_node (ITreeNode | None): The parent node of the new node.
-            move_from_parent (chess.Move | None): The move that leads to the new node.
+            state: The current state for the node.
+            tree_depth: The tree depth for the new node.
+            count: The ID of the new node.
+            parent_node: The parent node of the new node.
+            branch_from_parent: The branch key from the parent node.
+            modifications: The state modifications, if any.
 
         Returns:
-            TreeNode: The newly created TreeNode object.
+            The newly created TreeNode object.
         """
 
         # TreeNode doesn't use modifications (it's a pure data container).

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

@@ -36,14 +36,16 @@ def create(
     Creation of a node selector
     """
 
-    node_move_opening_selector: NodeSelector
+    node_branch_opening_selector: NodeSelector
 
     match args.type:
         case NodeSelectorType.UNIFORM:
-            node_move_opening_selector = Uniform(opening_instructor=opening_instructor)
+            node_branch_opening_selector = Uniform(
+                opening_instructor=opening_instructor
+            )
         case NodeSelectorType.RECUR_ZIPF_BASE:
             assert isinstance(args, RecurZipfBaseArgs)
-            node_move_opening_selector = RecurZipfBase(
+            node_branch_opening_selector = RecurZipfBase(
                 args=args,
                 random_generator=random_generator,
                 opening_instructor=opening_instructor,
@@ -51,7 +53,7 @@ def create(
 
         case NodeSelectorType.SEQUOOL:
             assert isinstance(args, SequoolArgs)
-            node_move_opening_selector = create_sequool(
+            node_branch_opening_selector = create_sequool(
                 opening_instructor=opening_instructor,
                 random_generator=random_generator,
                 args=args,
@@ -62,4 +64,4 @@ def create(
                 f"node selector construction: can not find {args.type}  {args} in file {__name__}"
             )
 
-    return node_move_opening_selector
+    return node_branch_opening_selector

{algorhino_anemone-0.1.1 → algorhino_anemone-0.1.3}/src/anemone/node_selector/node_selector.py

@@ -32,13 +32,13 @@ class NodeSelector[NodeT: AlgorithmNode[Any] = AlgorithmNode[Any]](Protocol):
         latest_tree_expansions: "tree_man.TreeExpansions[NodeT]",
     ) -> OpeningInstructions[NodeT]:
         """
-        Selects a node from the given tree and returns the instructions to move to an open position.
+        Selects a node from the given tree and returns the instructions to open a branch.
 
         Args:
             tree: The tree containing the nodes.
             latest_tree_expansions: The latest expansions of the tree.
 
         Returns:
-            OpeningInstructions: The instructions to move to an open position.
+            OpeningInstructions: The instructions to open a branch.
         """
         raise NotImplementedError()

{algorhino_anemone-0.1.1 → algorhino_anemone-0.1.3}/src/anemone/node_selector/opening_instructions.py

@@ -1,5 +1,5 @@
 """
-This module contains classes and functions related to opening instructions in a chess game.
+This module contains classes and functions related to opening instructions in a game tree.
 """
 
 from dataclasses import dataclass
@@ -11,8 +11,8 @@ from valanga import BranchKey
 
 from anemone import nodes
 from anemone.nodes.utils import (
+    a_branch_key_sequence_from_root,
     a_branch_str_sequence_from_root,
-    a_move_key_sequence_from_root,
 )
 
 type OpeningInstructionKey = tuple[int, BranchKey]
@@ -33,7 +33,7 @@ class OpeningInstruction[NodeT: nodes.ITreeNode[Any] = nodes.ITreeNode[Any]]:
         """
         print(
             f"OpeningInstruction: node_to_open {self.node_to_open.id} at hm {self.node_to_open.tree_depth} {self.node_to_open.state}| "
-            f"a path from root to node_to_open is {a_move_key_sequence_from_root(self.node_to_open)} {a_branch_str_sequence_from_root(self.node_to_open)}| "
+            f"a path from root to node_to_open is {a_branch_key_sequence_from_root(self.node_to_open)} {a_branch_str_sequence_from_root(self.node_to_open)}| "
             f"self.branch {self.branch} {self.node_to_open.state.branch_name_from_key(self.branch)}"
         )
 
@@ -76,7 +76,7 @@ class OpeningInstructions[NodeT: nodes.ITreeNode[Any] = nodes.ITreeNode[Any]]:
             key: The key for the opening instruction.
             value: The opening instruction.
         """
-        # key is supposed to be a tuple with (node_to_open,  move_to_play)
+        # key is supposed to be a tuple with (node_to_open, branch)
         self.batch[key] = value
 
     def __getitem__(self, key: OpeningInstructionKey) -> OpeningInstruction[NodeT]:
@@ -177,10 +177,10 @@ def create_instructions_to_open_all_branches[NodeT: nodes.ITreeNode[Any]](
     branches_to_play: list[BranchKey], node_to_open: NodeT
 ) -> OpeningInstructions[NodeT]:
     """
-    Creates opening instructions for all possible moves to play from a given node.
+    Create opening instructions for all possible branches from a given node.
 
     Args:
-        moves_to_play: A list of chess moves.
+        branches_to_play: The branch keys to open.
         node_to_open: The node to open.
 
     Returns:
@@ -195,7 +195,6 @@ def create_instructions_to_open_all_branches[NodeT: nodes.ITreeNode[Any]](
         opening_instructions_batch[(node_to_open.id, branch_to_play)] = (
             OpeningInstruction(node_to_open=node_to_open, branch=branch_to_play)
         )
-    #  node_to_open.non_opened_legal_moves.add(move_to_play)
     return opening_instructions_batch
 
 
@@ -233,7 +232,7 @@ class OpeningInstructor:
             node_to_open: The node to open.
 
         Returns:
-            A list of chess moves.
+            A list of branch keys.
         """
         if self.opening_type == OpeningType.ALL_CHILDREN:
             node_to_open.all_branches_generated = True
@@ -242,7 +241,7 @@ class OpeningInstructor:
             # this shuffling add randomness to the playing style
             # (it stills depends on the random seed, but if random seed varies then the behavior will be more random)
             # DEACTIVATED ATM BECAUSE I DO NOT UNDERSTAND or FORGOT THE USE CASE: MAYBE DEAD SINCE SEED SYSTEM CHANGED
-            # self.random_generator.shuffle(moves_to_play)
+            # self.random_generator.shuffle(branches_to_play)
 
         else:
             raise NotImplementedError("Hello-la")

{algorhino_anemone-0.1.1 → algorhino_anemone-0.1.3}/src/anemone/node_selector/recurzipf/recur_zipf_base.py

@@ -1,7 +1,7 @@
 """
-This module contains the implementation of the RecurZipfBase class, which is a node selector for a move selector tree.
+This module contains the implementation of the RecurZipfBase class, which is a node selector for a branch selector tree.
 
-The RecurZipfBase class is responsible for selecting the next node to explore in a move selector tree based on the RecurZipf algorithm.
+The RecurZipfBase class is responsible for selecting the next node to explore in a branch selector tree based on the RecurZipf algorithm.
 
 Classes:
 - RecurZipfBase: The RecurZipfBase Node selector.
@@ -32,7 +32,7 @@ class RecurZipfBaseArgs:
     Arguments for the RecurZipfBase node selector.
 
     Attributes:
-        move_explorer_priority (SamplingPriorities): The priority for move exploration.
+        branch_explorer_priority (SamplingPriorities): The priority for branch exploration.
     """
 
     type: Literal[NodeSelectorType.RECUR_ZIPF_BASE]
@@ -71,14 +71,14 @@ class RecurZipfBase[NodeT: AlgorithmNode[Any] = AlgorithmNode[Any]]:
         latest_tree_expansions: "tree_man.TreeExpansions[NodeT]",
     ) -> OpeningInstructions[NodeT]:
         """
-        Chooses the next node to explore and the move to open.
+        Chooses the next node to explore and the branch to open.
 
         Args:
-        - tree (trees.Tree[AlgorithmNode]): The move selector tree.
+        - tree (trees.Tree[AlgorithmNode]): The branch selector tree.
         - latest_tree_expansions (tree_man.TreeExpansions): The latest tree expansions.
 
         Returns:
-        - OpeningInstructions: The instructions for opening the selected move.
+        - OpeningInstructions: The instructions for opening the selected branch.
 
         """
         # todo maybe proportions and proportions can be valuesorted dict with smart updates