process_final_intersection

Handles an intersection where the meeting state equals the original final state.
Reconstructs path through the start (forward) search tree.

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

process_final_intersection function

<dl><dt>intersection_state</dt>
<dd>Integer vector, the intersecting state</dd>
<dt>reachable_states_start</dt>
<dd>Data frame of forward-search states</dd>
<dt>bridge_states_start</dt>
<dd>List of bridge states for forward search</dd>
<dt>start_index</dt>
<dd>Hash index for forward states</dd>
<dt>v_cols</dt>
<dd>Character vector of V-column names</dd></dl>

Arguments

Process Final-type Intersection — process_final_intersection

<dl>

<dt>intersection_state</dt>
<dd>Integer vector, the intersecting state</dd>


<dt>reachable_states_start</dt>
<dd>Data frame of forward-search states</dd>


<dt>bridge_states_start</dt>
<dd>List of bridge states for forward search</dd>


<dt>start_index</dt>
<dd>Hash index for forward states</dd>


<dt>v_cols</dt>
<dd>Character vector of V-column names</dd>

</dl>

process_final_intersection: Process Final-type Intersection

Description

Usage

Value

Arguments