anemone

anemone is a Python library for tree search over valanga game states. It separates structural tree storage, runtime search state, node evaluation, exploration indices, and selector/opening logic so different search policies can share one coherent runtime.

Overview

The main architectural split is:

structure: TreeNode and ITreeNode
runtime: AlgorithmNode and TreeExploration
evaluation: direct evaluation plus backed-up tree evaluation
exploration: per-node exploration-index payloads and tree-wide recomputation
selection: selectors and opening instructions that decide what to expand next

Installation

pip install anemone

Optional extras:

pip install anemone[nn]
pip install anemone[debug]

Debug snapshot export and the debug browser's SVG rendering also require the system Graphviz executable (dot).

Getting started

The canonical public entry point is anemone.factory.create_search.

Use anemone.factory to build a runnable search runtime.
Treat anemone._runtime_assembly and anemone.search_factory as internal wiring layers behind that API.
Use TreeAndValueBranchSelector only when you want the higher-level one-shot recommendation wrapper instead of driving the runtime directly.

from random import Random

from anemone.factory import SearchArgs, create_search

# Domain-specific collaborators omitted for brevity:
# - YourStateType
# - your_dynamics
# - starting_state
# - your_evaluator
# - your_selector_args
# - your_opening_type
# - your_stopping_criterion
# - your_recommender_rule
args = SearchArgs(
    node_selector=your_selector_args,
    opening_type=your_opening_type,
    stopping_criterion=your_stopping_criterion,
    recommender_rule=your_recommender_rule,
)

runtime = create_search(
    state_type=YourStateType,
    dynamics=your_dynamics,
    starting_state=starting_state,
    args=args,
    random_generator=Random(0),
    master_state_value_evaluator=your_evaluator,
    state_representation_factory=None,
)

result = runtime.explore(Random(0))
print(result.branch_recommendation.recommended_name)

Core concepts

TreeNode: the concrete structural node storing state, depth, and links.
AlgorithmNode: the runtime wrapper that adds tree evaluation and exploration-index payloads.
direct_value: the immediate evaluator output for one node.
backed_up_value: the subtree-derived value propagated from children.
exploration index: optional per-node search-priority data recomputed across the tree by a configured strategy.

How it works

create_search(...) assembles the runtime, direct evaluator, selector factory, tree-evaluation factory, and tree manager.
The initial tree is created with a directly evaluated root node.
A selector chooses which node or branch to open next.
The tree manager expands the structure and creates any new runtime nodes.
Direct evaluation fills direct_value on newly created nodes.
Upward propagation recomputes backed_up_value, branch ordering, and principal variation.
Exploration-index payloads are refreshed for the next iteration.

Documentation

Metadata

Release files for algorhino-anemone 0.2.25

For a detailed explanation of source distributions (sdists) and built distributions (wheels), please see the package formats documentation.

Source distribution (sdist)

Source distribution for algorhino-anemone 0.2.25
File	Size	Uploaded
algorhino_anemone-0.2.25.tar.gz	435.4 kB	Sep 23, 2026	Details

Built distribution (wheel)

Table of built distributions (wheels) for algorhino-anemone 0.2.25
File	Interpreter	ABI	Platform	Reset
algorhino_anemone-0.2.25-py3-none-any.whl 430.0 kB Sep 23, 2026	Python 3	none	any	Details

Total release size: 865.4 kB

Release files / algorhino_anemone-0.2.25.tar.gz

Download URL	algorhino_anemone-0.2.25.tar.gz
Size	435.4 kB
Tags	Source
SHA-256 checksum How to use checksums	`5cacbf1fe0569d019c26548cf63f921bd7c9546b72e5556952c76666ce61146f`
BLAKE2b-256 checksum How to use checksums	`6eaf623d374c77c3bd4178a54199218a328e1c68081397a65041e59609465497`
Upload date	Sep 23, 2026
Uploaded using Trusted Publishing? What is trusted publishing?	Yes
Uploaded via	`twine/7.0.0 CPython/3.13.14`

Provenance

Provenance describes where a file came from. On PyPI, provenance is shared via attestations, which provide a verifiable record of the build or publishing details. View details, limitations and caveats.

Identity

Publishing platform: GitHub Actions
Publishing repository: github.com/victorgabillon/anemone
Publishing commit: github.com/victorgabillon/anemone/tree/d08d7530896687fc55e941fa318f49eabdd07cd5

Workflow

Publishing configuration: github.com/victorgabillon/anemone/blob/d08d7530896687fc55e941fa318f49eabdd07cd5/.github/workflows/release.yml
Publishing logs: github.com/victorgabillon/anemone/actions/runs/35823101992/attempts/1

Artifact

Subject: algorhino_anemone-0.2.25.tar.gz
SHA-256 checksum: 5cacbf1fe0569d019c26548cf63f921bd7c9546b72e5556952c76666ce61146f Verifying attestations

Release files / algorhino_anemone-0.2.25-py3-none-any.whl

Download URL	algorhino_anemone-0.2.25-py3-none-any.whl
Size	430.0 kB
Tags	Python 3
SHA-256 checksum How to use checksums	`bfb6ebcacee6ece1f4e1fec2c086a206c4de1a70777705f53427c151c56be25a`
BLAKE2b-256 checksum How to use checksums	`9c939ba8e57c491408cc1c578c59b8b34bcb4fec1ebb45016e1aedd9456cff79`
Upload date	Sep 23, 2026
Uploaded using Trusted Publishing? What is trusted publishing?	Yes
Uploaded via	`twine/7.0.0 CPython/3.13.14`

Provenance

Identity

Publishing platform: GitHub Actions
Publishing repository: github.com/victorgabillon/anemone
Publishing commit: github.com/victorgabillon/anemone/tree/d08d7530896687fc55e941fa318f49eabdd07cd5

Workflow

Publishing configuration: github.com/victorgabillon/anemone/blob/d08d7530896687fc55e941fa318f49eabdd07cd5/.github/workflows/release.yml
Publishing logs: github.com/victorgabillon/anemone/actions/runs/35823101992/attempts/1

Artifact

Subject: algorhino_anemone-0.2.25-py3-none-any.whl
SHA-256 checksum: bfb6ebcacee6ece1f4e1fec2c086a206c4de1a70777705f53427c151c56be25a Verifying attestations