find_best_match_state

Finds the state in a table that has the minimum Manhattan distance to
a target state. If multiple states tie, selects the one with the
smallest step number.

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

find_best_match_state function

<dl><dt>target_state</dt>
<dd>Integer vector, the target state</dd>
<dt>reachable_states</dt>
<dd>Data frame with V-columns</dd></dl>

Arguments

Find Best Match State — find_best_match_state

<dl>

<dt>target_state</dt>
<dd>Integer vector, the target state</dd>


<dt>reachable_states</dt>
<dd>Data frame with V-columns</dd>

</dl>

find_best_match_state: Find Best Match State

Description

Usage

Value

Arguments