d0x2f / Casspir / 35

Builds Branch Commit Type Ran Committer Via Coverage
35 master Add back random moves. push d0x2f travis-ci pending completion   set done
34 master A random move will never be necessary. Fixed bug where the solver would attempt to convenience flip when it shouldn't. push d0x2f travis-ci pending completion   set done
33 master Improved the algorithm by considering all groups available and choosing the least risky move found. push d0x2f travis-ci pending completion   set done
32 master Special case: if the total number of remaining tiles is low, then do a permutation search on all remaining tiles. push d0x2f travis-ci pending completion   set done
31 master Update README.md push web-flow travis-ci pending completion   set done
30 master Use the same random engine instance to avoid generating the same number over and over. push d0x2f travis-ci pending completion   set done
29 master remove debug output push d0x2f travis-ci pending completion   set done
28 master Check if the map is in progress or not before determining completion. push d0x2f travis-ci pending completion   set done
27 master Implemented the permutation solver. All puzzles should be attempted until completion now. Changed lists of positions to sets. Added test for a harder puzzle that requires the permutation solver to kick in. push d0x2f travis-ci pending completion   set done
26 master Made use of the casspir_solve lib function. push d0x2f travis-ci pending completion   set done
25 master Missing default return value. push d0x2f travis-ci pending completion   set done
23 master Removed debugging output. push d0x2f travis-ci pending completion   set done
22 master Added a basic solver that simply checks if each tile's value is satisfied or not. push d0x2f travis-ci pending completion   set done
21 master Added get_tile method that simplifies some array access code. push d0x2f travis-ci pending completion   set done
20 master Define an "Operation" that the solver will generate. push d0x2f travis-ci pending completion   set done