breakpoint_distance

Counts the number of positions where consecutive elements differ by
more than 1 (breakpoints). Particularly effective for TopSpin puzzles
where operations shift blocks and flip prefixes.

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

breakpoint_distance function

<dl><dt>start_state</dt>
<dd>Integer vector, first state</dd>
<dt>target_state</dt>
<dd>Integer vector, second state</dd></dl>

Arguments

Breakpoint Distance Between Two States — breakpoint_distance

<dl>

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


<dt>target_state</dt>
<dd>Integer vector, second state</dd>

</dl>

breakpoint_distance: Breakpoint Distance Between Two States

Description

Usage

Value

Arguments

Examples