Geometry-aware MCTS with incremental constraint updates and symmetry pruning yields new best-known configurations for five of six tested combinatorial geometry problems, including ~1.8n points for Max-N3IL on grids 82-119.
Tom Vodopivec, Spyridon Samothrakis, and Branko Šter
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
An optimistic confidence-interval ranking procedure for best-arm identification across multiple independent bandits yields lower average simple regret and error probability than prior methods when selecting high-performing agents for each game in GVGAI and Ludii.
citing papers explorer
-
Geometry-Aware MCTS for Extremal Problems in Combinatorial Geometry
Geometry-aware MCTS with incremental constraint updates and symmetry pruning yields new best-known configurations for five of six tested combinatorial geometry problems, including ~1.8n points for Max-N3IL on grids 82-119.
-
Best Agent Identification for General Game Playing
An optimistic confidence-interval ranking procedure for best-arm identification across multiple independent bandits yields lower average simple regret and error probability than prior methods when selecting high-performing agents for each game in GVGAI and Ludii.