Cayley Graph Analysis for Permutation Puzzles

[Up] [Top]

Documentation for package ‘cayleyR’ version 0.3.0

Help Pages

A B C D E F G H I K L M O P R S T V

-- A --

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

-- B --

bidirectional_bfs Bidirectional BFS Shortest Path
breakpoint_distance Breakpoint Distance Between Two States
build_permutation_matrix Build permutation matrix for a single operation

-- C --

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
cube_adi Autodidactic Iteration on a Permutation Puzzle
cube_adi_astar Batch Weighted A* With a Learned Heuristic
cube_adi_load Load a Trained ADI Network
cube_adi_model Build the Value and Policy Networks
cube_adi_save Save a Trained ADI Network
cube_adi_solve Solve a Cube With a Trained Network
cube_adi_train Train Value and Policy by Autodidactic Iteration
cube_alg_table The Algorithm Tables
cube_apply_word Apply a Word of Moves to a Cube State
cube_at_phase_goal_cpp The 4x4x4 reduction phases, one call at a time
cube_build_lslice Build the Layer Beside a Face, at Any Size
cube_central_moves Slice Turns That Reorient the Whole Cube
cube_centre_counts Count the Centre Pieces That Are Home
cube_centre_cycles Three-Cycles of Centres, One Per Orbit
cube_centre_map_family The Centres of a Cube of Any Size, Derived
cube_centre_positions Sticker Positions of the Six Centres
cube_centre_shots Commutators That Carry Centres Off One Face and Spare Another
cube_centre_structure Centre Stickers of an N x N x N Cube
cube_colours Colours and Positions: the Two Ways to Write a Cube Down
cube_colour_state Colours and Positions: the Two Ways to Write a Cube Down
cube_edge_algs The Published Edge-Pairing Algorithms, at Any Size
cube_edge_counts How Many Edges Are Whole
cube_edge_map Where a Turn Sends Each Edge Piece
cube_edge_map_family The Edges of a Cube of Any Size, Derived
cube_edge_structure Edge Pieces of an N x N x N Cube
cube_empty_u_slice Empty the Top Face onto the Sides
cube_expand_alg Expand an Algorithm into the Package's Alphabet
cube_expand_move Wide Turns and Whole-Cube Rotations
cube_expand_word Wide Turns and Whole-Cube Rotations
cube_free_moves The Layer Beside a Face, and What Leaves It Alone
cube_group The Group of an N x N x N Cube
cube_identity Solved State of an N x N x N Cube
cube_is_colour_solved Test Whether Every Face of a Cube is a Single Colour
cube_is_reduced Is a Cube Reduced?
cube_kociemba Solve a 3x3x3 by Two-Phase Search
cube_kociemba4 Solve a 4x4x4 by Four-Phase Search
cube_kociemba4_fill_phase3_cpp The 4x4x4 reduction phases, one call at a time
cube_kociemba4_phase12_cpp The 4x4x4 reduction phases, one call at a time
cube_kociemba4_phase3_cpp The 4x4x4 reduction phases, one call at a time
cube_kociemba4_reduce Reduce a 4x4x4 by Four-Phase Search
cube_kociemba4_report What the Last 4x4x4 Reduction Did
cube_kociemba4_tables_cpp The 4x4x4 reduction phases, one call at a time
cube_kociemba_init Build the Kociemba Prune Tables
cube_kociemba_report What the Last Kociemba Solve Did
cube_layer_move A Single Layer Turn, by Axis and Layer
cube_lslice_cells The Layer Beside a Face, and What Leaves It Alone
cube_moves Move Table of an N x N x N Cube
cube_moves_santa Translate Between Santa 2023 and Package Move Names
cube_move_names Move Names of an N x N x N Cube
cube_nnn Cubes of Any Size
cube_orbits Orbits of an N x N x N Cube
cube_orbits_family Piece Orbits of a Cube of Any Size
cube_pair_edges Pair the Edges of a Cube of Any Size
cube_phase3_coord_cpp The 4x4x4 reduction phases, one call at a time
cube_pieces Pieces of an N x N x N Cube
cube_pieces_home Pieces Home on a Cube
cube_piece_layout The Piece Layout a Cube State Is Read Through
cube_predicates Stage Predicates of a Cube State
cube_progress How Much of Each Orbit Is Solved
cube_read_state Read a Cube State as Pieces
cube_reduce_best Reduce a 4x4x4, Trying Every Starting Face
cube_reduce_cpp Reduce a 4x4x4 by the human method
cube_santa The Santa 2023 Cube Notation
cube_santa_group A Cube Group in Santa 2023 Notation
cube_santa_moves Translate Between Santa 2023 and Package Move Names
cube_santa_move_names Santa 2023 Move Names for a Cube
cube_santa_path Translate a Santa 2023 Solution Path
cube_santa_path_out Translate a Santa 2023 Solution Path
cube_santa_perm Sticker Relabelling Between Santa 2023 and This Package
cube_santa_state Read and Write Santa 2023 Cube States
cube_santa_state_out Read and Write Santa 2023 Cube States
cube_slice_cells_cpp The Layer Beside a Face, as the 4x4x4 Solver Sees It
cube_slice_map Where a Slice Turn Sends Each Centre
cube_solve4 Solve a 4x4x4 Cube by Reduction
cube_solve4_cascade Solve a 4x4x4 by reduction, falling back when the search does not pay off
cube_solve_centres Solve the Centres of a 4x4x4 Cube
cube_solve_cfop Solve a 3x3x3 Cube by CFOP
cube_solve_lbl Solve a 3x3x3 Cube Layer by Layer
cube_solve_m2 Solve a 3x3x3 Cube by M2
cube_solve_old_pochmann Solve a 3x3x3 Cube by Old Pochmann
cube_to_pieces4_cpp The 4x4x4 reduction phases, one call at a time
cube_wide_move Wide Turns and Whole-Cube Rotations
cube_wide_turn Wide Turns of an N x N x N Cube
cube_wide_word Wide Turns and Whole-Cube Rotations
cube_wing_geometry_cpp The 4x4x4 reduction phases, one call at a time
cube_word_order Order of a Word of Moves
cycle_shortcut Shorten a Path by Cutting Across Cycles

-- D --

distance_methods Distance Methods for Bridge Selection

-- E --

enclosing_hull_3d Enclosing Hull Through Every Point

-- F --

find_best_match_cube4_model Score Candidate States With a Trained 4x4x4 Model
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

-- G --

generate_state Generate Reachable Random State
generate_unique_states_df Generate Data Frame of Unique Random States
generate_walk Random Walks From the Solved State, With the Moves They Took
get_reachable_states Find Cycle in Permutation Group
get_reachable_states_light Find Cycle Length (Lightweight Version)
group_apply Apply a Move Sequence Through a Group
group_compose Compose a Move Sequence into One Permutation
group_identity Solved State of a Group
group_inverse_seq Invert a Move Sequence
group_moves Move Alphabet of a Group
group_move_index Resolve Move Names to Indices Within a Group
group_order Order of a Move Sequence in a Group
group_parse_word Parse a Word Written as One String

-- H --

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

-- I --

invert_path Invert a Path of Operations
is_perm_group Test Whether an Object is a Permutation Group

-- K --

kociemba4_phases The 4x4x4 reduction phases, one call at a time

-- L --

landmark_states Generate Landmark States for a Permutation of Size n

-- M --

manhattan_distance Manhattan Distance Between Two States
manhattan_distance_matrix_gpu Compute Pairwise Manhattan Distance Matrix on GPU

-- O --

openmp_threads Number of OpenMP Threads Available

-- P --

perm_group Create a Permutation Group from a Table of Moves
perm_group_intro Permutation Groups
print.perm_group Print a Permutation Group

-- R --

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

-- S --

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_group Group Attached to a State 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

-- T --

topspin_group Create the TopSpin Group

-- V --

validate_and_simplify_path Validate and Simplify a Path