A heuristic search method, iterative cycle intersection with distance-guided bridges, finds verified TopSpin move sequences in seconds for tested n up to 16; claims of scaling to n≈20 are not directly demonstrated.
(2026).cayleyR: Cayley Graph Analysis for Permutation Puzzles
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
CayleyR: Solving the TopSpin puzzle via cycle intersection
A heuristic search method, iterative cycle intersection with distance-guided bridges, finds verified TopSpin move sequences in seconds for tested n up to 16; claims of scaling to n≈20 are not directly demonstrated.