get_reachable_states

Explores the Cayley graph starting from an initial state and applying
a sequence of operations repeatedly until returning to the start state.
Returns detailed information about all visited states, the cycle structure,
and celestial LRX coordinates.

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

get_reachable_states function

<dl><dt>start_state</dt>
<dd>Integer vector, the initial permutation state</dd>
<dt>allowed_positions</dt>
<dd>Character vector, sequence of operations to repeat</dd>
<dt>k</dt>
<dd>Integer, parameter for reverse operations</dd>
<dt>verbose</dt>
<dd>Logical; if TRUE, prints progress and cycle information (default FALSE)</dd></dl>

Arguments

Find Cycle in Permutation Group — get_reachable_states

<dl>

<dt>start_state</dt>
<dd>Integer vector, the initial permutation state</dd>


<dt>allowed_positions</dt>
<dd>Character vector, sequence of operations to repeat</dd>


<dt>k</dt>
<dd>Integer, parameter for reverse operations</dd>


<dt>verbose</dt>
<dd>Logical; if TRUE, prints progress and cycle information (default FALSE)</dd>

</dl>

get_reachable_states: Find Cycle in Permutation Group

Description

Usage

Value

Arguments

Examples