Cayley Graph Analysis for Permutation Puzzles R package cayleyR version 0.2.6 Implements algorithms for analyzing Cayley graphs of permutation groups for the TopSpin puzzle. Provides methods for cycle detection, state space exploration and finding optimal operation sequences in permutation groups generated by shift and reverse operations. Also provides rule-defined landmark states for probing graphs too large to enumerate, and convex and non-convex hulls for measuring the solid such states span. The method Iterative Cycle Intersection (ICI) is described in Yuri Baramykov (2026) <doi:10.48550/arXiv.2607.13219>. Software Imports: Rcpp LinkingTo: Rcpp Suggests: testthat (>= 3.0.0), ggmlR, data.table, knitr, rmarkdown Yuri Baramykov <lbsbmsu@mail.ru> Comprehensive R Archive Network (CRAN) Yuri Baramykov [aut, cre] (ORCID: <https://orcid.org/0009-0000-7627-4217>) MIT + file LICENSE (https://CRAN.R-project.org/package=cayleyR/LICENSE) 2026-07-29 application/tgz https://CRAN.R-project.org/package=cayleyR doi:10.32614/CRAN.package.cayleyR