short_path_bfs

Shorten Path via Greedy BFS Hopping

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_path_bfs function

<dl><dt>path</dt>
<dd>Character vector of operations ("1"/"2"/"3" or "L"/"R"/"X")</dd>
<dt>start_state</dt>
<dd>Integer vector, the starting permutation state</dd>
<dt>k</dt>
<dd>Integer, parameter for reverse_prefix operation</dd>
<dt>n_hits</dt>
<dd>Integer, number of path points to find in BFS cloud (default 5)</dd></dl>

Arguments

Shorten Path via Greedy BFS Hopping — short_path_bfs

<dl>

<dt>path</dt>
<dd>Character vector of operations ("1"/"2"/"3" or "L"/"R"/"X")</dd>


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


<dt>k</dt>
<dd>Integer, parameter for reverse_prefix operation</dd>


<dt>n_hits</dt>
<dd>Integer, number of path points to find in BFS cloud (default 5)</dd>

</dl>

short_path_bfs: Shorten Path via Greedy BFS Hopping

Description

Usage

Value

Arguments