validate_and_simplify_path

Verifies that a candidate path correctly transforms start_state into
final_state, then attempts to simplify it. Returns the simplified path
if it remains valid, otherwise the original.

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

validate_and_simplify_path function

<dl><dt>path_candidate</dt>
<dd>Character vector of operations</dd>
<dt>start_state</dt>
<dd>Integer vector, start state</dd>
<dt>final_state</dt>
<dd>Integer vector, target state</dd>
<dt>k</dt>
<dd>Integer, parameter for reverse operations</dd></dl>

Arguments

Validate and Simplify a Path — validate_and_simplify_path

<dl>

<dt>path_candidate</dt>
<dd>Character vector of operations</dd>


<dt>start_state</dt>
<dd>Integer vector, start state</dd>


<dt>final_state</dt>
<dd>Integer vector, target state</dd>


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

</dl>

validate_and_simplify_path: Validate and Simplify a Path

Description

Usage

Value

Arguments

Examples