build_permutation_matrix

Creates an n x n permutation matrix (column-major, F32) that represents
a single operation. When multiplied: new_state = state %*% P.

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

build_permutation_matrix function

<dl><dt>op</dt>
<dd>Character, operation code ("L"/"1", "R"/"2", "X"/"3")</dd>
<dt>n</dt>
<dd>Integer, state length</dd>
<dt>k</dt>
<dd>Integer, reverse prefix length</dd></dl>

Arguments

Build permutation matrix for a single operation — build_permutation_matrix

<dl>

<dt>op</dt>
<dd>Character, operation code ("L"/"1", "R"/"2", "X"/"3")</dd>


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


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

</dl>

build_permutation_matrix: Build permutation matrix for a single operation

Description

Usage

Value

Arguments