algorhino-anemone 0.1.1__py3-none-any.whl → 0.1.2__py3-none-any.whl

{algorhino_anemone-0.1.1.dist-info → algorhino_anemone-0.1.2.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: algorhino-anemone
-Version: 0.1.1
+Version: 0.1.2
 Summary: anemone searches trees
 Author-email: Victor Gabillon <victorgabillon@gmail.com>
 License-Expression: GPL-3.0-only
@@ -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.dist-info → algorhino_anemone-0.1.2.dist-info}/RECORD

@@ -1,14 +1,14 @@
-algorhino_anemone-0.1.1.dist-info/licenses/LICENSE,sha256=OXLcl0T2SZ8Pmy2_dmlvKuetivmyPd5m1q-Gyd-zaYY,35149
+algorhino_anemone-0.1.2.dist-info/licenses/LICENSE,sha256=OXLcl0T2SZ8Pmy2_dmlvKuetivmyPd5m1q-Gyd-zaYY,35149
 anemone/__init__.py,sha256=iKX9OGJxbyIqe9Fy-xxZY6sdH7WcG4RFyPR0WBai7Ls,942
 anemone/basics.py,sha256=jMKY9mFLbbMZ_xNvtBVlbZI_vP15rg2tUGUf9ZQ-9tw,1023
-anemone/factory.py,sha256=xEE5Nx-I9rs-VyhPHQcGTMKSjbVYKYJCO75s5szLZIg,6544
+anemone/factory.py,sha256=Nmx84UrSqED3R9891XoBTX56jKlINvZn4DLYduSbHgo,6020
 anemone/state_transition.py,sha256=fxvHZOYRtWV5ExXRIoehdRg9qV6zhgiE5uiCeOc80Dc,1418
-anemone/tree_and_value_branch_selector.py,sha256=AicjYcI1M_zrNZK4ZzYGcHjyCXGATkXGn6vn5bjdJ6s,4099
-anemone/tree_exploration.py,sha256=718qW-mkHp2-LuMfRLHZoi8Oul_3Aq6kzTr31k_xBII,10881
+anemone/tree_and_value_branch_selector.py,sha256=bervTIx03h79g-Qu1npGpcA5YlSzZKRk0xA86l69jX4,3480
+anemone/tree_exploration.py,sha256=Fb6mNw0UxbaaFtbBAhxjjKJQbClbRPzhrEG2pWHQkjY,10378
 anemone/indices/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 anemone/indices/index_manager/__init__.py,sha256=P49ofGrnP_Nfmv63Rg_-Zvwn5NFvFFDQ3MD3GMeWNWw,515
 anemone/indices/index_manager/factory.py,sha256=Fti6PTnLOEg0g5cqqRBMsmGGNZw6uVFiKpjv0B766qE,1783
-anemone/indices/index_manager/node_exploration_manager.py,sha256=tcXDgaA7Kne62eOa-RCBTlLx-EYXT-2uTgo0IBNGEbM,21492
+anemone/indices/index_manager/node_exploration_manager.py,sha256=07MCL-hJxazffOGPDbDkpdR0PHvtSRudbazrl2jzYdQ,21372
 anemone/indices/node_indices/__init__.py,sha256=CHE89gUoI7pPtsnlg5WRUMEiFnFbnLQPy6apu06lVcU,774
 anemone/indices/node_indices/factory.py,sha256=3jQA9Z4RNSD6oX9PlrMppGm7Q0v-CE2zQ2BGjp74Mc0,4045
 anemone/indices/node_indices/index_data.py,sha256=EFa3gktB-EqCtGEPOH-4hDb8t0G6DrFGCJITr-Jlu20,5418
@@ -17,66 +17,66 @@ 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=eHrlyDpwOWpa-7eh8jpWb6-aVoLoDhOLcNJubf40obU,6390
+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=npqy9r7ZKHGMJsDhSY7bZZbRvakwoTyABpwQOVTQ-ww,35126
 anemone/node_evaluation/node_tree_evaluation/node_tree_evaluation.py,sha256=-fiuTO0nWKKiKWAdgFi-L8kKxIjH0A_0yeUKrp4fk34,4260
 anemone/node_evaluation/node_tree_evaluation/node_tree_evaluation_factory.py,sha256=UY1glqflqMOqOPAHhtuzJ8QhGOp55Y9InqdhCMt9KJ8,1279
-anemone/node_factory/__init__.py,sha256=1ijzc7oIpsEMdJQ1jkqfaonhyvPjeyKv0nDe8tCXRAQ,549
-anemone/node_factory/algorithm_node_factory.py,sha256=COu6MiSyW-9M6pDZhJFAuWbp1E-HH9etm90VCoR5r0E,3919
-anemone/node_factory/base.py,sha256=2utUE5s-KbMtzfyiW3BfzTBnH_Qg4H5Oeosw0ERYJRQ,2132
+anemone/node_factory/__init__.py,sha256=qhbX58hu8-TdFof5zo3ibfPFvF-OWNSgJf3RDMrtyTQ,553
+anemone/node_factory/algorithm_node_factory.py,sha256=eHsyZ6_no8i9ACfZV8VSKefV3kXiQHvdMNEighDn8Lc,3947
+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
-anemone/node_selector/factory.py,sha256=XfTU7M-XiUsxPV3NpGjeiat7Px7Atzk5EMj8D3iV48k,1829
-anemone/node_selector/node_selector.py,sha256=olAyA1_at7VkepZ0hI5S-zfmJAJOVk32XnMKnvHMX7w,1182
+anemone/node_selector/factory.py,sha256=KktiVmsMEsStquWcZtAmfEf472DgT9oSA5sP9jfl4gs,1869
+anemone/node_selector/node_selector.py,sha256=KzE5BQpB2nPKJ4V2ZYnS4NYZE1fFmwWK8W9-9QPBuY8,1160
 anemone/node_selector/node_selector_args.py,sha256=G0mDPXEOF6oYXqt1176srKrRwDoy31wN8gu9Hzy_8ic,555
 anemone/node_selector/node_selector_types.py,sha256=827M2u8D_yBSdufvV3ufjGtj8r1aw4Xcdb7NXYq_T7M,329
 anemone/node_selector/notations_and_statics.py,sha256=leB0s6yVGeymMWcbbdO5ViDInChLAgGw59-9Ltc3Urw,2653
-anemone/node_selector/opening_instructions.py,sha256=B3ayjIgBjiT-8ZAQVQyYIJH66SBm1DElQoJtwY5h6Xc,8187
+anemone/node_selector/opening_instructions.py,sha256=OPfoTMMRVPPMQLSvFbzrVf_p5DVwZTW4DQMxnE-OgfU,8124
 anemone/node_selector/recurzipf/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-anemone/node_selector/recurzipf/recur_zipf_base.py,sha256=hdOHAnYQVSlhvuQSGaqHd79j5X8qeJrnzVU_yo8OBCo,5193
+anemone/node_selector/recurzipf/recur_zipf_base.py,sha256=9_khpUjNsxWzR6NBZRUkqiwzFv2x-llAZBE80oJACTs,5207
 anemone/node_selector/sequool/__init__.py,sha256=k_YXvShw64GNIAWjZqdNPkUsdCMwPI_RSAmv4I2xxuk,485
-anemone/node_selector/sequool/factory.py,sha256=jZqgUs9AR1iU1RI4Jc2OiqYsr_kGnnTabk4WterrtNU,3416
-anemone/node_selector/sequool/sequool.py,sha256=qLwGDTlgC8SgD5BrUvQTpQ5nkfxwop5ceKDcDoiOLPo,12649
+anemone/node_selector/sequool/factory.py,sha256=owO65DnmiBTR0cuprzfraqvHx5LMg-I_Vcqd55fQwr4,3072
+anemone/node_selector/sequool/sequool.py,sha256=NSGwIQk8KxD-TSzdw2LvFIOPUlNfQX8OOE_zXfoByqc,11531
 anemone/node_selector/uniform/__init__.py,sha256=fRGC0FL_fnXXeNoj3QeMQmNoESrFfSDaiHp-zHpF_zw,366
-anemone/node_selector/uniform/uniform.py,sha256=9nGsG8NRgAKwYH-VBywUEAO6lDsgPRX84HkFzyB49TU,3710
-anemone/nodes/__init__.py,sha256=yciGi5-PTnXXyuAtf2WfOAkK3_FsFxskfGLjqzHF0zc,384
-anemone/nodes/itree_node.py,sha256=tMmH6fQtXH01DRluyOpRM44n4_1-sndWBKMFsUf-Zt8,3564
-anemone/nodes/tree_node.py,sha256=_n1dHgII40gtRBYiHvB5UDgQykSSsfLGSdb5IX-67Yc,8333
-anemone/nodes/tree_traversal.py,sha256=du_NuWpRX2Qi-9w2WTeos4lEHHj-lrN3yUbdp9tEA2U,3955
-anemone/nodes/utils.py,sha256=KvXQcUcTWx8GvWmhykimgt9m-8WTKoALrnG-3WgNx80,5067
+anemone/node_selector/uniform/uniform.py,sha256=Frxyik7Vx2-vF0CcMWclPqymj7XEl08nILtMv4Wjxj8,3745
+anemone/nodes/__init__.py,sha256=XWTr9wZGGX9XHp-bw3zjKfCVdKnNEgVGL1wFWW-ozzI,393
+anemone/nodes/itree_node.py,sha256=ywQIvF8LIihf-7p8OgzMjfTg6S39GRbY3u1b4Ka4JoM,3536
+anemone/nodes/tree_node.py,sha256=DxsFJw5Y8vromLu-oZL8D5F9aLME4FjI1d8XF9e3Eq8,7728
+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=VgUzzouLWO4Pcx3yglAzngF6sJ5VAf3PyZmsm8-tqRU,6501
+anemone/nodes/algorithm_node/algorithm_node.py,sha256=VzZsLZ0KmRt92me1U_mwATLu_uyVVafTOA-wtugtyms,6517
 anemone/progress_monitor/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-anemone/progress_monitor/progress_monitor.py,sha256=oK0gckMoFqQaOrOwybtW58tcBQz7PqkKV0Lu1V-gXpw,10821
+anemone/progress_monitor/progress_monitor.py,sha256=ExuvwOntZBwrBjIbNr8ZpeCd2F5s21rsX74FFog7gqY,10896
 anemone/recommender_rule/__init__.py,sha256=9K73T0bkpvHg0IsQc1OW8QgsUhCNYq9ceqPMkwdqE8c,347
-anemone/recommender_rule/recommender_rule.py,sha256=w6Y83j_LlnBx0iz25_OGFRZ1VnjlUXKZjlQfIjCRu5s,4594
+anemone/recommender_rule/recommender_rule.py,sha256=Ck34nf3fw6FZOi-1HR_XJpuEggcCTxGoCJE_ueUNVO4,4587
 anemone/search_factory/__init__.py,sha256=ToU88Fa1lBBdf2AYTJ2PNVwWzi5Hzh-78-WOxClVkN4,619
 anemone/search_factory/search_factory.py,sha256=vCkxJk4cs6i6jjrTrUAsRBtp38N84j_uhyvpYIODoG4,6757
 anemone/tree_manager/__init__.py,sha256=D3j8emzRNF1fkPTpNUPsXbqAzMM9SyI3Ty_4Y_b2Tas,962
-anemone/tree_manager/algorithm_node_tree_manager.py,sha256=s4Iojk9u1fsNso_wH5xMYxHmGIFneLmQN9As2bfViT4,8811
+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=qq_8EvRaVpgzqI4W3jvI8VJyOnknYgxQuz8yv_pUVkE,4285
-anemone/tree_manager/tree_manager.py,sha256=u-4DsgDxu_7uPUTbWYXYLr9_7NGyPJ25bSYXC2RUc-E,8312
+anemone/tree_manager/tree_expander.py,sha256=LpKFDKsOrW0cq09m11aXQZV82s10iyiizQafRBHQ7ts,4041
+anemone/tree_manager/tree_manager.py,sha256=n0ck4Z-i0WIiRI5RkqrhnYNFD88B9Uw1cU0Xa_q0LAE,8281
 anemone/trees/__init__.py,sha256=FtX6ZDfZI7JDjv6IAgKRVytJmafL3Vod3RF7L-bDTWc,269
-anemone/trees/descendants.py,sha256=KaEyesB1D5Rxpfl-LrH6pcWM0HV5zkv-2_2GQx_bjX0,27429
+anemone/trees/descendants.py,sha256=bq8GrckFsPpteWr68og4a5KA94hYWn-qrDzC6dDfOKw,27249
 anemone/trees/factory.py,sha256=GIZcojZzxl5VG6lEpxxF9PV8VZnS-c18xWxg0dza0r8,2180
-anemone/trees/tree.py,sha256=90ElKy10ev0YRKwyWo0Ck49WA2iqrVQjM44CQdsm8Sg,2201
-anemone/trees/tree_visualization.py,sha256=gLWoADmuy9MumNR4KLbeWvz3YBU2-bfYO8tvB_ih9FQ,4736
-anemone/updates/__init__.py,sha256=YZsQ8c7RcjC8aHTmty5BiEWfo4_D2GDxZ2_BoyjLJnI,1111
+anemone/trees/tree.py,sha256=VsoW_RsicCm47VZuK4riU_OsdAoFtW_Rjrpitmemalk,1995
+anemone/trees/tree_visualization.py,sha256=i3HNt9T5Wc82CVD0NY6rcwZkcaHCQJx8VAq-zArzanc,4665
+anemone/updates/__init__.py,sha256=9WPDhd8DkAkpe5P9sOE4PrX7IbevFVybBEuv0Hus8UA,1113
 anemone/updates/algorithm_node_updater.py,sha256=zIoqIRhQNcY5P2JoZ_EM_GB5TrCrWZyrGiMLqEuxStM,5865
 anemone/updates/factory.py,sha256=OuN6cHp9KwSL9bbIEoaJgikp_gX4tU7AjWKasbgttGE,1207
-anemone/updates/index_block.py,sha256=3aVUwcVhwHYm1y2FWGULgMqaw_2FhXDpLue_kbDsLxw,3104
+anemone/updates/index_block.py,sha256=nsUHaSxuwzhA1s3IOMx_DTNIML4pnLqUlB4HFPXbHVI,3122
 anemone/updates/index_updater.py,sha256=aFxTtVwLfSwl089_4Sxsce8DDD8NERaUOdj_RqyJUSI,3638
-anemone/updates/minmax_evaluation_updater.py,sha256=sABx1CzXArtxFXwN1Rkq042qKUDVBphpJ6oO3WUh1OQ,4058
-anemone/updates/updates_file.py,sha256=QQRWbYmET2KyWyg_8Qq-WC4jR4FPclWPh7vc01kexdM,10092
-anemone/updates/value_block.py,sha256=TSo7RNmlCxrQpjPIKHNRGU9IfzKE3FA5BCptwwOujAs,4667
+anemone/updates/minmax_evaluation_updater.py,sha256=GjOgk5EIfOWAW9oLli34-6qfm078bnIE1PJnTkR6s0A,4073
+anemone/updates/updates_file.py,sha256=e26VOk-PCP-GHJJ0dbS4V0DYeJYwNwCvfUotEIqZ5XU,10094
+anemone/updates/value_block.py,sha256=wRl0z8_d1J4mODOSeGsOh3ICo7DtVK7wfDaJibLhjDQ,4687
 anemone/utils/comparable.py,sha256=eTD81347Qv1dkGR4rD0ep2tbbBR2Mk_4JXZkkYTxiNw,945
 anemone/utils/dataclass.py,sha256=X77ilEUTIVUudfISYlm7rq3tptqUwdLBOzLDy-gL6t8,1781
-anemone/utils/dict_of_numbered_dict_with_pointer_on_max.py,sha256=vVbMWtQavI23zYJ4AuletvSaHrLDfOgvmNPTGolWjVk,4154
+anemone/utils/dict_of_numbered_dict_with_pointer_on_max.py,sha256=s5Z-O5mBwJUh4Pv0TD531Q73BqHj9djQUXERYUQ2EnE,4128
 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.1.dist-info/METADATA,sha256=KTyN1GWK_byEBRVXThAN4PTgewAYl5Knu4HwZrMTap0,5669
-algorhino_anemone-0.1.1.dist-info/WHEEL,sha256=_zCd3N1l69ArxyTb8rzEoP9TpbYXkqRFSNOD5OuxnTs,91
-algorhino_anemone-0.1.1.dist-info/top_level.txt,sha256=G1vbB-vAevQVde3UZ5X1_Ysy1_6sJDEueHRi2qcDgrY,8
-algorhino_anemone-0.1.1.dist-info/RECORD,,
+algorhino_anemone-0.1.2.dist-info/METADATA,sha256=BxqVitC0TFU3tWcoxkf_aSsdefABd1flA9_uYBKkgdM,5677
+algorhino_anemone-0.1.2.dist-info/WHEEL,sha256=_zCd3N1l69ArxyTb8rzEoP9TpbYXkqRFSNOD5OuxnTs,91
+algorhino_anemone-0.1.2.dist-info/top_level.txt,sha256=G1vbB-vAevQVde3UZ5X1_Ysy1_6sJDEueHRi2qcDgrY,8
+algorhino_anemone-0.1.2.dist-info/RECORD,,

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

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(

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
 

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

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] = (

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).

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

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()

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")

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

anemone/node_selector/sequool/factory.py

@@ -31,18 +31,13 @@ from .sequool import (
 @dataclass
 class SequoolArgs:
     """
-    Arguments for the Sequool node selector.
-
-    Attributes:
-        recursive_selection_on_all_nodes (bool): Flag indicating whether to perform recursive selection on all nodes.
-        random_depth_pick (bool): Flag indicating whether to randomly pick a depth for selection.
-        consider_all_lesser_half_move (bool): Flag indicating whether to consider all lesser half moves.
+    Dataclass for Sequool Arguments.
     """
 
     type: Literal[NodeSelectorType.SEQUOOL]
     recursive_selection_on_all_nodes: bool
     random_depth_pick: bool
-    consider_all_lesser_half_move: bool
+    consider_all_lesser_tree_depth: bool
 
 
 def create_sequool(
@@ -77,7 +72,7 @@ def create_sequool(
             consider_nodes_from_all_lesser_tree_depths_in_sub_stree
         )
     else:
-        if args.consider_all_lesser_half_move:
+        if args.consider_all_lesser_tree_depth:
             consider_nodes_from_all_lesser_tree_depths = partial(
                 consider_nodes_from_all_lesser_tree_depths_in_descendants,
                 descendants=all_nodes_not_opened,