short_position

Removes redundant operations from a path: cancels inverse pairs ("1"+"2",
"3"+"3"), reduces chains of shifts modulo n, and simplifies blocks
between reverses.

Implements algorithms for analyzing Cayley graphs of permutation groups,
with a focus on the TopSpin puzzle and similar permutation-based combinatorial
puzzles. Provides methods for cycle detection, state space exploration,
bidirectional BFS pathfinding, and finding optimal operation sequences
in permutation groups generated by shift and reverse operations.
Includes C++ implementations of core operations via 'Rcpp' for performance.
Optional GPU acceleration via 'ggmlR' Vulkan backend for batch distance
calculations and parallel state transformations.

Yuri Baramykov

cayleyR

Cayley Graph Analysis for Permutation Puzzles

short_position function

<dl><dt>allowed_positions</dt>
<dd>Character vector of operations to simplify</dd>
<dt>n</dt>
<dd>Integer, size of the permutation ring (used for modular reduction)</dd></dl>

Arguments

Simplify Operation Path — short_position

<dl>

<dt>allowed_positions</dt>
<dd>Character vector of operations to simplify</dd>


<dt>n</dt>
<dd>Integer, size of the permutation ring (used for modular reduction)</dd>

</dl>

short_position: Simplify Operation Path

Description

Usage

Value

Arguments

Examples