find_closest_to_coords

Searches a table of reachable states for the state whose celestial
coordinates are closest to a target coordinate set.

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

find_closest_to_coords function

<dl><dt>reachable_states</dt>
<dd>Data frame with columns theta, phi,
omega_conformal, and V-columns for state</dd>
<dt>target_coords</dt>
<dd>List with component <code>z</code> (complex number)</dd>
<dt>v_cols</dt>
<dd>Character vector of V-column names</dd></dl>

Arguments

Find Closest State to Target Coordinates — find_closest_to_coords

<dl>

<dt>reachable_states</dt>
<dd>Data frame with columns theta, phi,
omega_conformal, and V-columns for state</dd>


<dt>target_coords</dt>
<dd>List with component <code>z</code> (complex number)</dd>


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

</dl>

find_closest_to_coords: Find Closest State to Target Coordinates

Description

Usage

Value

Arguments

Examples