compose_permutation_matrix

Multiplies individual permutation matrices into one combined matrix.

internal

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

compose_permutation_matrix function

<dl><dt>operations</dt>
<dd>Character vector of operation codes</dd>
<dt>n</dt>
<dd>Integer, state length</dd>
<dt>k</dt>
<dd>Integer, reverse prefix length</dd></dl>

Arguments

Compose permutation matrices for a sequence of operations — compose_permutation_matrix

<dl>

<dt>operations</dt>
<dd>Character vector of operation codes</dd>


<dt>n</dt>
<dd>Integer, state length</dd>


<dt>k</dt>
<dd>Integer, reverse prefix length</dd>

</dl>

compose_permutation_matrix: Compose permutation matrices for a sequence of operations

Description

Usage

Value

Arguments