manhattan_distance

Computes the sum of absolute differences between corresponding elements
of two permutation states.

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

manhattan_distance function

<dl><dt>start_state</dt>
<dd>Integer vector, first state</dd>
<dt>target_state</dt>
<dd>Integer vector, second state</dd></dl>

Arguments

Manhattan Distance Between Two States — manhattan_distance

<dl>

<dt>start_state</dt>
<dd>Integer vector, first state</dd>


<dt>target_state</dt>
<dd>Integer vector, second state</dd>

</dl>

manhattan_distance: Manhattan Distance Between Two States

Description

Usage

Value

Arguments

Examples