select_new_state

Selects a new state from candidate states that is close to an opposite
state (by Manhattan distance). Randomly picks from the top 10 closest.

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

select_new_state function

<dl><dt>target_all</dt>
<dd>Data frame of candidate states</dd>
<dt>opposite_state</dt>
<dd>Integer vector, the state to be close to</dd></dl>

Arguments

Select New Bridge State — select_new_state

<dl>

<dt>target_all</dt>
<dd>Data frame of candidate states</dd>


<dt>opposite_state</dt>
<dd>Integer vector, the state to be close to</dd>

</dl>

select_new_state: Select New Bridge State

Description

Usage

Value

Arguments