algorhino-anemone 0.1.5__py3-none-any.whl → 0.1.6__py3-none-any.whl

{algorhino_anemone-0.1.5.dist-info → algorhino_anemone-0.1.6.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: algorhino-anemone
-Version: 0.1.5
+Version: 0.1.6
 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.6
+Requires-Dist: valanga>=0.1.7
 Requires-Dist: atomheart>=0.1.2
 Requires-Dist: rich
 Requires-Dist: sortedcollections>=2.1.0

{algorhino_anemone-0.1.5.dist-info → algorhino_anemone-0.1.6.dist-info}/RECORD

@@ -1,7 +1,7 @@
-algorhino_anemone-0.1.5.dist-info/licenses/LICENSE,sha256=OXLcl0T2SZ8Pmy2_dmlvKuetivmyPd5m1q-Gyd-zaYY,35149
+algorhino_anemone-0.1.6.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=6emk6_mjuGiufAYaP-pHxlfhHH1Cr8ZsUz4dAENSRDc,6050
+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_exploration.py,sha256=cg1iTp3j9p9jUNjm07ogbflX8VC15AV8GEhGz3g1YNU,10529
@@ -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=3seD9KOXotaCPw2ine2jao3WF4BMc_hDDHF7tbZQA4w,4070
+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.5.dist-info/METADATA,sha256=U4Ii16cqbK1gziuB4vmhye4AcCfKHZvNcyro1QsEW34,5691
-algorhino_anemone-0.1.5.dist-info/WHEEL,sha256=qELbo2s1Yzl39ZmrAibXA2jjPLUYfnVhUNTlyF1rq0Y,92
-algorhino_anemone-0.1.5.dist-info/top_level.txt,sha256=G1vbB-vAevQVde3UZ5X1_Ysy1_6sJDEueHRi2qcDgrY,8
-algorhino_anemone-0.1.5.dist-info/RECORD,,
+algorhino_anemone-0.1.6.dist-info/METADATA,sha256=NvUyWkJPOMg1ra_rUuXdj2RC57q04VaN_JvMP_zM7JA,5691
+algorhino_anemone-0.1.6.dist-info/WHEEL,sha256=qELbo2s1Yzl39ZmrAibXA2jjPLUYfnVhUNTlyF1rq0Y,92
+algorhino_anemone-0.1.6.dist-info/top_level.txt,sha256=G1vbB-vAevQVde3UZ5X1_Ysy1_6sJDEueHRi2qcDgrY,8
+algorhino_anemone-0.1.6.dist-info/RECORD,,

anemone/factory.py

@@ -7,7 +7,7 @@ from queue import Queue
 from random import Random
 from typing import Literal, Type
 
-from valanga import RepresentationFactory, TurnState
+from valanga import RepresentationFactory, StateModifications, TurnState
 from valanga.evaluator_types import EvaluatorInput
 
 from anemone import node_factory
@@ -57,7 +57,10 @@ def create_tree_and_value_branch_selector[StateT: TurnState](
     args: TreeAndValuePlayerArgs,
     random_generator: Random,
     master_state_evaluator: MasterStateEvaluator,
-    state_representation_factory: RepresentationFactory[StateT, EvaluatorInput] | None,
+    state_representation_factory: RepresentationFactory[
+        StateT, EvaluatorInput, StateModifications
+    ]
+    | None,
     queue_progress_player: Queue[IsDataclass] | None,
 ) -> TreeAndValueBranchSelector[StateT]:
     """Convenience constructor using the default minmax tree evaluation.
@@ -86,7 +89,10 @@ 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[StateT, EvaluatorInput] | None,
+    state_representation_factory: RepresentationFactory[
+        StateT, EvaluatorInput, StateModifications
+    ]
+    | None,
     node_tree_evaluation_factory: NodeTreeEvaluationFactory[StateT],
     queue_progress_player: Queue[IsDataclass] | None,
 ) -> TreeAndValueBranchSelector[StateT]:

anemone/node_factory/algorithm_node_factory.py

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