filter_middle_states

Removes the first and last steps from each combo within cycle data,
keeping only middle states.

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

filter_middle_states function

<dl><dt>data</dt>
<dd>Data frame with step and combo_number columns</dd>
<dt>skip_first</dt>
<dd>Integer, number of initial steps to skip per combo</dd>
<dt>skip_last</dt>
<dd>Integer, number of final steps to skip per combo</dd></dl>

Arguments

Filter Middle States — filter_middle_states

<dl>

<dt>data</dt>
<dd>Data frame with step and combo_number columns</dd>


<dt>skip_first</dt>
<dd>Integer, number of initial steps to skip per combo</dd>


<dt>skip_last</dt>
<dd>Integer, number of final steps to skip per combo</dd>

</dl>

filter_middle_states: Filter Middle States

Description

Usage

Value

Arguments