Commits

Show all
Author Commit Message Labels Comments Date
Evan Gates
think I've got transition tables up
Evan Gates
start new array based implementation to explore symmetries
Evan Gates
add solve.bash
Evan Gates
merge
Evan Gates
remove distribute and gather
Evan Gates
get rid of all the options. worry about those when the code is clean and fast
Evan Gates
update TODO
Evan Gates
first pass at using depth % 3 for pruning tables. only 1 table per phase. still extremely sloppy, and slower than I'd like.
Evan Gates
solve is void, not int. cleanup
Evan Gates
faster init_prune, start searches at max prune value instead of 0
Evan Gates
fixed and better pruning table for 2_solve (although guess it's not a pruning table anymore is it?)
Evan Gates
faster iterative init_prune for 2x2x2 solver
Evan Gates
bunch of messy experiements for target length, first pass at exponential damping with small list
Evan Gates
merge
Evan Gates
add one_sol, max_p1d, interval, optimal
Evan Gates
first pass at adjusting timeout to meet target length solutions. sloppy, wrong, underdamped, get wild swings.
Evan Gates
cleanup
Evan Gates
add PHASE enums, move some code from solve() to begin_phase2()
Evan Gates
update README
Evan Gates
decrement intsead of assignment
Evan Gates
cleanup, add option to updated printout every m lines
Evan Gates
add SOLVE variable to easily change binary/arguments, kill all pids
Evan Gates
add programs to makefile
Evan Gates
add 2_all to generate all possible 2x2x2 cube states, 2_rand for random states
Evan Gates
instead of searching with prune tables, generate full cube space and iterate across it to solve
Evan Gates
update TODO
Evan Gates
use 2 coordinates for all pruning tables, write/read table file, some more options
Evan Gates
don't recross boundaries between phase 1 and 2 (misses some solutions, won't prove optimal, but faster according to kociemba)
Evan Gates
fix max_len vs len
Evan Gates
add some options, a little cleanup
  1. Prev
  2. Next