R: Cayley Graph Analysis for Permutation Puzzles

# Cayley Graph Analysis for Permutation Puzzles

## Documentation for package ‘cayleyR’ version 0.2.6

- DESCRIPTION file.
- User guides, package vignettes and other documentation.
- Package NEWS.

## Help Pages

analyze_top_combinations | Analyze Top Operation Combinations
apply_operations | Apply Sequence of Operations
apply_operations_batch_gpu | Apply operations to batch of states on GPU
bidirectional_bfs | Bidirectional BFS Shortest Path
breakpoint_distance | Breakpoint Distance Between Two States
build_permutation_matrix | Build permutation matrix for a single operation
calculate_angular_distance_z | Angular Distance Between Two Celestial Points
calculate_differences | Calculate Manhattan Distances for All States
calculate_midpoint_z | Midpoint Between Two Celestial Coordinates
cayley_bfs_full | Full Breadth-First Search Over the Cayley Graph
cayley_distance | Distance Methods for Bridge Selection
cayley_distance_methods | Distance Methods for Bridge Selection
cayley_gpu_available | Check if GPU acceleration is available
cayley_gpu_free | Free GPU backend resources
cayley_gpu_init | Initialize GPU backend
cayley_gpu_status | Get GPU status information
cayley_graph_diameter | Cayley Graph Diameter and Maximally Distant State Pairs
check_duplicates | Find Duplicate States Between Two Tables
compose_permutation_matrix | Compose permutation matrices for a sequence of operations
convert_digits | Convert String to Integer Vector of Digits
convert_LRX_to_celestial | Convert LRX Counts to Celestial Coordinates
convex_hull_3d | Convex Hull of a 3-D Point Cloud
create_state_store | Create a New State Store
cycle_shortcut | Shorten a Path by Cutting Across Cycles
distance_methods | Distance Methods for Bridge Selection
enclosing_hull_3d | Enclosing Hull Through Every Point
find_best_match_human | Score Candidate States the Way a Person Solves
find_best_random_combinations | Find Best Random Operation Sequences
find_closest_to_coords | Find Closest State to Target Coordinates
find_combination_in_states | Find a State in Reachable States Table
find_path_bfs | Find Path via BFS Highways
find_path_iterative | Iterative Path Finder Between Permutation States
generate_state | Generate Reachable Random State
generate_unique_states_df | Generate Data Frame of Unique Random States
get_reachable_states | Find Cycle in Permutation Group
get_reachable_states_light | Find Cycle Length (Lightweight Version)
human_algorithm | Solve a State with the Human TopSpin Algorithm
human_algorithm_to | Human Algorithm Path Between Two Arbitrary States
human_phase1_navigate | Follow the Phase 1 Navigator to the Tail
human_phase1_rank | Rank Candidate Moves by the Phase 1 Criterion
invert_path | Invert a Path of Operations
landmark_states | Generate Landmark States for a Permutation of Size n
manhattan_distance | Manhattan Distance Between Two States
manhattan_distance_matrix_gpu | Compute Pairwise Manhattan Distance Matrix on GPU
openmp_threads | Number of OpenMP Threads Available
reconstruct_bfs_path | Reconstruct path from sparse BFS result
reverse_prefix | Reverse First k Elements (with Coordinates)
reverse_prefix_simple | Reverse First k Elements (Simple)
run_length | Length of the Sorted Run on the Ring
save_bridge_states | Save Bridge States to CSV
select_unique | Select Unique States by V-columns
shift_left | Shift State Left (with Coordinates)
shift_left_simple | Shift State Left (Simple)
shift_right | Shift State Right (with Coordinates)
shift_right_simple | Shift State Right (Simple)
short_path_bfs | Shorten Path via Depth-Limited BFS Hopping
short_position | Simplify Operation Path
sparse_bfs | Sparse BFS with Look-ahead and Hybrid Selection
state_store_indices_for_cycle | Query a State Store
state_store_perm_length | Query a State Store
state_store_query | Query a State Store
state_store_size | Query a State Store
state_store_unique_count | Query a State Store
store_add_from_df | Add States to Store from Data Frame
store_analyze_combos | Analyze Combinations Directly into Store
store_analyze_combos_gpu | Analyze Combinations into Store Using GPU Batch Operations
store_clear | Drop All States From a Store
store_clear_opd | Clear All OPD Filters
store_collect_ops | Collect Operations Leading to a State Within One Cycle
store_combos_for_state | Find Combo Numbers Containing a State in a Cycle
store_filter_middle | Filter Middle States for a Cycle
store_find_best_match | Find Best Match by Manhattan Distance
store_find_intersections | Find Intersections Between Two Stores
store_get_meta | Get Metadata for a State
store_get_state | Get State from Store
store_lookup | Lookup State Indices by State Vector
store_reconstruct_path | Reconstruct Path from Store
store_set_opd | Set OPD Combo Filter for a Cycle
store_to_dataframe | Convert Store to Data Frame
validate_and_simplify_path | Validate and Simplify a Path