generate_unique_states_df

Generates a data frame with unique random permutation states.

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

generate_unique_states_df function

<dl><dt>n</dt>
<dd>Integer, size of each permutation state</dd>
<dt>n_rows</dt>
<dd>Integer, number of unique states to generate</dd></dl>

Arguments

Generate Data Frame of Unique Random States — generate_unique_states_df

<dl>

<dt>n</dt>
<dd>Integer, size of each permutation state</dd>


<dt>n_rows</dt>
<dd>Integer, number of unique states to generate</dd>

</dl>

generate_unique_states_df: Generate Data Frame of Unique Random States

Description

Usage

Value

Arguments

Examples