Package: cayleyR
Type: Package
Title: Cayley Graph Analysis for Permutation Puzzles
Version: 0.3.0
Authors@R: c(
    person(
      "Yuri", "Baramykov",
      email = "lbsbmsu@mail.ru",
      role = c("aut", "cre"),
      comment = c(ORCID = "0009-0000-7627-4217")
    ),
    person("Lucas", "Garron", role = c("ctb", "cph"),
           comment = "twips search machinery in src/kociemba_core.h, src/kociemba4.h"),
    person("cubing.js authors", role = "cph",
           comment = "twips, https://github.com/cubing/twips")
  )
Description: Analyzes Cayley graphs of permutation puzzles. Any puzzle
    whose moves permute a fixed set of positions can be declared as a
    permutation group, and the same tools then work on it: cycle
    detection, state space exploration and path search. Two puzzles are
    built in: TopSpin and Rubik's cubes of any size. The 3x3x3 is solved
    by four human methods and by a two-phase search after Herbert
    Kociemba; the 4x4x4 is solved by reduction.
    The Iterative Cycle Intersection (ICI) method is described in Yuri
    Baramykov (2026) <doi:10.48550/arXiv.2607.13219>.
License: MIT + file LICENSE
Encoding: UTF-8
RoxygenNote: 7.3.3
Imports: Rcpp, utils
LinkingTo: Rcpp
Suggests: testthat (>= 3.0.0), ggmlR, parallel, data.table, jsonlite,
        knitr, rmarkdown
Config/testthat/edition: 3
VignetteBuilder: knitr
URL: https://github.com/Zabis13/cayleyR,
        https://arxiv.org/abs/2607.13219
BugReports: https://github.com/Zabis13/cayleyR/issues
NeedsCompilation: yes
Packaged: 2026-10-19 10:59:05 UTC; yuri
Author: Yuri Baramykov [aut, cre] (ORCID:
    <https://orcid.org/0009-0000-7627-4217>),
  Lucas Garron [ctb, cph] (twips search machinery in src/kociemba_core.h,
    src/kociemba4.h),
  cubing.js authors [cph] (twips, https://github.com/cubing/twips)
Maintainer: Yuri Baramykov <lbsbmsu@mail.ru>
Repository: CRAN
Date/Publication: 2026-10-19 12:20:08 UTC
Built: R 4.5.2; x86_64-apple-darwin20; 2026-10-19 12:41:38 UTC; unix
Archs: cayleyR.so.dSYM
